{"$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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"DM9","name":"Scattered domain decisions","shortDescription":{"text":"Scattered domain decisions"},"helpUri":"https://codehealth.canine.dev/dimensions/DM9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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":"config.validateConfig (cyclomatic 191): config.validateConfig has cyclomatic complexity 191 (threshold 15). Of this number, 190 points are the body\u0027s own statements and 1 belongs to one function literal 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":"src/config.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"994929de2d7cfb691ac330f9cc55ab95323c0c0889d959eb01ee71897f0638f8"}},{"ruleId":"D1","level":"warning","message":{"text":"security.handleSecurity (cyclomatic 190): security.handleSecurity has cyclomatic complexity 190 (threshold 15). Of this number, 185 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d435b137ddd45bd725ccdf257a4e6b8d2d879a5b6da1912648905eb4413a65"}},{"ruleId":"D1","level":"warning","message":{"text":"core.handleCore (cyclomatic 158): core.handleCore has cyclomatic complexity 158 (threshold 15). Of this number, 130 points are the body\u0027s own statements and 28 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94218d1a4e761d573531299c9fa97f89ea321aab82a56e41bd29ab700f8379b"}},{"ruleId":"D1","level":"warning","message":{"text":"memory.register (cyclomatic 142): memory.register has cyclomatic complexity 142 (threshold 15). Most of this is not in the body itself: 1 of the 142 points is its own statement and the rest belongs to 24 function literals inside it that branch (lines 910, 108, 502, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/memory.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e746c2e0bc50280326a6c23f4a599f391adb482f21b251c684ca6b2f8772134"}},{"ruleId":"D1","level":"warning","message":{"text":"pattern.register (cyclomatic 120): pattern.register has cyclomatic complexity 120 (threshold 15). Most of this is not in the body itself: 1 of the 120 points is its own statement and the rest belongs to one function literal inside it that branches (line 58). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ad932479268abcc88845e408dea8f9cf19901602b649e8dd04e692a6c8cd61"}},{"ruleId":"D1","level":"warning","message":{"text":"data.register (cyclomatic 117): data.register has cyclomatic complexity 117 (threshold 15). Most of this is not in the body itself: 1 of the 117 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 61, 612, 673, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/data.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f80c8d14ec7e617f0011d20c2ed42ba5dac9bbeb8f116bf6c68c56d64b1697e"}},{"ruleId":"D1","level":"warning","message":{"text":"code-health.handleCodeHealth (cyclomatic 115): code-health.handleCodeHealth has cyclomatic complexity 115 (threshold 15). Of this number, 112 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":"src/mcp/handlers/code-health.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb026bf971a7dab3fd5e59d2361e60cdae6891b3f99dbe9a56e78a16d0300fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.getLanguageSpecificKind (cyclomatic 113): extractor.getLanguageSpecificKind has cyclomatic complexity 113 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a840eee7e018b3b885a5d9012c04c9d57d4859755eddaecc432bc2a6d4276"}},{"ruleId":"D1","level":"warning","message":{"text":"security-export.generateHtml (cyclomatic 109): security-export.generateHtml has cyclomatic complexity 109 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 54 belong to 9 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-export.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a335f0acae06030d5159d824368d3d9a184f8e05366c76228c5a876b92f30114"}},{"ruleId":"D1","level":"warning","message":{"text":"architecture.handleArchitecture (cyclomatic 98): architecture.handleArchitecture has cyclomatic complexity 98 (threshold 15). Of this number, 89 points are the body\u0027s own statements and 9 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb9cb5a5788f75f449bd2610316515c81cbb315a621dd69f3fba39e149483a"}},{"ruleId":"D1","level":"warning","message":{"text":"vulns.register (cyclomatic 93): vulns.register has cyclomatic complexity 93 (threshold 15). Most of this is not in the body itself: 1 of the 93 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 46, 315, 270, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/vulns.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d67a3c6be03fb38211c8e7bb4f84f5b09e7dda26a1a8d3828769b1b72d6955"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runInstaller (cyclomatic 80): index.runInstaller has cyclomatic complexity 80 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/index.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff7ed291b1d4b63a26ed192ad4d594e8f4672fc3c31555517fc2238f8f5389b"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolHandler.dispatch (cyclomatic 78): ToolHandler.dispatch has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84173987ca2a4ad1423c48ab17604fb2868b5ea52ba346a0bf18440b14abe5d"}},{"ruleId":"D1","level":"warning","message":{"text":"memory.handleMemory (cyclomatic 77): memory.handleMemory has cyclomatic complexity 77 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 12 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e039572851490b1404b398b0c7e23b89fe092ebd6623cdbf419ac08d15361ed"}},{"ruleId":"D1","level":"warning","message":{"text":"git-context.handleGitContext (cyclomatic 71): git-context.handleGitContext has cyclomatic complexity 71 (threshold 15). Of this number, 70 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6456230d7031d105abe63e3e134bfbb9f68d0035bdaad2311e6cde989a074df"}},{"ruleId":"D1","level":"warning","message":{"text":"data.handleData (cyclomatic 71): data.handleData has cyclomatic complexity 71 (threshold 15). Of this number, 69 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e9324af848f4895f9bd48c0503e607f256087454df29f85ed391e56f8c2ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexPipeline.syncNow (cyclomatic 66): IndexPipeline.syncNow has cyclomatic complexity 66 (threshold 15). Of this number, 62 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":"src/core/pipeline.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef6408817e268a6eb1063e1f361231d50950504ef0577e78f94ee962a774399"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexPipeline.indexAllNow (cyclomatic 65): IndexPipeline.indexAllNow has cyclomatic complexity 65 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 13 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de326c6a6d3e27d0ae233d81de532f6fcc0bf43775e91f500f036734b901280"}},{"ruleId":"D1","level":"warning","message":{"text":"complexity.handleComplexity (cyclomatic 64): complexity.handleComplexity has cyclomatic complexity 64 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/complexity.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb1ca7c557e534595ec4f6226856486053233332e6930eb1ae47e3eee8222ac"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchitectureAnalyzer.analyze (cyclomatic 60): ArchitectureAnalyzer.analyze has cyclomatic complexity 60 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/index.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1208887c7fd42a3e6f9b6aedded1f67ae2c4434df44c2946c3199fab2bb4cd80"}},{"ruleId":"D1","level":"warning","message":{"text":"steering.buildSteeringContent (cyclomatic 60): steering.buildSteeringContent has cyclomatic complexity 60 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/steering.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b593fa3ddbef8fe04c95a4a309e907fedcab07b5960953cea99a8f9a617daf2"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.register (cyclomatic 57): docs.register has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 1 of the 57 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 116, 296, 32, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/docs.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bb640a7ccfca72975e532641723de740ca777417bf60f315c096b7121d53c4"}},{"ruleId":"D1","level":"warning","message":{"text":"wiki.register (cyclomatic 56): wiki.register has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 1 of the 56 points is its own statement and the rest belongs to 12 function literals inside it that branch (lines 387, 126, 254, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/wiki.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ddbe14f8f03129bd07b8bf7918e55999df22ca16ec5a61c17c1c228bd94f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"wiki.handleWiki (cyclomatic 53): wiki.handleWiki has cyclomatic complexity 53 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e229616e9c9eb9c82e773806b0260f2aa4a079503107e01c60b0410aebb2abb3"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorManager.embedAll (cyclomatic 52): VectorManager.embedAll has cyclomatic complexity 52 (threshold 15). Of this number, 51 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":"src/vectors/index.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd8e4f2c72fd890b1dac0a4b7dceae59a29d4b6a580d320d8d21b481d668958"}},{"ruleId":"D1","level":"warning","message":{"text":"patterns.handlePatterns (cyclomatic 52): patterns.handlePatterns 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":"src/mcp/handlers/patterns.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d337742cf4a3220ad71aae7fa352dabdabf5e0872007aa71db8106284e6bafc"}},{"ruleId":"D1","level":"warning","message":{"text":"infra.extractYaml (cyclomatic 50): infra.extractYaml has cyclomatic complexity 50 (threshold 15). Of this number, 46 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":"src/extraction/infra.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5d1a57602a3c519943f91456917296e60660f60e2d5256eeb894146887782d"}},{"ruleId":"D1","level":"warning","message":{"text":"steering.writeWorkflowSteering (cyclomatic 49): steering.writeWorkflowSteering 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":"src/bin/installer/steering.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862994362554c1e6a2b3e366f91714b6cac8bd80dac0eada7905db81957e0e6"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.extractImportSource (cyclomatic 44): extractor.extractImportSource 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":"src/extraction/extractor.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"4584df6226c4a7b837aff1f5c46d3f788d8b2892eb5904e35f3f8b048365cf27"}},{"ruleId":"D1","level":"warning","message":{"text":"edit-primitives.handleEditPrimitives (cyclomatic 44): edit-primitives.handleEditPrimitives 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":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdc0578b6245bddff4a9bacae46640eee1885cb439207f7f4d64a2510f1f759"}},{"ruleId":"D1","level":"warning","message":{"text":"naive-cost.estimateNaiveCost (cyclomatic 43): naive-cost.estimateNaiveCost has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/naive-cost.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"707afacd51dcc3f15e1e8e377d882ae7b3d4e1097200a046dbf0cd7fc70ebff3"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest.register (cyclomatic 41): manifest.register has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 13, 59, 97). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/manifest.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3145490cef65c82f82ad3c6f1e40ac62cd280688085ee843b3d38f13111ff7"}},{"ruleId":"D1","level":"warning","message":{"text":"status.register (cyclomatic 40): status.register has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to one function literal inside it that branches (line 12). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/status.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61eaf44191598012c477ed1bf5ccb3fc20a9f875f6eef6765196bc14c906025"}},{"ruleId":"D1","level":"warning","message":{"text":"native-views.findNativeViewManagers (cyclomatic 39): native-views.findNativeViewManagers has cyclomatic complexity 39 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 5 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a890797b3e13192c7191276b4f5f2292dc7f342b274d9b635e7ef02421f52ac0"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorManager.initialize (cyclomatic 38): VectorManager.initialize has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f876f5e3a810d6f275fb1807aecd54ee450da539905238852877a3a1070ed96"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.handleDocs (cyclomatic 38): docs.handleDocs has cyclomatic complexity 38 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 10 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":"src/mcp/handlers/docs.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0d11735ebfdd2cf7dc174cc4f30eacc1539265be47f691ab357584c65ac833"}},{"ruleId":"D1","level":"warning","message":{"text":"git.filterGitStatus (cyclomatic 36): git.filterGitStatus 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":"src/compression/filters/git.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3d955b57bb635a3f444a883af3b89da186923012c5517c9f3df129406af977"}},{"ruleId":"D1","level":"warning","message":{"text":"instructions.buildAgentInstructions (cyclomatic 36): instructions.buildAgentInstructions has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/instructions.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d085962bded7dca28095a4146cd10abf3a2116160aa280095ef04254b1b3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"infra.extractHcl (cyclomatic 35): infra.extractHcl has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a55a9adcf78dcbcd8b483d8d312274a21aff3c85ec184de4f7990cc6c2caf2d"}},{"ruleId":"D1","level":"warning","message":{"text":"hook.register (cyclomatic 35): hook.register has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 46, 117, 184, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/hook.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"274424179ae6323c10d582ecdaf3bacb20d7e73e91055703aebeafc680a07299"}},{"ruleId":"D1","level":"warning","message":{"text":"index.getTargetInstaller (cyclomatic 35): index.getTargetInstaller has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/index.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ef56a5f3512c242d4398f5040c72ac62eb41e2f5c6373722a10031d598ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"flutter-channel.findSwiftHandlers (cyclomatic 34): flutter-channel.findSwiftHandlers has cyclomatic complexity 34 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"56503d1c243108a160373242f6e30068cd4daf32151170e2f31c20c87a081734"}},{"ruleId":"D1","level":"warning","message":{"text":"json-schema.validateAgainstSchema (cyclomatic 34): json-schema.validateAgainstSchema has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/json-schema.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"962ca31df9146d61c8280405cb496a256aa4466d6c70940c75644611922db960"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.register (cyclomatic 34): doctor.register has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 36, 88, 146). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6680f9dbc644c4eecc605d5ca3a5242c157ecf3c4f7e261e9855ed4718bb985"}},{"ruleId":"D1","level":"warning","message":{"text":"licenses.register (cyclomatic 34): licenses.register has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 15, 137, 73). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/licenses.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adde81b789ed97af81160fe47fa40de8647f3c5befd7a150529ff056a467f49"}},{"ruleId":"D1","level":"warning","message":{"text":"security.register.secCmd (cyclomatic 34): security.register.secCmd has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84ba3d901555e681b3d83d6e239f783f19c500075cab785a7286ec011656bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"sync.register (cyclomatic 34): sync.register has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 18, 92). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/sync.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fcb5eb07db28137529b3d9106201a0dd5e5f7cff18948ad0e7689acf589db2"}},{"ruleId":"D1","level":"warning","message":{"text":"turbomodules.findNativeImpls (cyclomatic 33): turbomodules.findNativeImpls 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":"src/resolution/bridges/turbomodules.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae48909516d6262d9a73639048fc3b2b5b789e7d121e9961ddec2d26368da054"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.resolveUnresolvedRefs (cyclomatic 32): ReferenceResolver.resolveUnresolvedRefs has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dca6b897450259bc10c6fc876ba76582c8c5a3ff9c64e8873c95009c5270d5"}},{"ruleId":"D1","level":"warning","message":{"text":"react-native.findNativeMethodDecls (cyclomatic 31): react-native.findNativeMethodDecls has cyclomatic complexity 31 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/react-native.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d03386b62e87b00ee044c257c75ae493f49d83696f1106b509a11297722e87b"}},{"ruleId":"D1","level":"warning","message":{"text":"native-events.findEventEmitters (cyclomatic 31): native-events.findEventEmitters has cyclomatic complexity 31 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"979de0fc21c8e0bd63d345ee0e0ee53f1defa376a855df3d79be53965d2dd1ac"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt.multiSelect (cyclomatic 31): prompt.multiSelect has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 275, 228). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6b59fbd8fce0d6148fff7a6d37ed136299067316387075b24070f14bbfdf59"}},{"ruleId":"D1","level":"warning","message":{"text":"openapi.parseYAMLOperations (cyclomatic 30): openapi.parseYAMLOperations has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/formats/openapi.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d17c42afc26479768e0e5f3d365d772e3350810b7148574eadcd8bf064273d4"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.extractFile (cyclomatic 29): extractor.extractFile has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f295214afee5e3b7a62435419c308aa3feaa79321d335b70fbaade5a02dfad9f"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.extractName (cyclomatic 29): extractor.extractName has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4308b3a0497ed53ce46844425e27d04d74017aa7b946fe28348a0dba903c7c"}},{"ruleId":"D1","level":"warning","message":{"text":"communities.detectCommunities (cyclomatic 29): communities.detectCommunities has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"253359ed19ea1b598ed0356224b2aed4e25cec93ded373421d8359b35273059c"}},{"ruleId":"D1","level":"warning","message":{"text":"branch.handleBranch (cyclomatic 29): branch.handleBranch has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e206601651f842cbfd01c896026df2d14f7a9b97c7f6565843680ae1a895c193"}},{"ruleId":"D1","level":"warning","message":{"text":"infra.augmentBash (cyclomatic 28): infra.augmentBash has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 10 of the 28 points are its own statements and the rest belongs to 3 function items inside it that branch (visit, enclosing, a function literal at line 532). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"14390b697d324fa3f2b7292a3ef9c3847a7cc7fa1373e08897f594045347d274"}},{"ruleId":"D1","level":"warning","message":{"text":"npm.parseNpmManifest (cyclomatic 28): npm.parseNpmManifest 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":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df5de3b375e550d7a91a0031415a7cfe52c45f898760bafedb357774a1995c4"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraphIntegrator.resolveTransitives (cyclomatic 28): DependencyGraphIntegrator.resolveTransitives 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":"src/security/integrator.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dc2d4eae16279a2301e8ce8430e36161d3d65734e736ba0e4d2ecb7e0f832f"}},{"ruleId":"D1","level":"warning","message":{"text":"DataQueries.sampleHints (cyclomatic 28): DataQueries.sampleHints 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":"src/data/queries.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"461dd4449a9bf820d1c93199cbc8096d65c72408c790888ffadd711f82e07f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver.applyRoutePrefixes (cyclomatic 26): ReferenceResolver.applyRoutePrefixes has cyclomatic complexity 26 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 12 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":"src/resolution/index.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2f3d757cff4366afad3a9cd9571b47bc17c1c9d7b90378ef151c018b403459"}},{"ruleId":"D1","level":"warning","message":{"text":"archive.extractTarGzFromUrl (cyclomatic 26): archive.extractTarGzFromUrl has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 175, 160, 235, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/archive.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"503fbb9f24b66e42282aa17d7df280849ab5dd77355cfdbc6242d7edbb009018"}},{"ruleId":"D1","level":"warning","message":{"text":"progress.renderSyncProgressVerbose (cyclomatic 26): progress.renderSyncProgressVerbose 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":"src/bin/progress.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88be19e5c055cce7cf9df54d04c93c873de6d1361c3b5600abfd1344e5356ea"}},{"ruleId":"D1","level":"warning","message":{"text":"package.register (cyclomatic 26): package.register has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 11, 25). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/package.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"786d3b4c65c2813cdd111251791c886c3a1a283402c46c668a8219740da96d4a"}},{"ruleId":"D1","level":"warning","message":{"text":"maven.parseMavenManifest (cyclomatic 25): maven.parseMavenManifest 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":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3901f533afe5f3eeae1b63330b5d5190523a04acda897ef0dff0648d27280c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"supply-chain.computeRisk (cyclomatic 25): supply-chain.computeRisk has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/supply-chain.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d39b9b322bc82bd824e127a9d33e35eb29e056f07cc38412269268ae24e69b0"}},{"ruleId":"D1","level":"warning","message":{"text":"gain.register (cyclomatic 25): gain.register has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 17). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/gain.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f843faf885bf60288c69399279f43e227e1cf89fce8215a5443827496f303d95"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt.singleChoice (cyclomatic 25): prompt.singleChoice has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 165, 115). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ad4126def3252bce975ab6ae67d3d8034c4ff4dc3693116e120610336192d0"}},{"ruleId":"D1","level":"warning","message":{"text":"progress.renderIndexProgress (cyclomatic 25): progress.renderIndexProgress 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":"src/bin/progress.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd10422d8fea47792ca7c6458a9c23b914fbddcd43bc5d1540742a318bbbe8"}},{"ruleId":"D1","level":"warning","message":{"text":"SecurityPipeline.run (cyclomatic 24): SecurityPipeline.run 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":"src/security/pipeline.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ec018f3f18039d55729b29955b3b3096182280d17e47c51dc0169f642ac66"}},{"ruleId":"D1","level":"warning","message":{"text":"lint.lintWiki (cyclomatic 24): lint.lintWiki has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lint.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"108dffdc6fb1cbe8c5ca4972f6b23a932fda7d9d73b8b0fcdc47c703bdbe2742"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.extractVisibility (cyclomatic 23): extractor.extractVisibility 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":"src/extraction/extractor.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad7768b3cf9c5c66edcb591795860d75a4ddc0238002961af0ba13ac3611bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"journal-recovery.replayJournal (cyclomatic 23): journal-recovery.replayJournal 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":"src/db/journal-recovery.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa299a041c97c9f6ec20f5057ea92ca74720cec475a60495f43fa25cfc01ba1"}},{"ruleId":"D1","level":"warning","message":{"text":"flutter-channel.findKotlinJavaHandlers (cyclomatic 23): flutter-channel.findKotlinJavaHandlers has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6effd4f365a90ce72fd8c0cbbf426bc60a77073385b6a3f8ecf4eeff8337754"}},{"ruleId":"D1","level":"warning","message":{"text":"ColumnProfiler.addBatch (cyclomatic 23): ColumnProfiler.addBatch 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":"src/data/profiler.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfcca80061d27f245b8b2aa6565e8d6502850f61e4e14381f530a0da7a43105"}},{"ruleId":"D1","level":"warning","message":{"text":"git-context.parseDiff (cyclomatic 23): git-context.parseDiff 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":"src/graph/git-context.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdb5b9a29c13b71afa1f2d6603dd1cc5da617db3c263848ca6a99f67d4c2376"}},{"ruleId":"D1","level":"warning","message":{"text":"architecture.register (cyclomatic 23): architecture.register has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 12). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/architecture.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0645d58d6797cbdbf1b3be4d42c5d05e6b1ec08561896968a60f4347d637de"}},{"ruleId":"D1","level":"warning","message":{"text":"index.getChangedFiles (cyclomatic 22): index.getChangedFiles 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":"src/sync/index.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5914b03a0598160987a94e92c8f97f019343a952f462020319953f06b533206"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.walkTree (cyclomatic 22): extractor.walkTree 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":"src/extraction/extractor.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"82448ba92eafb85908b021b2659e711c6ca42d6b88d98c7b01d2a55cb6178335"}},{"ruleId":"D1","level":"warning","message":{"text":"native-events.findEventListeners (cyclomatic 22): native-events.findEventListeners has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 belong to 3 function literals 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":"src/resolution/bridges/native-events.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a84aad716d8e7836ca5a9e2f0359f5f3a32bb7268593cc0c11d34699dabd66"}},{"ruleId":"D1","level":"warning","message":{"text":"communities.refinementPhase (cyclomatic 22): communities.refinementPhase 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":"src/graph/communities.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b721a6082665c28696d3e64372049f201bd1d1d052bca3a6d7605f00adde61"}},{"ruleId":"D1","level":"warning","message":{"text":"progress.renderSyncProgress (cyclomatic 22): progress.renderSyncProgress 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":"src/bin/progress.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d545c0ff33132bf4e1bfa27effa0c32c7ba12dca04d4bece069658140c0b4292"}},{"ruleId":"D1","level":"warning","message":{"text":"config-prompt.promptConfigOptions (cyclomatic 22): config-prompt.promptConfigOptions 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":"src/bin/installer/config-prompt.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"503e44764ee54ed90f478c05899989aa418a84829c2f07dd2399905cd8367704"}},{"ruleId":"D1","level":"warning","message":{"text":"security-secrets.register (cyclomatic 22): security-secrets.register has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to one function literal inside it that branches (line 46). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-secrets.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e31a6af4d193763b15b3844defe7b9c613a4134a8cbd7c74f1a6e622ced9b1"}},{"ruleId":"D1","level":"warning","message":{"text":"flutter-channel.findDartChannelCalls (cyclomatic 21): flutter-channel.findDartChannelCalls has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b736d572484366b0ba7b2d217af22ed73181428403cf1a966143fe846abbf180"}},{"ruleId":"D1","level":"warning","message":{"text":"profiler.generateColumnSummary (cyclomatic 21): profiler.generateColumnSummary has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/profiler.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3d97ba0109f1ccbdfd4f3d9515518315768f80507e4714c4ef8b29653fb831"}},{"ruleId":"D1","level":"warning","message":{"text":"aws.filterCfnEvents (cyclomatic 21): aws.filterCfnEvents has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 194, 187, 210). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c62f7be587d75a26949d78a911c12d03baaa818d9b5370bb9bc7462370292c3"}},{"ruleId":"D1","level":"warning","message":{"text":"DataQueries.quality (cyclomatic 21): DataQueries.quality has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"199bdfb943dd048ad0c2cbaee9e43bb4e458755de5f9e4cf9e14b539b2ba998c"}},{"ruleId":"D1","level":"warning","message":{"text":"coupling.register (cyclomatic 21): coupling.register has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 29, 45, 53). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/coupling.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf616af0379e5aea9fe2a232ba6d1a38910ea613380a9c47f8bbc751c2e78b0"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPServer.handleMessage (cyclomatic 21): MCPServer.handleMessage has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/server.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e918b9df55d6485b10d0b6cb436ee1f4a6017fca371d14a4c062678e722ae546"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorManager.embedNode (cyclomatic 20): VectorManager.embedNode has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eb2fc7de45cc6944c1f00b75f6c304f7d39fbc887e518a177013827834739f"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextBuilder.findRelevantContext (cyclomatic 20): ContextBuilder.findRelevantContext has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f2b6614e6595bfa5736a9512e51f315fd907dd5da47331b267da51825c00e"}},{"ruleId":"D1","level":"warning","message":{"text":"files.filterLs (cyclomatic 20): files.filterLs has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8321de663039e510248622f0e3892411c0cb3c378d538622620d5c7cd0084770"}},{"ruleId":"D1","level":"warning","message":{"text":"watchmen.handleWatchmen (cyclomatic 20): watchmen.handleWatchmen has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/watchmen.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c57adaa1af76a660725b0c46415c6f306114e69a5572bb34737d8547ffc20eb"}},{"ruleId":"D1","level":"warning","message":{"text":"AttackSurfaceAnalyzer.analyze (cyclomatic 20): AttackSurfaceAnalyzer.analyze has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/attack-surface.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc642225b34833c1678577ad6fcd616937b9b72cb30f8af3165e1cce44b3cce6"}},{"ruleId":"D1","level":"warning","message":{"text":"export.generateExport (cyclomatic 20): export.generateExport has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a611e59dd420d1d32ef28b1ab3f573ac3b19e5ce719b690a91f08749dcbde867"}},{"ruleId":"D1","level":"warning","message":{"text":"export.register (cyclomatic 20): export.register has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 2944, 2862, 2909). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5289e3d65fe7fdd4ac01b7b95e82b074f631f0593710fc15c1733be31269d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog.html.setupScrollSpy (cyclomatic 19): changelog.html.setupScrollSpy has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 187, updateActive, a function literal at line 198, \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":"docs/changelog.html"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e54aaf8c62580d42176d6ebbbd82b32bddaf9e386cd0a39059a6aed97063f61"}},{"ruleId":"D1","level":"warning","message":{"text":"android-rn.findAndroidNativeModuleCalls (cyclomatic 19): android-rn.findAndroidNativeModuleCalls has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd29892bfad7c7c1bb4eb9188c993b46478608f03673a2cb957d6c309da6e271"}},{"ruleId":"D1","level":"warning","message":{"text":"index.buildResolutionContext.readFile (cyclomatic 19): index.buildResolutionContext.readFile has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7a64dc9930ed9e8bdc782d72fafd72f40f275366bc85a7f74459cfb57c9601"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.filterPlaywright (cyclomatic 19): misc.filterPlaywright has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8660388edeeeffbc2a52f1240ac487070afa15423d452b6c937716a8ee4ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"filters.buildWhereClause (cyclomatic 19): filters.buildWhereClause has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/filters.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d33cfb017c356ca1eaa2a3efdd3d000972abdba5896de3b651af06bd8c08c"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmark.runRepoBenchmark (cyclomatic 19): benchmark.runRepoBenchmark has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e049d3109908f6d2beb3f97d220157a2ec460567b26cfa43a0a95baf603bb67"}},{"ruleId":"D1","level":"warning","message":{"text":"export.buildFiles (cyclomatic 19): export.buildFiles has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 233, 281, 299, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf4577defe66471c5d0fb2483018a8feab0fe150a37558dab3f7ddf2eeed1e8"}},{"ruleId":"D1","level":"warning","message":{"text":"expo-modules.findExpoModuleCalls (cyclomatic 18): expo-modules.findExpoModuleCalls has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function literals 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":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d076137e0e85d436fe63cfd762d678fd4f842af49e5f3d8aa7da8560ec349c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"npm.extractTransitiveNpmDependencies (cyclomatic 18): npm.extractTransitiveNpmDependencies has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ea7e965204699f2df571c3a2b02b6195cf65d5db7a231d5c364d46518e5ece"}},{"ruleId":"D1","level":"warning","message":{"text":"yaml.parseSequence (cyclomatic 18): yaml.parseSequence has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/yaml.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42fc092a6aa1391d98894197c462416ceb65b3a5527d4b7f68dcb605428463d"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternRunner.applyFix (cyclomatic 18): PatternRunner.applyFix has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/runner.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e8628f3fe3eb1e751562178ddf57e01efb87ad0a2a0464afb9f5596918fd9e"}},{"ruleId":"D1","level":"warning","message":{"text":"attack-surface.printRouteEntry (cyclomatic 18): attack-surface.printRouteEntry has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/attack-surface.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0639b703a8ce7671d436395d40a7e19e5d1b7a3f01f309be8e2da8070ca79d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"cost.register (cyclomatic 18): cost.register has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 42). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/cost.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54312b80ab2a64419445b50f6d18338c0b9833d195c6eb9a3a2c1b5c168c47a"}},{"ruleId":"D1","level":"warning","message":{"text":"prompts.arrowSelect (cyclomatic 18): prompts.arrowSelect has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 147, render, descLineCount, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/prompts.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d051865bf688e1a1686ca07406f7dd44d34182c6ebfc755b3c15178508092c"}},{"ruleId":"D1","level":"warning","message":{"text":"reachability.register (cyclomatic 18): reachability.register has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 14). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/reachability.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d5fe5a0184e4acd63e1b447e7d41df78b3b41c4bfc6507a084e00f618112a3"}},{"ruleId":"D1","level":"warning","message":{"text":"remediation.register (cyclomatic 18): remediation.register has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 30, 61). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/remediation.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae3a550e3ee061ece8610f80ad079dbaf77524383926c7a774a56888891b301"}},{"ruleId":"D1","level":"warning","message":{"text":"infra.hclTraversals::visit (cyclomatic 17): infra.hclTraversals::visit has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa3f0f6786fd55ba62cab8e2959e30f6df7c3141db5e1de1090038a573d02cb"}},{"ruleId":"D1","level":"warning","message":{"text":"infra.scanJson::ws (cyclomatic 17): infra.scanJson::ws 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":"src/extraction/infra.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f7cb431465afd2faeaa3f463eb18188ae03181a54cfd8a614f0c27bf48c295"}},{"ruleId":"D1","level":"warning","message":{"text":"extractor.extractInheritance (cyclomatic 17): extractor.extractInheritance has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c0b921e1798de0fbd0d03bcfb08dc38e1187bb59edbb33e3ce0d1011cc86e5"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceResolver._resolveImportPath (cyclomatic 17): ReferenceResolver._resolveImportPath has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a647365208c8f215d94941fbf4c57f74695673ca3d5d821a97e382e5b08b00"}},{"ruleId":"D1","level":"warning","message":{"text":"iac.resolveHandlerString (cyclomatic 17): iac.resolveHandlerString has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"50051cd7ff40248cd26bbb5167c1ea5fcc325a5df8467f75e4d4f0a10d2048a9"}},{"ruleId":"D1","level":"warning","message":{"text":"state.workspaceFingerprint (cyclomatic 17): state.workspaceFingerprint has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/state.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d0934045ef900e3892586bc295a1d101dd541eafcbb64cfc3c3f1022b23034"}},{"ruleId":"D1","level":"warning","message":{"text":"rubygems.parseRubygemsManifest (cyclomatic 17): rubygems.parseRubygemsManifest has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/rubygems.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc160819828f449f0e149b0259c949f06ce32fdc6cd4885d99516f43e8930b13"}},{"ruleId":"D1","level":"warning","message":{"text":"linker.extractCandidateRefs (cyclomatic 17): linker.extractCandidateRefs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/linker.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05d5d9c44abe627b687ffc3c59b7fea47f8adb7b0aca571cb8c638fa8ad5982"}},{"ruleId":"D1","level":"warning","message":{"text":"yaml.parseBlock (cyclomatic 17): yaml.parseBlock has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/yaml.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"144c5b8ff5508025b07477481d1fcae7b4f5d3543e8c15af2d891e16594f5321"}},{"ruleId":"D1","level":"warning","message":{"text":"git.filterGitLog (cyclomatic 17): git.filterGitLog has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"304af97b2327bbf3e73241e813e956eab607bb5960ce2097af8afca298a626ff"}},{"ruleId":"D1","level":"warning","message":{"text":"lint.filterTsc (cyclomatic 17): lint.filterTsc has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c118feccc983399e93446f225ff5b08f7d41beab05a9523afa475e05870d94d"}},{"ruleId":"D1","level":"warning","message":{"text":"synthesize.getGenPipeline (cyclomatic 17): synthesize.getGenPipeline has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/synthesize.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1e0260418d510d6ecf5a02695c3b0e3bcd889e8720d5e5693962caa9b1531c"}},{"ruleId":"D1","level":"warning","message":{"text":"caveman.register (cyclomatic 17): caveman.register has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 46). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e251a354b9ec162faad5731669e28fe4199397180bd55ca6f82a4c352a96c4"}},{"ruleId":"D1","level":"warning","message":{"text":"staleness.register (cyclomatic 17): staleness.register has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 33). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/staleness.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2a667abf066d06e64b53b6a200f600fb767d1767c7a6c3679f6ed4410b0d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"libc-shims.zeroMallocInBinary (cyclomatic 16): libc-shims.zeroMallocInBinary has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/libc-shims.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a5df10f29ece911dcdadd60466ee15e17b194ff118698b1dbf38c600ff64fa"}},{"ruleId":"D1","level":"warning","message":{"text":"name-matcher.matchReference (cyclomatic 16): name-matcher.matchReference has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae7593df44ce14c716b5fa1ffb6891826d7dcca355f3cda7cb39cc8c8d9ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesenseIndex.initialize (cyclomatic 16): TypesenseIndex.initialize has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"335e628325313f224e94c071e347592f642cfc14a9427e1641f15c849e7752c1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.buildResolutionContext.fileExists (cyclomatic 16): index.buildResolutionContext.fileExists has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0182e7c9c7d0c437c8ab3c52c502402fb7133180e779df7be36634d730d2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"npm.findNpmDuplicateVersions (cyclomatic 16): npm.findNpmDuplicateVersions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"235ffbc4056f7404de37e735366dc2afcf923d055d6841bbf922a76bba345422"}},{"ruleId":"D1","level":"warning","message":{"text":"npm.normalizeLicenseField (cyclomatic 16): npm.normalizeLicenseField has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"174af8a0f498eca9167eee29f30e0c42a0c36c00129e3e6795be355e4d140dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"composer.parseComposerManifest (cyclomatic 16): composer.parseComposerManifest has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"358c4827c497a1d22eda47ec870af82c489769b57bd72c779cfc83bcbe7dded1"}},{"ruleId":"D1","level":"warning","message":{"text":"pubspec.extractSectionDependencies (cyclomatic 16): pubspec.extractSectionDependencies has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13dc3921e2335e880b95d8d3322a540966f28e2d161dc68b802bfc8aa17c13d"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraphIntegrator.integrate (cyclomatic 16): DependencyGraphIntegrator.integrate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad280bcab9ecf6db40c0e8fd211d31ecb4e9aceab202d91b3d0c59b3b20aead"}},{"ruleId":"D1","level":"warning","message":{"text":"OsvAdapter.queryBatch (cyclomatic 16): OsvAdapter.queryBatch has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/osv-adapter.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9ab6b1690131af7ef79b2405e070f478c6a98f85b678c8c3d04d16777cde0f"}},{"ruleId":"D1","level":"warning","message":{"text":"affected.register (cyclomatic 16): affected.register has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 16). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/affected.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e19c6c6a826c629e324a53186a0d166ee83ad95e75866aacd83aceae40bb1d"}},{"ruleId":"D1","level":"warning","message":{"text":"lint.filterEslint (cyclomatic 16): lint.filterEslint has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea09189582aba5768fdb949e83c8b35b27a8adfcadd9fe5cfc525a52f4d0843"}},{"ruleId":"D1","level":"warning","message":{"text":"aws.unwrapDynamoTypes (cyclomatic 16): aws.unwrapDynamoTypes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13108977fcaf534fde950277521594322e8adf620468e2ed6d6ec5c31f7f163"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.filterGrep (cyclomatic 16): misc.filterGrep has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfa9533f6e8ab6f8decfba88124a66b0ca3a456057710dd7771c4dda06db331"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.filterDiff (cyclomatic 16): misc.filterDiff has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdc775be01f772232a74996e14741788cc463e43825af7afddac7fff26f7cc3"}},{"ruleId":"D1","level":"warning","message":{"text":"attack-surface.register (cyclomatic 16): attack-surface.register has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 17). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/attack-surface.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6b016925e9519812150a5c92493f03c31a468bd6de57c9a5d1cefab4c18812"}},{"ruleId":"D1","level":"warning","message":{"text":"exec.register (cyclomatic 16): exec.register has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 27). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/exec.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b7c1e3dec55502b825080a47de5a120cfa3aeec2369efff1126df4e9620687"}},{"ruleId":"D1","level":"warning","message":{"text":"help.renderGroup (cyclomatic 16): help.renderGroup has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/help.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafe60e07a3e54c46f68680b600ab10a739c516eb87248a431bbeaddcfec66e3"}},{"ruleId":"D1","level":"warning","message":{"text":"windsurf.uninitWindsurf (cyclomatic 16): windsurf.uninitWindsurf has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/windsurf.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"de835e2137f531bfe61f32c70f0eb5a1ba5ce12329f853b06b5da93a09fba797"}},{"ruleId":"D1","level":"warning","message":{"text":"monitor.register (cyclomatic 16): monitor.register has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 9, 43). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a0d572bfd5d30a816303f78d38f94b79fbb5ce36646b7a18882f492659bcc0"}},{"ruleId":"D1","level":"warning","message":{"text":"status.showIntegrations (cyclomatic 16): status.showIntegrations has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/status.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"36af89c2298e94cb48cc05d54760e8469a13cef0502d95f210b0423929641f21"}},{"ruleId":"D2","level":"warning","message":{"text":"core.handleCore (cognitive 445): core.handleCore has cognitive complexity 445 (threshold 15). Drivers by points: if/else 80 (230 pts), ternaries 27 (119 pts), loops 16 (61 pts), error handling 11 (22 pts), boolean chains 12, match/switch 1 (nesting depth added 298). Of this number, 357 points are the body\u0027s own statements and 88 belong to 5 function items inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8718a548095d5e173b9059b9a31c4e3f98b32d96f05960ccd279253862ff9a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"security.handleSecurity (cognitive 439): security.handleSecurity has cognitive complexity 439 (threshold 15). Drivers by points: if/else 98 (222 pts), ternaries 50 (161 pts), loops 18 (44 pts), boolean chains 7, error handling 2 (4 pts), match/switch 1 (nesting depth added 263). Of this number, 425 points are the body\u0027s own statements and 14 belong to 3 function items inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7339bd2612000ddbe2434feb0d6f641bcac18be446f2a4126260fe7ff3a1c089"}},{"ruleId":"D2","level":"warning","message":{"text":"pattern.register (cognitive 257): pattern.register has cognitive complexity 257 (threshold 15). Drivers by points: if/else 58 (110 pts), ternaries 29 (82 pts), loops 19 (44 pts), error handling 4 (12 pts), boolean chains 9 (nesting depth added 138). None of this is in the body itself: all 257 points belong to one function literal inside it that branches (line 58). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"636e33b819e37fe9e2921405c60eee24b21379948d1a00f7126efba73116373e"}},{"ruleId":"D2","level":"warning","message":{"text":"security-export.generateHtml (cognitive 253): security-export.generateHtml has cognitive complexity 253 (threshold 15). Drivers by points: ternaries 88 (233 pts), boolean chains 16, loops 2 (3 pts), if/else 1 (nesting depth added 146). Of this number, 104 points are the body\u0027s own statements and 149 belong to 9 function literals 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":"src/bin/commands/security-export.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"146e75be297e39059b03803ff595184a919b6fcf0ad2273fd969f14691d3bfe3"}},{"ruleId":"D2","level":"warning","message":{"text":"architecture.handleArchitecture (cognitive 228): architecture.handleArchitecture has cognitive complexity 228 (threshold 15). Drivers by points: if/else 38 (95 pts), ternaries 18 (58 pts), loops 19 (57 pts), boolean chains 14, error handling 1 (3 pts), match/switch 1 (nesting depth added 137). Of this number, 219 points are the body\u0027s own statements and 9 belong to 5 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e26c21fd648516c4b4835f8a968d9a110743acc4eb1adc8fb60b2032a0e099"}},{"ruleId":"D2","level":"warning","message":{"text":"data.register (cognitive 216): data.register has cognitive complexity 216 (threshold 15). Drivers by points: if/else 99 (130 pts), ternaries 15 (43 pts), loops 14 (37 pts), error handling 4 (5 pts), boolean chains 1 (nesting depth added 83). None of this is in the body itself: all 216 points belong to 19 function literals inside it that branch (lines 612, 61, 734, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/data.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76a9931b6a9f5d7969d9c0e6a5883725e9d2f2d8ccbb4c86ddfaf05f482e0bc"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.register (cognitive 213): memory.register has cognitive complexity 213 (threshold 15). Drivers by points: if/else 112 (140 pts), loops 17 (38 pts), ternaries 11 (21 pts), boolean chains 7, error handling 4 (7 pts) (nesting depth added 62). None of this is in the body itself: all 213 points belong to 24 function literals inside it that branch (lines 910, 201, 33, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/memory.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"26209222369a5be25a3919a7e030650306cba20c0b8e30900c27c28f4e6f767a"}},{"ruleId":"D2","level":"warning","message":{"text":"code-health.handleCodeHealth (cognitive 207): code-health.handleCodeHealth has cognitive complexity 207 (threshold 15). Drivers by points: if/else 56 (120 pts), loops 22 (52 pts), ternaries 12 (28 pts), error handling 1 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 113). Of this number, 201 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08f15dae150c192bade6515e69ea19cc7a1d19dd527cd75a6ae7d292109478a"}},{"ruleId":"D2","level":"warning","message":{"text":"config.validateConfig (cognitive 196): config.validateConfig has cognitive complexity 196 (threshold 15). Drivers by points: ternaries 89 (92 pts), boolean chains 61, if/else 33 (42 pts), loops 1 (nesting depth added 12). Of this number, 194 points are the body\u0027s own statements and 2 belong to one function literal 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":"src/config.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6e87e5582c92e3120c1589fa7b43adcfe10459140eed0c47daf474f3c81e66"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runInstaller (cognitive 169): index.runInstaller has cognitive complexity 169 (threshold 15). Drivers by points: if/else 70 (140 pts), boolean chains 17, ternaries 4 (8 pts), error handling 2 (4 pts) (nesting depth added 76). Of this number, 156 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/index.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dd7f3a5ab6d73c4a4004de95af0a032c27cbaca089fa95d6cbcf7909c39980"}},{"ruleId":"D2","level":"warning","message":{"text":"git-context.handleGitContext (cognitive 163): git-context.handleGitContext has cognitive complexity 163 (threshold 15). Drivers by points: if/else 28 (72 pts), ternaries 13 (41 pts), loops 12 (31 pts), error handling 6 (13 pts), boolean chains 5, match/switch 1 (nesting depth added 98). Of this number, 161 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc226ff7ca33d4578ee8e2e016d083c03e2514b65eef460d87d2b2cc63081461"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.getLanguageSpecificKind (cognitive 162): extractor.getLanguageSpecificKind has cognitive complexity 162 (threshold 15). Drivers by points: if/else 80 (160 pts), boolean chains 1, match/switch 1 (nesting depth added 80). 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":"src/extraction/extractor.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"1345f3d093b0e0e4937283e74fe1406acf8e4412aca60bca9197cd48617834af"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.extractYaml (cognitive 152): infra.extractYaml has cognitive complexity 152 (threshold 15). Drivers by points: if/else 23 (80 pts), loops 10 (33 pts), ternaries 8 (31 pts), boolean chains 8 (nesting depth added 103). Of this number, 137 points are the body\u0027s own statements and 15 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea47480ce1707bdd2a1345a8ad3645c56ad0366368be5751e61200333c39d46"}},{"ruleId":"D2","level":"warning","message":{"text":"vulns.register (cognitive 148): vulns.register has cognitive complexity 148 (threshold 15). Drivers by points: if/else 53 (72 pts), ternaries 21 (47 pts), loops 6 (15 pts), boolean chains 14 (nesting depth added 54). None of this is in the body itself: all 148 points belong to 4 function literals inside it that branch (lines 46, 315, 270, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/vulns.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eeaeb9d921944f32ee667995a69c93cce76320b2fbd1c4c9bb595125d4ca84"}},{"ruleId":"D2","level":"warning","message":{"text":"data.handleData (cognitive 134): data.handleData has cognitive complexity 134 (threshold 15). Drivers by points: if/else 39 (79 pts), ternaries 13 (37 pts), loops 5 (13 pts), boolean chains 2, error handling 1 (2 pts), match/switch 1 (nesting depth added 73). Of this number, 130 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a8bc1ae77e21107b48226344f7095b22b7c7b0481734a3ecfbf893914c54ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.dispatch (cognitive 132): ToolHandler.dispatch has cognitive complexity 132 (threshold 15). Drivers by points: if/else 45 (73 pts), ternaries 13 (34 pts), boolean chains 12, error handling 3 (7 pts), loops 2 (6 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0938f903988b3e64d67b23d4f5bae3437d59e98307a8389462b6717cd0a19ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"complexity.handleComplexity (cognitive 131): complexity.handleComplexity has cognitive complexity 131 (threshold 15). Drivers by points: ternaries 20 (54 pts), if/else 26 (50 pts), loops 9 (20 pts), boolean chains 6, match/switch 1 (nesting depth added 69). Of this number, 129 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/complexity.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da31185cba308e3ea29bf1f33c1aa0f56fbe8a28760510ab6950db75c854237"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexPipeline.indexAllNow (cognitive 115): IndexPipeline.indexAllNow has cognitive complexity 115 (threshold 15). Drivers by points: if/else 30 (58 pts), error handling 11 (24 pts), loops 9 (17 pts), boolean chains 8, ternaries 3 (8 pts) (nesting depth added 54). Of this number, 92 points are the body\u0027s own statements and 23 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e74b367aa45eba5854beac0eb9566d1e556284846c5ed681cf72fd6a03601"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.handleMemory (cognitive 115): memory.handleMemory has cognitive complexity 115 (threshold 15). Drivers by points: if/else 33 (67 pts), ternaries 10 (27 pts), loops 3 (8 pts), boolean chains 5, error handling 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 60). Of this number, 99 points are the body\u0027s own statements and 16 belong to 5 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"67328ad8b4c3a34aa8ffe26bb555e0c6ef9bf022d7fbfc5977926d740c0a6f60"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexPipeline.syncNow (cognitive 113): IndexPipeline.syncNow has cognitive complexity 113 (threshold 15). Drivers by points: if/else 34 (61 pts), error handling 8 (18 pts), loops 7 (18 pts), boolean chains 10, ternaries 3 (6 pts) (nesting depth added 51). Of this number, 105 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":"src/core/pipeline.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34a8091bb45bf3e51b2f1f56ed9a11a055a027708027899bcc23fcbe1342b3a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureAnalyzer.analyze (cognitive 110): ArchitectureAnalyzer.analyze has cognitive complexity 110 (threshold 15). Drivers by points: if/else 20 (50 pts), loops 28 (46 pts), ternaries 4 (8 pts), boolean chains 6 (nesting depth added 52). Of this number, 109 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/index.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3212788c3069a1fa6380e8337e3f9d7663f949c2dcdd8734986c677a01936189"}},{"ruleId":"D2","level":"warning","message":{"text":"patterns.handlePatterns (cognitive 110): patterns.handlePatterns has cognitive complexity 110 (threshold 15). Drivers by points: if/else 26 (55 pts), loops 13 (32 pts), ternaries 4 (11 pts), error handling 4 (9 pts), boolean chains 2, match/switch 1 (nesting depth added 60). 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":"src/mcp/handlers/patterns.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"345c02bd8b886784976e274a65cea403faed6fe57ed1e2ca5dc198d6ea96450f"}},{"ruleId":"D2","level":"warning","message":{"text":"edit-primitives.handleEditPrimitives (cognitive 108): edit-primitives.handleEditPrimitives has cognitive complexity 108 (threshold 15). Drivers by points: if/else 25 (64 pts), loops 6 (20 pts), ternaries 5 (17 pts), error handling 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 67). 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":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c772afc21442271b1893a3fc488fe975e9d3a0773ab713b9a75047b33148a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.resolveUnresolvedRefs (cognitive 105): ReferenceResolver.resolveUnresolvedRefs has cognitive complexity 105 (threshold 15). Drivers by points: if/else 18 (58 pts), ternaries 6 (29 pts), loops 5 (10 pts), error handling 2 (5 pts), boolean chains 3 (nesting depth added 71). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e062dd07c64cd7b8d1942cbf01e239d284084aa29f654f56c9c2f9ece6815df5"}},{"ruleId":"D2","level":"warning","message":{"text":"status.register (cognitive 104): status.register has cognitive complexity 104 (threshold 15). Drivers by points: ternaries 15 (61 pts), if/else 24 (38 pts), boolean chains 3, error handling 2 (nesting depth added 60). None of this is in the body itself: all 104 points belong to one function literal inside it that branches (line 12). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/status.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd62bdaeba60748de101c1bfaa2ebcb75c507114c03d0b6ce60738e2d80270d"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorManager.embedAll (cognitive 100): VectorManager.embedAll has cognitive complexity 100 (threshold 15). Drivers by points: if/else 25 (50 pts), ternaries 8 (36 pts), boolean chains 9, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 55). Of this number, 99 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcfb432da876d56c1bb9dda88ec298f866eadc4022f3e3d3ef1c625a722cb0f"}},{"ruleId":"D2","level":"warning","message":{"text":"wiki.handleWiki (cognitive 97): wiki.handleWiki has cognitive complexity 97 (threshold 15). Drivers by points: if/else 29 (59 pts), ternaries 7 (25 pts), loops 4 (9 pts), error handling 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 54). Of this number, 96 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bbcc8d247488ea172580469cf370320872be0d6d59717fcd43b8d4fb3dffe6"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.extractImportSource (cognitive 89): extractor.extractImportSource has cognitive complexity 89 (threshold 15). Drivers by points: if/else 23 (53 pts), loops 10 (26 pts), boolean chains 10 (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"214b6da232cf6381134be111886c922e6224914d25cdc89d859ed320eddfa791"}},{"ruleId":"D2","level":"warning","message":{"text":"wiki.register (cognitive 87): wiki.register has cognitive complexity 87 (threshold 15). Drivers by points: if/else 38 (46 pts), ternaries 8 (20 pts), loops 9 (16 pts), boolean chains 3, error handling 2 (nesting depth added 27). None of this is in the body itself: all 87 points belong to 12 function literals inside it that branch (lines 387, 254, 285, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/wiki.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a1895833f0144f9c4a8ff97f4c03e23299bfa30c21b4556c50043a109dafb9"}},{"ruleId":"D2","level":"warning","message":{"text":"native-views.findNativeViewManagers (cognitive 81): native-views.findNativeViewManagers has cognitive complexity 81 (threshold 15). Drivers by points: if/else 16 (58 pts), boolean chains 13, loops 4 (10 pts) (nesting depth added 48). Of this number, 76 points are the body\u0027s own statements and 5 belong to 5 function literals 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":"src/resolution/bridges/native-views.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"926f120762d914877d4bae1abd63fbffe6667b444a0d3365f61358ca26cef551"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.register (cognitive 80): docs.register has cognitive complexity 80 (threshold 15). Drivers by points: if/else 43 (49 pts), loops 9 (17 pts), ternaries 4 (11 pts), boolean chains 3 (nesting depth added 21). None of this is in the body itself: all 80 points belong to 9 function literals inside it that branch (lines 116, 296, 32, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/docs.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5e0c3947a5d9bb3eac3b636a90f7ed223f7ea3bdd79a6eb9de1028211f0809"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.handleDocs (cognitive 76): docs.handleDocs has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (38 pts), ternaries 7 (20 pts), loops 5 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 42). Of this number, 55 points are the body\u0027s own statements and 21 belong to 4 function items inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd664ac0e156c4feee6b5d41f5938d6d59a05db0dd946966414c3f8125ddd522"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest.register (cognitive 76): manifest.register has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (37 pts), loops 8 (17 pts), ternaries 7 (16 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 36). None of this is in the body itself: all 76 points belong to 3 function literals inside it that branch (lines 13, 59, 97). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/manifest.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4163f4c8b8d2f3695e954835024d198b80be18d2c813705e94706ef047630c5"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.extractHcl (cognitive 75): infra.extractHcl has cognitive complexity 75 (threshold 15). Drivers by points: if/else 14 (43 pts), ternaries 5 (15 pts), loops 5 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 48). Of this number, 74 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2fa7355d7f093fefeb340e42bdb9f4336e5eddd64751227196d8981305d0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphIntegrator.resolveTransitives (cognitive 75): DependencyGraphIntegrator.resolveTransitives has cognitive complexity 75 (threshold 15). Drivers by points: if/else 11 (39 pts), loops 10 (26 pts), ternaries 1 (6 pts), boolean chains 4 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee47565bd716ce4eb3f250c6683ac7ceaeef1a03a4308bf689f83e3515b628"}},{"ruleId":"D2","level":"warning","message":{"text":"steering.writeWorkflowSteering (cognitive 73): steering.writeWorkflowSteering has cognitive complexity 73 (threshold 15). Drivers by points: if/else 40 (60 pts), ternaries 6 (12 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/steering.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6c5ed1f2d431bd7695ed75ca3acfae6cc16549aad44a8a18e3cd4fc19b0bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.register (cognitive 71): doctor.register has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (33 pts), error handling 7 (19 pts), ternaries 3 (8 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 30). None of this is in the body itself: all 71 points belong to 3 function literals inside it that branch (lines 36, 88, 146). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee76d29b8a23c67b8b1f521598f5ada1874e379baf81eec0e24610b13099782"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.parseYAMLOperations (cognitive 69): openapi.parseYAMLOperations has cognitive complexity 69 (threshold 15). Drivers by points: if/else 14 (41 pts), ternaries 4 (16 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/formats/openapi.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b21f26cc553617bf2ce0d5b06527d15ef3d715fb943b02ec5ed70f32f93d142"}},{"ruleId":"D2","level":"warning","message":{"text":"turbomodules.findNativeImpls (cognitive 68): turbomodules.findNativeImpls has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (46 pts), loops 5 (15 pts), boolean chains 7 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/turbomodules.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faba34074fe81b0702ad7718fbced507e541ea58ad313a804fa57689746eff1"}},{"ruleId":"D2","level":"warning","message":{"text":"communities.refinementPhase (cognitive 63): communities.refinementPhase has cognitive complexity 63 (threshold 15). Drivers by points: if/else 11 (42 pts), loops 9 (20 pts), boolean chains 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b6b0033636d4e83884f3ef19775c1a5dbd73591a62a1346d289261522c45af"}},{"ruleId":"D2","level":"warning","message":{"text":"branch.handleBranch (cognitive 62): branch.handleBranch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 7 (17 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 35). 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":"src/mcp/handlers/branch.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a363b2ddc6b1ca74f157096d2ef23c9575b433f078646c467c5ce909c9f42a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"communities.detectCommunities (cognitive 60): communities.detectCommunities has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 14 (27 pts), boolean chains 2 (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":"src/graph/communities.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c168743773c5ac83dd4beda514e05840adf7ec5b02392ee3f60d5b42ffb15d70"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.extractInheritance (cognitive 59): extractor.extractInheritance has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (40 pts), loops 3 (9 pts), ternaries 1 (8 pts), boolean chains 2 (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"533ca1e17076753ae08ad22adc073ee113130a0c2152f289f7da648bd548becc"}},{"ruleId":"D2","level":"warning","message":{"text":"native-events.findEventEmitters (cognitive 59): native-events.findEventEmitters has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 5 (13 pts), boolean chains 10, ternaries 1 (5 pts) (nesting depth added 33). Of this number, 51 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf30d41bf612cd74e2b8671d467cbccf2f32b14c456abdb58d4e292d0f0e42d0"}},{"ruleId":"D2","level":"warning","message":{"text":"architecture.register (cognitive 58): architecture.register has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 5 (21 pts), if/else 11 (18 pts), loops 5 (16 pts), boolean chains 3 (nesting depth added 34). None of this is in the body itself: all 58 points belong to one function literal inside it that branches (line 12). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/architecture.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b060cec556d8b624394259297d93db36aa39622cb9ba6eadc9d1bb93f7ca1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"steering.buildSteeringContent (cognitive 58): steering.buildSteeringContent has cognitive complexity 58 (threshold 15). Drivers by points: if/else 28, ternaries 26, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/steering.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"baccd87ed1dcd32d66bbb4f96797a92c334e728df95838660a94a5017ac42065"}},{"ruleId":"D2","level":"warning","message":{"text":"react-native.findNativeMethodDecls (cognitive 57): react-native.findNativeMethodDecls has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (34 pts), boolean chains 13, loops 4 (10 pts) (nesting depth added 29). Of this number, 50 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/react-native.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"281e788a843eca0ed60ce2997aaf070d86b9bd6fc05760c1fd937cb69989cac7"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorManager.initialize (cognitive 57): VectorManager.initialize has cognitive complexity 57 (threshold 15). Drivers by points: if/else 31 (48 pts), boolean chains 6, error handling 2, ternaries 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":"src/vectors/index.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaeb6fb3cac8b0e8cebb135797c600c863fbc43919e9b3a36e38bfbd7910d58"}},{"ruleId":"D2","level":"warning","message":{"text":"git.filterGitStatus (cognitive 56): git.filterGitStatus has cognitive complexity 56 (threshold 15). Drivers by points: if/else 30 (51 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":"src/compression/filters/git.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6ad316dbf5a287e17b3040c8232ea2dd8b349dc290c5da33ff33e4b9be4a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"security.register.secCmd (cognitive 56): security.register.secCmd has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (35 pts), ternaries 6 (17 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"085c2e4c46ee6db4df9261fa907f52f5df52d91d40571413e22e28bb20dcaa55"}},{"ruleId":"D2","level":"warning","message":{"text":"sync.register (cognitive 56): sync.register has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (45 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 23). None of this is in the body itself: all 56 points belong to 2 function literals inside it that branch (lines 18, 92). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/sync.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e3bfbd049bdb0f58c187359d3a73e6be5fdaafdd6d27799e130bd9a75b2a48"}},{"ruleId":"D2","level":"warning","message":{"text":"json-schema.validateAgainstSchema (cognitive 55): json-schema.validateAgainstSchema has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 12, ternaries 3 (9 pts), loops 2 (4 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":"src/shared/json-schema.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d19e48244119eb98797ad18e49c57ec86e614525cfec9d6941411f4fc00ebc1"}},{"ruleId":"D2","level":"warning","message":{"text":"licenses.register (cognitive 55): licenses.register has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (34 pts), ternaries 7 (16 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 20). None of this is in the body itself: all 55 points belong to 3 function literals inside it that branch (lines 15, 137, 73). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/licenses.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"55967127330bdfa3d802ce5930dfeb36238654bda9ce5afdc72ad7040164ca6f"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.extractName (cognitive 54): extractor.extractName has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 7 (17 pts), boolean chains 4 (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":"src/extraction/extractor.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe54fa607930202dcc39143da873815363b34305f212ff76acfcfe4633c31846"}},{"ruleId":"D2","level":"warning","message":{"text":"hook.register (cognitive 54): hook.register has cognitive complexity 54 (threshold 15). Drivers by points: if/else 24 (37 pts), error handling 7, loops 4, boolean chains 3, ternaries 3 (nesting depth added 13). None of this is in the body itself: all 54 points belong to 4 function literals inside it that branch (lines 46, 117, 184, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/hook.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d084fdb2cb55d6ee4da6626519c748d6ac01c60a865701e44f328646b6f551d"}},{"ruleId":"D2","level":"warning","message":{"text":"flutter-channel.findSwiftHandlers (cognitive 49): flutter-channel.findSwiftHandlers has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 11, loops 6 (11 pts), ternaries 1 (3 pts) (nesting depth added 22). Of this number, 41 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"994cadbd4ec285e48643790167aca5b16001f3e22fe076d9164d91c566d5f19a"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.parseNpmManifest (cognitive 49): npm.parseNpmManifest has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 3 (9 pts), loops 4 (7 pts), boolean chains 6, error handling 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca1cd7b22e282f33a4cf3756905fc5be00d78840ab804abb2bbbd8a204f4ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"DataQueries.sampleHints (cognitive 49): DataQueries.sampleHints has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cea4c422064c8c35323766ed12d937b56aa00b5cdb2aecdd419d7b11a9a077"}},{"ruleId":"D2","level":"warning","message":{"text":"config-prompt.promptConfigOptions (cognitive 48): config-prompt.promptConfigOptions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (37 pts), loops 2 (9 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/config-prompt.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fffccdeb3c4baeecba6470819cd0b99e0f96c350da14f35a5a2058998e4d15"}},{"ruleId":"D2","level":"warning","message":{"text":"git-context.parseDiff (cognitive 47): git-context.parseDiff has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (39 pts), boolean chains 7, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/git-context.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fc3605e1a0ea08d4ba82f1e694c66b7c300d3d98f693d00421c73b91a1613f"}},{"ruleId":"D2","level":"warning","message":{"text":"lint.lintWiki (cognitive 47): lint.lintWiki has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 4 (9 pts), boolean chains 7 (nesting depth added 25). Of this number, 44 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lint.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b60067da2715823461b844142b017c163cfa9014f144508e7181223668eaa3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.getChangedFiles (cognitive 46): index.getChangedFiles has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 4 (6 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d0fc23018ae5835d5f17550bf489d1c3556a4ca01f79309c5b9bbf9481df5"}},{"ruleId":"D2","level":"warning","message":{"text":"progress.renderIndexProgress (cognitive 46): progress.renderIndexProgress has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 5 (13 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/progress.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f39d8ea3aba02334dc9f212371ab7e9d97f63e209f77a6f4f82169fd0fa4ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"swift-objc.swiftToObjcSelector (cognitive 45): swift-objc.swiftToObjcSelector has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 2 (9 pts), boolean chains 2 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/swift-objc.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8254c6df0799f64d817fa0fb6d835aa92859fc4e2be5b280bdf01b41769a05"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt.multiSelect (cognitive 45): prompt.multiSelect has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 7 (16 pts), boolean chains 8, loops 1 (nesting depth added 14). None of this is in the body itself: all 45 points belong to 2 function literals inside it that branch (lines 275, 228). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a54a4e32a6fa376a145107c8fd03089e985c2c9a6d3bfd9751ee8d38b468189"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.extractVisibility (cognitive 44): extractor.extractVisibility has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (5 pts), ternaries 1 (4 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":"src/extraction/extractor.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3657eee129fb50d5fc7ca060790911da7122cb6323e0d8c2e2834e2a8b29df"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnProfiler.addBatch (cognitive 43): ColumnProfiler.addBatch has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (31 pts), boolean chains 8, loops 3 (4 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":"src/data/profiler.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6d0668817d2aec6288a5c5eca1dc98771eb99f20a77af97234c790731eb11b"}},{"ruleId":"D2","level":"warning","message":{"text":"gain.register (cognitive 42): gain.register has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 4 (9 pts), ternaries 3 (9 pts), boolean chains 2 (nesting depth added 19). None of this is in the body itself: all 42 points belong to one function literal inside it that branches (line 17). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/gain.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a81b37fdfe126bd485e09c7ddf2843ac727ee9a624c6df91e740adb41621fd"}},{"ruleId":"D2","level":"warning","message":{"text":"progress.renderSyncProgressVerbose (cognitive 41): progress.renderSyncProgressVerbose has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (30 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/progress.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"518e3b8c29a3ddfc00ff7cfa30164711ba755b4d09e5f056ad998cdd9c6148fd"}},{"ruleId":"D2","level":"warning","message":{"text":"progress.renderSyncProgress (cognitive 40): progress.renderSyncProgress has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 3 (7 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":"src/bin/progress.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d1b9133971b16cb9f25fe56fe23c8831c9e101377df026f7573b775a678efa"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.extractTarGzFromUrl (cognitive 39): archive.extractTarGzFromUrl has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 10, error handling 2 (6 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 13). None of this is in the body itself: all 39 points belong to 4 function literals inside it that branch (lines 175, 160, 235, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/archive.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6ed622c9a2fd6377132416665564d451bf87a744b05cb7a4ef72d59b9d0345"}},{"ruleId":"D2","level":"warning","message":{"text":"maven.parseMavenManifest (cognitive 39): maven.parseMavenManifest has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 3 (5 pts), ternaries 2 (5 pts), error handling 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae71fc5c5fcf7f29d91f87f349a95d18f45bf43e03be6b18a92d737c9bfd8973"}},{"ruleId":"D2","level":"warning","message":{"text":"files.filterLs (cognitive 39): files.filterLs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (25 pts), ternaries 4 (11 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b0a6c9f6f13687f56a6f45c935ba0bf3dffa310cbb33fd32787fffbb23aa8d"}},{"ruleId":"D2","level":"warning","message":{"text":"export.register (cognitive 39): export.register has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 8 (12 pts), boolean chains 1 (nesting depth added 20). None of this is in the body itself: all 39 points belong to 3 function literals inside it that branch (lines 2944, 2862, 2909). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"377db4b931e5cd0c2ed75bfcfcd5c5eb08322510c60d9b34a0058baedda04ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"flutter-channel.findDartChannelCalls (cognitive 38): flutter-channel.findDartChannelCalls has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 19). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f3d3a93619daf4d66cf27c4dc5610723887f5a5c3b84c6cf07d2997962df51"}},{"ruleId":"D2","level":"warning","message":{"text":"flows.register (cognitive 38): flows.register has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (13 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 23). None of this is in the body itself: all 38 points belong to one function literal inside it that branches (line 13). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/flows.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd2af17a4b74afec24b0e452aeb0ccdb92bd0a6574b42fa88a36681fc42bed9"}},{"ruleId":"D2","level":"warning","message":{"text":"export.generateExport (cognitive 37): export.generateExport has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 9 (24 pts), if/else 3 (5 pts), loops 4, error handling 2 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce00496503c28c97dc364355ed9abaaa8019ca4c467bdb4a8e3eec54a9d9e68"}},{"ruleId":"D2","level":"warning","message":{"text":"package.register (cognitive 37): package.register has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 4 (9 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 13). None of this is in the body itself: all 37 points belong to 2 function literals inside it that branch (lines 11, 25). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/package.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d9cdcb1dc36b7fb9fc45171fceb9581a8002ecfd790079341a8980eda45c88"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.extractFile (cognitive 36): extractor.extractFile has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 6, ternaries 1 (3 pts), error handling 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"914dee1e86cb4bdb684437c648cdfcd0d35e685da509a3666753ed90eb7c154c"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextBuilder.findRelevantContext (cognitive 36): ContextBuilder.findRelevantContext has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 7 (11 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed10f2f118230a4fb021bff7877af319206af307d9992dff9220ac0f6fbf574"}},{"ruleId":"D2","level":"warning","message":{"text":"affected.register (cognitive 36): affected.register has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (13 pts), boolean chains 1, error handling 1 (nesting depth added 19). None of this is in the body itself: all 36 points belong to one function literal inside it that branches (line 16). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/affected.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec54649be4962df67277a191bba5301a6845c6a2140fd42abec008429ac020d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.applyRoutePrefixes (cognitive 35): ReferenceResolver.applyRoutePrefixes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, loops 4 (5 pts), ternaries 2 (3 pts) (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 13 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"249e6ac7fc06682e45a6c76eade3efe139add51bf6eeadd64b7fc0a7041dc078"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityManifestAdapter.extractAll (cognitive 35): SecurityManifestAdapter.extractAll has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 4 (14 pts), error handling 3 (9 pts), if/else 5 (9 pts), boolean chains 2, 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":"src/security/manifest/adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"809c09b262622d2240bfd3db4067bc9fe1236ec52594dedb3722a43dce29d42d"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsScanner.scan (cognitive 35): SecretsScanner.scan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (11 pts), loops 4 (10 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 21). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/secrets.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9297f2bdb3337dc76427dc9c99964cb9adf15e9e1e1fb8f7d82cc7bd3c419156"}},{"ruleId":"D2","level":"warning","message":{"text":"android-rn.findAndroidNativeModuleCalls (cognitive 34): android-rn.findAndroidNativeModuleCalls has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 19). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e7600094d9cf13e578218f0f3e539164e801b4572ab428233b55fa5cc38852"}},{"ruleId":"D2","level":"warning","message":{"text":"OsvAdapter.extractAffectedRanges (cognitive 34): OsvAdapter.extractAffectedRanges has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/osv-adapter.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8f26bac96d77850678d789b277c2faee3d871d82df5f9ae815f58a5fcb2754"}},{"ruleId":"D2","level":"warning","message":{"text":"yaml.parseSequence (cognitive 34): yaml.parseSequence has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 2 (4 pts), ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/yaml.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"312c40bd17386c4be5111da2ca20d13ed85f7fa33cb2622dceec9018c33466b7"}},{"ruleId":"D2","level":"warning","message":{"text":"instructions.buildAgentInstructions (cognitive 34): instructions.buildAgentInstructions has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 21, if/else 10, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/instructions.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb9d3a03d79c3f52beacd17e3801ad950e5ba93e499e7838a2950375f4dabf"}},{"ruleId":"D2","level":"warning","message":{"text":"index.getTargetInstaller (cognitive 34): index.getTargetInstaller has cognitive complexity 34 (threshold 15). Drivers by points: if/else 34. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/index.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace2eab375c2eb4d92b968e1bc593507d1c9c2e718da26ea887e8da3927848ec"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark.runRepoBenchmark (cognitive 33): benchmark.runRepoBenchmark has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 3 (7 pts), loops 3 (5 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f4cd33eaf4e7f41a7a00573ba63af0cfa6bd05836b48a945092cb44320982"}},{"ruleId":"D2","level":"warning","message":{"text":"coupling.register (cognitive 33): coupling.register has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 7 (10 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 15). None of this is in the body itself: all 33 points belong to 3 function literals inside it that branch (lines 29, 45, 53). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/coupling.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee96183f56344d706762a3acbaeff6e2615a53ec376fb69f77eb8135f4c0e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"journal-recovery.replayJournal (cognitive 32): journal-recovery.replayJournal has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/journal-recovery.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"30598733b0724a500317bda14ad2f11464762cc72f3746f71b637f59dc11fb2d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphTraverser.traverseBFS (cognitive 32): GraphTraverser.traverseBFS has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/traversal.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd62a74293f15e4c1e4bfbddc36039c7b8325e343d73366ae16be0bd07c0cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"yaml.parseBlock (cognitive 32): yaml.parseBlock has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/yaml.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efee6af21203a9a92d9b8a98aa32216cde0c6c66b388a869d6ab16c0d4fd68f"}},{"ruleId":"D2","level":"warning","message":{"text":"flutter-channel.findKotlinJavaHandlers (cognitive 31): flutter-channel.findKotlinJavaHandlers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 6, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 14). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fac7e80936af595dc624b43dc66302aa9167ceae7dbfa1be1c7e631b6f96b42"}},{"ruleId":"D2","level":"warning","message":{"text":"pubspec.extractSectionDependencies (cognitive 31): pubspec.extractSectionDependencies has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), boolean chains 3, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec017cfe36494395eefa7a27c3f4ef1e0f0608c9e8a6a31f013c3ed6a27dbdc"}},{"ruleId":"D2","level":"warning","message":{"text":"pyproject.extractPoetryDependencies (cognitive 31): pyproject.extractPoetryDependencies has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (4 pts), ternaries 1 (2 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":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfda338dc3b08512beb2e4d40c4d7b585c9537fa7733c652507d8f1c912a0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.filterPlaywright (cognitive 31): misc.filterPlaywright has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 5 (9 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c240efd2ce589ad4b6cca8b20a8e8baefd28af6ec47143d362b6345b4b608a"}},{"ruleId":"D2","level":"warning","message":{"text":"communities.localMovePhase (cognitive 31): communities.localMovePhase has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 5 (10 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":"src/graph/communities.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3325bf78f64e7c6a416fb8d7492c9331c35db1538ffaf41b14ea388e138f3ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"watchmen.handleWatchmen (cognitive 31): watchmen.handleWatchmen has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/watchmen.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"63700b4f7c485230b9935b3bfba3c6b8b739670a03e9bd135d9f753a26768339"}},{"ruleId":"D2","level":"warning","message":{"text":"windsurf.uninitWindsurf (cognitive 31): windsurf.uninitWindsurf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 1 (3 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":"src/bin/installer/targets/windsurf.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e692025df03db9e3d094e311c15d701e48781411eafcea2b959a622d086a23bd"}},{"ruleId":"D2","level":"warning","message":{"text":"reachability.register (cognitive 31): reachability.register has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 2 (4 pts) (nesting depth added 10). None of this is in the body itself: all 31 points belong to one function literal inside it that branches (line 14). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/reachability.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d075cd3d5c41bbaeba16b62ac6c1faaed4e216c5261a6579fa5a7b72edc8c4"}},{"ruleId":"D2","level":"warning","message":{"text":"name-matcher.matchReference (cognitive 30): name-matcher.matchReference has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d746e2684ee9a9c46ec71fc924df82c050a123a672a6901402e2a12ce3444da5"}},{"ruleId":"D2","level":"warning","message":{"text":"state.workspaceFingerprint (cognitive 30): state.workspaceFingerprint has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 3 (7 pts), boolean chains 4, loops 3 (4 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":"src/sync/state.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c93a41eb82b3025baef9294dc398760a289030461dec723c44280e10a6474"}},{"ruleId":"D2","level":"warning","message":{"text":"rubygems.parseRubygemsManifest (cognitive 30): rubygems.parseRubygemsManifest has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 2 (5 pts), boolean chains 2, loops 2, 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":"src/security/manifest/plugins/rubygems.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c88cd86074b0a7f4d730f6835211b80a6b6e7ff8b7c0518165d12c735fa506"}},{"ruleId":"D2","level":"warning","message":{"text":"DataQueries.quality (cognitive 30): DataQueries.quality has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), error handling 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6902975a5e0ad32490603fcb929b831d5cac6ce3854e6bd7341eca5904c7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"AttackSurfaceAnalyzer.analyze (cognitive 30): AttackSurfaceAnalyzer.analyze has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, loops 3 (6 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 25 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/attack-surface.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b02f5db11d5d1c91d640cc4bfcbc4a3464527be58b379eee1d5f44fb71b2cd"}},{"ruleId":"D2","level":"warning","message":{"text":"cost.register (cognitive 30): cost.register has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 6 (9 pts), ternaries 2 (4 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 13). None of this is in the body itself: all 30 points belong to one function literal inside it that branches (line 42). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/cost.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ce0392d790a590bda5487a30fc23ef43bbcc9dfbc3cc912f66d05d018ad202"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt.singleChoice (cognitive 30): prompt.singleChoice has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 4 (8 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 6). None of this is in the body itself: all 30 points belong to 2 function literals inside it that branch (lines 115, 165). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f3e31103443ac0b0eb5d390e0664f27f9ee8897ba8130e8807872afba68f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.walkTree (cognitive 29): extractor.walkTree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, loops 3 (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":"src/extraction/extractor.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71f980d6a0c11bbaac6ee0e21ea2a703463ed40c8de44ab0ad0a96b06e80781"}},{"ruleId":"D2","level":"warning","message":{"text":"ReachabilityAnalyzer.getImpactSummary (cognitive 29): ReachabilityAnalyzer.getImpactSummary has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (12 pts), boolean chains 1, ternaries 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":"src/security/reachability.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8e8e7d3145a0ab6277679edccc2eac53b773c9d8300de007d5ae894c3e790"}},{"ruleId":"D2","level":"warning","message":{"text":"auto-detect.runAutoDetectInstaller (cognitive 29): auto-detect.runAutoDetectInstaller has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/auto-detect.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"412e7c1262577ff2d90688800c5c6c485d17cea855295408fb29d565f2cc2135"}},{"ruleId":"D2","level":"warning","message":{"text":"security-secrets.register (cognitive 29): security-secrets.register has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 5 (9 pts), boolean chains 2, loops 1 (nesting depth added 8). None of this is in the body itself: all 29 points belong to one function literal inside it that branches (line 46). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-secrets.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b92b78a1d6b061c86c55e8ceb407b5055afac2d1b9f2e8d8cacbabc6e72ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog.html.setupScrollSpy (cognitive 28): changelog.html.setupScrollSpy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, loops 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 6 function items inside it that branch (updateActive, a function literal at line 187, a function literal at line 198, \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":"docs/changelog.html"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd7e04c2bb6a6eb2ea0430021864c75c135a7023b82c4434ba236d52e2bc6bb"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDatabase.resolveUnresolvedRefs (cognitive 28): GraphDatabase.resolveUnresolvedRefs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d0dccbef9bc088615ab42c84b26e2c5947b7370dc573e7b9fb8cc376032531"}},{"ruleId":"D2","level":"warning","message":{"text":"composer.extractFromComposerLock (cognitive 28): composer.extractFromComposerLock has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 3 (10 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5784bb2c4818627f3bf9c94833510cb9596aea0f730a2461b99193d62db7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocsQueries.searchSections (cognitive 28): DocsQueries.searchSections has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/queries.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"13da2f2fba7df393c878db892736fcadf84ca24cfdb525f2712222348103b36e"}},{"ruleId":"D2","level":"warning","message":{"text":"ingest.applyDiff (cognitive 28): ingest.applyDiff has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/ingest.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7480f5dc2d1189cf8288bf29fdbbbb38517822de83b7e4e0a6374f7f0ceb5"}},{"ruleId":"D2","level":"warning","message":{"text":"caveman.register (cognitive 28): caveman.register has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 2 (6 pts), loops 3 (5 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 46). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f35adb980ccc4ae41bf16715f3299498b69ef0bb5adb144dedc83cb3a20cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"copilot.uninitCopilot (cognitive 28): copilot.uninitCopilot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/copilot.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b66cab8d50c3b294edd8ac8ca2e444836e8c6f7158d76b0520ca533f3d3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPServer.handleMessage (cognitive 28): MCPServer.handleMessage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (7 pts), error handling 2 (4 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/server.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d0832384ad518a292cd1176f59a91270dbf0fbd278819f1f7cf278aab37652"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-if-dirty.register (cognitive 28): sync-if-dirty.register has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (28 pts) (nesting depth added 11). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 13). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/sync-if-dirty.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"20061c4b4cb53953fc8ea0a276b625e9e1fd8f8d5821331b38cb0b27f2bc2f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"native-events.findEventListeners (cognitive 27): native-events.findEventListeners has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 7, loops 4 (7 pts) (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"106429cc96e120a5a049a05f4d0609ded7f7c4c785844c15b8a85fd3b6f0ebf2"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver.invalidateFile (cognitive 27): ReferenceResolver.invalidateFile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa5d2f5b22c8bbb7c080fc48730246b18b2b2241aed1d3105cc57b71cfddae"}},{"ruleId":"D2","level":"warning","message":{"text":"composer.parseComposerManifest (cognitive 27): composer.parseComposerManifest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 3 (7 pts), loops 3 (4 pts), error handling 2, 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":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f0436a0a1b4f8087319e00a025ac29f87b2a8ad90b956f7800439caa1798a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DataQueries.correlations (cognitive 27): DataQueries.correlations has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 5 (11 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af02452101d3ab76dda5cc0bf19af62b22517b6994fdc60f14a661f15ce984a"}},{"ruleId":"D2","level":"warning","message":{"text":"devin.uninitDevin (cognitive 27): devin.uninitDevin has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/devin.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"de981157a7d521c6f86541cc258f2537941369e7dc2116cf3ecd5c6b2bf1d2a3"}},{"ruleId":"D2","level":"warning","message":{"text":"libc-shims.zeroMallocInBinary (cognitive 26): libc-shims.zeroMallocInBinary has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (8 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/libc-shims.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eedc435180cf2ed95d8157946e37f2faa6f63639d1d6ef4b60ee9f7c7d9ca4d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphQueryManager.getAffectedTests (cognitive 26): GraphQueryManager.getAffectedTests has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 4 (10 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":"src/graph/queries.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c363a9e424ae1a87bc900152fec6dfe81eb481a26cc6c26a2044c6d191fbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceResolver._resolveImportPath (cognitive 26): ReferenceResolver._resolveImportPath has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (7 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":"src/resolution/index.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"971ded9d0878609cf93933e3013b7366914b3403c3646d375529f271b3c90047"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesenseIndex.initialize (cognitive 26): TypesenseIndex.initialize has cognitive complexity 26 (threshold 15). Drivers by points: error handling 7 (15 pts), if/else 5 (7 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f04db58e6b4ffda48729d331de7b9bb6dd192971163c077331ea42b8d9988"}},{"ruleId":"D2","level":"warning","message":{"text":"index.buildResolutionContext.readFile (cognitive 26): index.buildResolutionContext.readFile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 4 (7 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b024dd8d8a1130743a03b4f36438de5153d4d16d0d365ef6467ef9c244224fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"pyproject.parsePyprojectManifest (cognitive 26): pyproject.parsePyprojectManifest has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 4 (8 pts), loops 4 (5 pts), boolean chains 1, error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e81447035522fc29de1d3a411b246c994c3a1103b35e0ed159b1edde9151b69"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.compareVersions (cognitive 26): parser.compareVersions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/parser.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f5173f9f69f6c3e080db8d0852537e4a6a286058e5101a6dc2b2b5f61a9a84"}},{"ruleId":"D2","level":"warning","message":{"text":"linker.detectDataReferences (cognitive 26): linker.detectDataReferences has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (10 pts), ternaries 2 (9 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/linker.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"47504942b57919a4232dce242a3c419bace6279e1c3cee076032879b25f2620c"}},{"ruleId":"D2","level":"warning","message":{"text":"lint.filterTsc (cognitive 26): lint.filterTsc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"681f94042495443184e748c175f14b621ed5d0c09b30539e796f46445e35afe5"}},{"ruleId":"D2","level":"warning","message":{"text":"help.renderGroup (cognitive 26): help.renderGroup has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (14 pts), loops 3 (6 pts), boolean chains 3, if/else 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/help.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2480451115db82f0e48d01e971d9b824e256c78c5c371a43d6733107f9abaf4a"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.refineDartClassKind (cognitive 25): extractor.refineDartClassKind has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 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":"src/extraction/extractor.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"265f98dbc7c4e3ed2571756cc97e5ac5fda75250a9a05d65a79611f03f0214a6"}},{"ruleId":"D2","level":"warning","message":{"text":"LockManager.acquire (cognitive 25): LockManager.acquire has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 3 (5 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":"src/core/lock-manager.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab02b806a2cd8959ccca0a38c4086254125f0cedab9ed43284bc7125f5762d1"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphIntegrator.integrate (cognitive 25): DependencyGraphIntegrator.integrate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (5 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":"src/security/integrator.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee29ba937681ebab54672b5637fd6ee2057dfc757edb32b72115c11a9b41358"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityPipeline.run (cognitive 25): SecurityPipeline.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, ternaries 2 (3 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/pipeline.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9cb17cc98651682a1cfd603af4c05d10c37b561e8ea3975cdd9f6742e3c614"}},{"ruleId":"D2","level":"warning","message":{"text":"rst.extractHeadings (cognitive 25): rst.extractHeadings has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), ternaries 2 (8 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/formats/rst.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e957e24794fca606b3a35265d963d002fcf330983c5fa970898bb3df897986"}},{"ruleId":"D2","level":"warning","message":{"text":"lint.filterEslint (cognitive 25): lint.filterEslint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e778479028fcb4f5c3bffbac91372374469887b8d70a503fbb03b9ac326955"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.filterGrep (cognitive 25): misc.filterGrep has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (4 pts), ternaries 1 (2 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":"src/compression/filters/misc.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bf81d5ca46b044f4bed4f30034ceed73471a3629a60596fdf960efaac2085b"}},{"ruleId":"D2","level":"warning","message":{"text":"DepConfusionChecker.check (cognitive 25): DepConfusionChecker.check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (5 pts), ternaries 1 (4 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/dep-confusion.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2d379ff3dd84d85090d6ac9a02a36c4aa9218c1118c56ed7f88ec1ccbafe93"}},{"ruleId":"D2","level":"warning","message":{"text":"DataLinter.lint (cognitive 25): DataLinter.lint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 4 (7 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":"src/data/lint.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eadd41e46247d35a6b0ea8922bf429e4093cbf50007bfe6cae59b973cb8bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor.register (cognitive 25): refactor.register has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 pts), ternaries 2 (5 pts) (nesting depth added 11). None of this is in the body itself: all 25 points belong to 2 function literals inside it that branch (lines 14, 67). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/refactor.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dd7be9d9daba2b4e838c20f5ab4d03d8b697a6b7ea6659c1ac623a130ad039"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDatabase.findPath (cognitive 24): GraphDatabase.findPath has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (8 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":"src/db/database.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8087dbd2d6dfadcbf25d786bc19f7730af588897a4518a0b2252c5700530970"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-modules.findExpoModuleDecls (cognitive 24): expo-modules.findExpoModuleDecls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aafb615b944fa12cd365e450f1eaf6bd32880054fee3beee1a1372c8ae1c9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"expo-modules.findExpoModuleCalls (cognitive 24): expo-modules.findExpoModuleCalls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (8 pts), boolean chains 5 (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"650c304b7e299185544955dbe32c87105854ca671017d0266f35277be54f8cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"native-views.findNativeViewUsages (cognitive 24): native-views.findNativeViewUsages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb0342eaad34c92fc0f5ad44da25e482e320a50c12677c550d4c2139dbaa89"}},{"ruleId":"D2","level":"warning","message":{"text":"linker.extractCandidateRefs (cognitive 24): linker.extractCandidateRefs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/linker.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8666121bca9a5fca6e4eb5cb203f0184ea22a0848e9f07bc4dd3094b6bdeb21"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler.generateColumnSummary (cognitive 24): profiler.generateColumnSummary has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7 (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":"src/data/profiler.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63dbb7a7b52638e9682e28e4176868b0c338b84c9e0ee1492e48aae0849a3b5"}},{"ruleId":"D2","level":"warning","message":{"text":"aws.unwrapDynamoTypes (cognitive 24): aws.unwrapDynamoTypes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b70435b3bfafc9d99c169f4254650d8d07b3602609d2c220e1a0ac264c27839"}},{"ruleId":"D2","level":"warning","message":{"text":"read-modes.readDiff (cognitive 24): read-modes.readDiff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (8 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":"src/mcp/read-modes.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"259caf9ebea9c4f024dcbdec46fcbdb707bd34adacd997fb376911e04ac965d0"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.register (cognitive 24): snapshot.register has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (7 pts), ternaries 2 (3 pts) (nesting depth added 11). None of this is in the body itself: all 24 points belong to 2 function literals inside it that branch (lines 61, 33). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/snapshot.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9346d5e88a68a6384dca92178b0ad963c5b4f080778c5a11f819cd781dea4c64"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.augmentBash::visit (cognitive 23): infra.augmentBash::visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (infra.augmentBash) 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":"src/extraction/infra.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2359c7d06e08318dcee74d671e0ca23ec27e6bc0141f8695e25a7332634318b1"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.scanJson::ws (cognitive 23): infra.scanJson::ws has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (infra.scanJson::value, infra.scanJson::object) 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":"src/extraction/infra.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"160e875bf08775a1c7e9845e7defdc9afd2d89cd841a18585828c85c975e9c62"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.walkForCalls (cognitive 23): extractor.walkForCalls has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ed2021c4905f4d67cf1cd3bcfbeb89c7c67620f3260ad9a52fcd0c21270da9"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphQueryManager.findPath (cognitive 23): GraphQueryManager.findPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (5 pts), ternaries 2 (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":"src/graph/queries.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"08980505d3f9392be911ce039bf6711e0be976ad4fc0429704d1d48298b87be0"}},{"ruleId":"D2","level":"warning","message":{"text":"iac.resolveHandlerString (cognitive 23): iac.resolveHandlerString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6172a0acd1d3483622c29ea58b94e556e9bf377f0b2d2949951200b66030fc8f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.buildResolutionContext.fileExists (cognitive 23): index.buildResolutionContext.fileExists has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, error handling 2 (3 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":"src/frameworks/index.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"05375a08e44d4df05a0ae8f2b5809f9466415fc9dc0f048b04c1de8818427311"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.extractTransitiveNpmDependencies (cognitive 23): npm.extractTransitiveNpmDependencies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (6 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8814640a1b1c0e108808c3c166008b2a6c9ee08bfbc654c30af338b45ee56514"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphIntegrator.matchImportToDependency (cognitive 23): DependencyGraphIntegrator.matchImportToDependency has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 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":"src/security/integrator.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67094b87c422cecebf2b8bbb0f635523504e3db6d1198b7769921da4324bbae"}},{"ruleId":"D2","level":"warning","message":{"text":"OsvAdapter.queryBatch (cognitive 23): OsvAdapter.queryBatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (6 pts), loops 3 (4 pts), error handling 1 (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/osv-adapter.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a20176230137a6d0a1ebd358b823eb3ef9cc9df3a0bc3843f26d06d848fda3b"}},{"ruleId":"D2","level":"warning","message":{"text":"aws.filterCfnEvents (cognitive 23): aws.filterCfnEvents has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 7, if/else 3, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 194, 187, 210). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b886b2b4619f1f6ee3ce6fe77fe07262fa4a523debd5c88a76fe9d09c72f1e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SBOMExporter.export (cognitive 23): SBOMExporter.export has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), boolean chains 2, ternaries 2 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/sbom.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"48eb74d4fc4e542555fd9e67a07919156afba6e2741d056ad01a0dbe8eb3662a"}},{"ruleId":"D2","level":"warning","message":{"text":"supply-chain.computeRisk (cognitive 23): supply-chain.computeRisk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, boolean chains 11. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/supply-chain.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d71927e635105d147eb896a47965669ff0daffb4680978aca50c59f8e4c1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"hotspots.register (cognitive 23): hotspots.register has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 9). None of this is in the body itself: all 23 points belong to 2 function literals inside it that branch (lines 15, 111). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/hotspots.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"da22994dac5229a474b93256d9aa42c8a67be90f630ec1e5522238eec2816900"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.extractJsonConfig (cognitive 22): infra.extractJsonConfig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), ternaries 2 (4 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":"src/extraction/infra.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2b3f1c9305ccf808deef7ba5ef22d6c318fa165e0e334491003bf011a20aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"android-rn.findJsxPropUsages (cognitive 22): android-rn.findJsxPropUsages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee25aa177e2fbb4e76b5f3294450532990cc540105222c25d7c34e80a743842"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.extractFromPackageLock (cognitive 22): npm.extractFromPackageLock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 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":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f24691caf4e1c90b28d69c20094f5cad52e96f03bbeb0de2271344fdd70893"}},{"ruleId":"D2","level":"warning","message":{"text":"ReachabilityAnalyzer.reverseBfsToEntryPoints (cognitive 22): ReachabilityAnalyzer.reverseBfsToEntryPoints has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 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":"src/security/reachability.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"010a91bea9a181cf001d0744f5fe6357ea67a6bb9cc980b52769b623d2d43b25"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternRunner.applyFix (cognitive 22): PatternRunner.applyFix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (7 pts), ternaries 2 (3 pts), error handling 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/runner.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"02127ccb9d11676d234debe05224a32b982b316f3483a836537868a1bee58df5"}},{"ruleId":"D2","level":"warning","message":{"text":"synthesize.runLocalSynthesis (cognitive 22): synthesize.runLocalSynthesis has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (5 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":"src/watchmen/synthesize.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d825c61b71797c26fd79dc1b727491009ba2db4cad34a3025f9026199007cfb5"}},{"ruleId":"D2","level":"warning","message":{"text":"read-modes.readSignatures (cognitive 22): read-modes.readSignatures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), ternaries 2 (3 pts), 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":"src/mcp/read-modes.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"47317e3965c87f5a03855a702dcdaac51a817ae3d87b650b4b3e45f2293dd7da"}},{"ruleId":"D2","level":"warning","message":{"text":"claude.uninitClaude (cognitive 22): claude.uninitClaude has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/claude.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e063d98e11ff15b190a19f01fc19a800ac2c149fd912aaf11777a3afbaa5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"cursor.uninitCursor (cognitive 22): cursor.uninitCursor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/cursor.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb24a0e604012e461481184dfb6acb7b751dcf4fdb54b80ddd61093d5fd617"}},{"ruleId":"D2","level":"warning","message":{"text":"remediation.register (cognitive 22): remediation.register has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 9, loops 1 (nesting depth added 5). None of this is in the body itself: all 22 points belong to 2 function literals inside it that branch (lines 30, 61). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/remediation.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb57ce3c28c7cc55dd6a36aed62f529967920eb2e9527b7d07c400152c6b5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.importBindingNames (cognitive 21): extractor.importBindingNames has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 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":"src/extraction/extractor.ts"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b974cf2a6af095b07818f978c3d9366095f5b4275aaec9ac925a65ab9f051bf"}},{"ruleId":"D2","level":"warning","message":{"text":"react.resolveComponent (cognitive 21): react.resolveComponent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/react.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f89cfd1ad94547702545c4db2c41a3747c61d924c52ed6f366eeb9afe17911"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.findNpmDuplicateVersions (cognitive 21): npm.findNpmDuplicateVersions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5665e73b69afc43ddc4414cf8d6f4fbaee2b459d96c8cc2006c6032ff6be100"}},{"ruleId":"D2","level":"warning","message":{"text":"nuget.extractFromPackagesLock (cognitive 21): nuget.extractFromPackagesLock has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 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":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0228db906e8673519deeee5acba534d161059c81315993d170ab087ccb56c37"}},{"ruleId":"D2","level":"warning","message":{"text":"integrator.parseNpmLockTransitives (cognitive 21): integrator.parseNpmLockTransitives has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1219311e4d9bcc6d91f9ebbef44aa4d49de3d67839b182647d81d0c62098c9"}},{"ruleId":"D2","level":"warning","message":{"text":"integrator.parseCargoLockTransitives (cognitive 21): integrator.parseCargoLockTransitives has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"04964d0906451faabb55d627661c6ac9f6a93500397faaff3052760ceb417038"}},{"ruleId":"D2","level":"warning","message":{"text":"git.filterGitLog (cognitive 21): git.filterGitLog has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad13bc6805cf5240cdc8b23e6395fceb1875d191874eb9e7d8cd6bae4df173a"}},{"ruleId":"D2","level":"warning","message":{"text":"aws.filterEc2Instances (cognitive 21): aws.filterEc2Instances has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (6 pts), ternaries 1 (4 pts), loops 2 (3 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f99cea5fc61ad9d01049e5ffac5c17f2c7715f477ee0b7b55267995e23ce58"}},{"ruleId":"D2","level":"warning","message":{"text":"context-warnings.getSecurityWarningsForNodes (cognitive 21): context-warnings.getSecurityWarningsForNodes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/context-warnings.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de487c263010b164708c3d338f708f057d1c1620211d98149f443ca82443788"}},{"ruleId":"D2","level":"warning","message":{"text":"read-modes.readMap (cognitive 21): read-modes.readMap has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (6 pts), loops 3 (6 pts), 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":"src/mcp/read-modes.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"405b92d77998a3f63dde7fce2a6c4a07ef5e4ccf8f0307a1d2982f687311ec38"}},{"ruleId":"D2","level":"warning","message":{"text":"attack-surface.printRouteEntry (cognitive 21): attack-surface.printRouteEntry has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 4 (5 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/attack-surface.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd3b89afb9672ea707cb0c3296441fddce11d7f35c47579f774d6f77d6d8164"}},{"ruleId":"D2","level":"warning","message":{"text":"context.register (cognitive 21): context.register has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (11 pts), if/else 5 (10 pts) (nesting depth added 13). None of this is in the body itself: all 21 points belong to one function literal inside it that branches (line 11). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/context.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e68b68124dceb06697443b05122a30afbaa43a33d13f9c1bf6ed38894b918aa"}},{"ruleId":"D2","level":"warning","message":{"text":"export.buildFiles (cognitive 21): export.buildFiles has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 12, if/else 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 233, 281, 299, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2b73f665f449d353147fc1f511fdb109ea2ecf3a5af4b3b2c98a8e311bad9a"}},{"ruleId":"D2","level":"warning","message":{"text":"help.printColoredHelp (cognitive 21): help.printColoredHelp has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (10 pts), ternaries 2 (8 pts), if/else 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/help.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7d0022500609a53ca29b54067c0ed87c2d54fd8ced457b38c4c62b176efb2e"}},{"ruleId":"D2","level":"warning","message":{"text":"prompts.arrowSelect (cognitive 21): prompts.arrowSelect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 5). None of this is in the body itself: all 21 points belong to 4 function items inside it that branch (a function literal at line 147, render, descLineCount, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/prompts.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad062df8cc013c515f4039cf01683d73e3f5b8e184209057de6e0d686042c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex.uninitCodex (cognitive 21): codex.uninitCodex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/codex.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9024e69c0b056afb0391d633fa733f20a1a6d0f6a506a5617a319f28a847f1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"status.showIntegrations (cognitive 21): status.showIntegrations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). Of this number, 16 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":"src/bin/commands/status.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02de7f656fa52deb74ea5a05e1a575a5f4d027daca5b4f774df3b0fd8b45c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"notebook.extractPythonCallName (cognitive 20): notebook.extractPythonCallName has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/notebook.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"498121ada6013688d70fdd34860ced5fa3c88b4c3af0b318e7c51a70e2fc6d95"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.walkElixirCall (cognitive 20): extractor.walkElixirCall has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts), ternaries 1 (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":"src/extraction/extractor.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"067feb254744ea40acbfff55211cf1f802946eaa884f7f29d14953e748629fde"}},{"ruleId":"D2","level":"warning","message":{"text":"extractor.extractCallName (cognitive 20): extractor.extractCallName has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33038234ea60b39071c1cc0d236ca23d4c8e7dde3cb975464f12bde1f3f334b"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphTraverser.traverseDFS::dfs (cognitive 20): GraphTraverser.traverseDFS::dfs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/traversal.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"207e0eec2dd8373e3a1ef09d7a3142a6bf41016d38ccd5757524444c0bab9c24"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.extractZip (cognitive 20): archive.extractZip has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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":"src/bin/installer/archive.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5cdadba36b4b649d5b16400c76a174b20f716d28767abaaf08f0851cf13682"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo.extractFromCargoLock (cognitive 20): cargo.extractFromCargoLock has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"65516945a03b1efb7b9d39f5d81ad0ab6635c9d258f87b03c2d54822a143f5f2"}},{"ruleId":"D2","level":"warning","message":{"text":"nuget.parseNugetManifest (cognitive 20): nuget.parseNugetManifest has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (10 pts), loops 3 (4 pts), error handling 2 (3 pts), if/else 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":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"496f3c56a4b98be81dcb732c3f11326225a2322f358d115a5eff5eb20910c57f"}},{"ruleId":"D2","level":"warning","message":{"text":"nuget.extractPackageReferences (cognitive 20): nuget.extractPackageReferences has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, ternaries 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":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ad9ad9c173149f74cca9ef1a1e4dc6103de482a96a260ce832e4c0635acd29"}},{"ruleId":"D2","level":"warning","message":{"text":"git.filterGitDiff (cognitive 20): git.filterGitDiff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (3 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":"src/compression/filters/git.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7da1880d9542a5a3b0aca5ecee4725d710c54b981bc898d7f21abb252149a30"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryManager.search (cognitive 20): MemoryManager.search has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 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":"src/memory/index.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d656951e4d9aecc44be1543a2a882d834385442bda6ed13d9a212285225e87f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataQueries.detectDrift (cognitive 20): DataQueries.detectDrift has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, 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":"src/data/queries.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ded0f403f512ed1a7c4306d33aebf1fefb487bd2e771cbd10538d6f6a61bc07"}},{"ruleId":"D2","level":"warning","message":{"text":"bench.register (cognitive 20): bench.register has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (5 pts), error handling 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 8). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 16). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/bench.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9035f3b776e0f85dfe811a0086ab2bbb3eb7b130ca17bc13d7813988daaa1260"}},{"ruleId":"D2","level":"warning","message":{"text":"gemini-cli.uninitGeminiCli (cognitive 20): gemini-cli.uninitGeminiCli has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (20 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":"src/bin/installer/targets/gemini-cli.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c721dfdc5a71a98299956a5f8f633801726be376559e796c90d22897d4d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"staleness.register (cognitive 20): staleness.register has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 5). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 33). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/staleness.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c53ca089cc187ce11a1312ffcf8a53ee910e18edb49ed55d3ef2626d2b8f9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"supply-chain.register (cognitive 20): supply-chain.register has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 36). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/supply-chain.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d32c397d9b920c2c880dce2959171d2366a9d3e90270e5fa0a17cabad17e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"complexity.walkComplexity (cognitive 20): complexity.walkComplexity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (7 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":"src/extraction/complexity.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e36b822969a6493c72fc1b9fc027daff3d78cf24651b199185f0db3fa6520a6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.scanDirectoryWalk::walk (cognitive 19): index.scanDirectoryWalk::walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad1c074a5aea7d85b0ac040022dde8df96db7d4cb58713c29e7f69a6b8bff08"}},{"ruleId":"D2","level":"warning","message":{"text":"svelte.resolveComponent (cognitive 19): svelte.resolveComponent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, loops 2 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/svelte.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22f556b9241834c15e50cc7c96c6fe9006c417046ce2d8a8996c2b6528b14f7"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.loadNpmLicenses (cognitive 19): npm.loadNpmLicenses has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b961e1fad278f2c803901c63970362468d9bfe3a5ea27287e4de488808865d51"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.normalizeLicenseField (cognitive 19): npm.normalizeLicenseField has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17cc42f4fb421599ae04a9b52f156b97d5653bb037705f0f99429a330bacfd6"}},{"ruleId":"D2","level":"warning","message":{"text":"pubspec.extractFromPubspecLock (cognitive 19): pubspec.extractFromPubspecLock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c59495dfc0e4396357a06d1cc2fd3d7b2bb6ea5f27400385d7ea156f0f2924"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraphIntegrator.cleanup (cognitive 19): DependencyGraphIntegrator.cleanup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (6 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"426d745b795a61bd60326307d895725b0b70dfc428948c3c11d16c0d8c8ad1b2"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown.extractHeadings (cognitive 19): markdown.extractHeadings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/formats/markdown.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ee00ad9378b787801401789bfa7ba9dfe8edf4fc80ee6318f3c5b6f7c54f70"}},{"ruleId":"D2","level":"warning","message":{"text":"csv.parseCSVLine (cognitive 19): csv.parseCSVLine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/csv.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"493e2167b451fb4564e798c144a7b652f79115f8377ad817fffed84b7a442b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"file-tree.buildFileTree (cognitive 19): file-tree.buildFileTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/file-tree.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d67260d4ff8fad3c435ed7d7ed077b4e3570bc1bc7ce32074c44a2acfeee2c"}},{"ruleId":"D2","level":"warning","message":{"text":"files.filterFind (cognitive 19): files.filterFind has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1e680c1c511582c77a4dbde10c8fe4a55f9c4ec6ddcb09f52db28eb8b7c4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"attack-surface.register (cognitive 19): attack-surface.register has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 4 (7 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 4). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 17). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/attack-surface.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3058f9657338692f2d03b072e4fed72af179a0a13406d4452659afd797dff308"}},{"ruleId":"D2","level":"warning","message":{"text":"read.register (cognitive 19): read.register has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 2 (5 pts), ternaries 1 (nesting depth added 6). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 18). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/read.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21d790bc45d4f3546e2bfb752d08ac54fbc914ab9e6e6b2d68da47e336a7de8"}},{"ruleId":"D2","level":"warning","message":{"text":"files.listUncached (cognitive 18): files.listUncached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/files.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a897a844b3138d2b66173c46d39ac52f579feed9d75fe301c519155e6d3c50e"}},{"ruleId":"D2","level":"warning","message":{"text":"android-rn.findReactMethodDecls (cognitive 18): android-rn.findReactMethodDecls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d515a38ac9fd6d11e8d6161e6a9902d08eb2656a12601abfcaac89889490a0"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.loadResolvedVersions (cognitive 18): npm.loadResolvedVersions has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), error handling 3 (6 pts), if/else 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":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b80241bd62ee3f1c87ec2d81afbcfd2d01c70423215e0d2b5323130ba4c2523"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo.extractSectionDependencies (cognitive 18): cargo.extractSectionDependencies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 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":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"65305e6b9f8d8f64e8e483b2c25d8c66b780be192c11a3d95224efb20eba1a95"}},{"ruleId":"D2","level":"warning","message":{"text":"pyproject.extractPep621Dependencies (cognitive 18): pyproject.extractPep621Dependencies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), ternaries 1 (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":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"634f395f782f7392c745d891b62eb977c37afd02db012863c1f2327e2c7a684c"}},{"ruleId":"D2","level":"warning","message":{"text":"ManifestParser.parseAll (cognitive 18): ManifestParser.parseAll has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (6 pts), error handling 2 (4 pts), if/else 3 (4 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/parser.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"693b96d67221526774a123a04e961796806c77e82902d94b771692d2474542e8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocsIndexer.indexFile (cognitive 18): DocsIndexer.indexFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (7 pts), error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/indexer.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9daa0f71e7fd886c0a3496a32654730d0bd2ec6dd782e3a4283951e1e7e9deb"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryVectorManager.search (cognitive 18): MemoryVectorManager.search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/vectors.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfda7d9596cd70dee8f4b00269ca2ccf05c186afb2ea67ef8af722d7ea5762c8"}},{"ruleId":"D2","level":"warning","message":{"text":"filters.buildWhereClause (cognitive 18): filters.buildWhereClause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/filters.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f584ed22c0a57c01bb1c7a3c7dedce301dd89a90dd39936b9f73921d5b66042"}},{"ruleId":"D2","level":"warning","message":{"text":"synthesize.parseOutput (cognitive 18): synthesize.parseOutput has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (7 pts), loops 2 (3 pts) (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/synthesize.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6847b770eea21be6b5ad43a76cbe6d8c04b2c26e21ad7c5ec09100286a1b66b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolHandler.handle (cognitive 18): ToolHandler.handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, error handling 2 (3 pts), 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":"src/mcp/handler.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f8e872488afe38f25dc9b5271ffb7af5187042769db71fc626f01d1d548b90"}},{"ruleId":"D2","level":"warning","message":{"text":"help.printInteractiveHelp (cognitive 18): help.printInteractiveHelp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (onData). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/help.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d770b9f8705a532aab99f06ca57fa601f5190cc09a54eb8dd5062780cd00271"}},{"ruleId":"D2","level":"warning","message":{"text":"config-prompt.promptEmbeddings (cognitive 18): config-prompt.promptEmbeddings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 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":"src/bin/installer/config-prompt.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b9d1373a01f8b8f692d3490ccde1492c26d8e6970427a7fe59d3e394335014"}},{"ruleId":"D2","level":"warning","message":{"text":"opencode.uninitOpenCode (cognitive 18): opencode.uninitOpenCode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (18 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/opencode.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a3112130f516a50adfc60f91a9781e6251eaa7c4bfbfaccf4c51338870901e"}},{"ruleId":"D2","level":"warning","message":{"text":"kilo.uninitKilo (cognitive 18): kilo.uninitKilo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/targets/kilo.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f6f9304d57fd09ef9c16d8ad0f1cbb5ace74c10625ed4679f09215f38de0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"security-export.register (cognitive 18): security-export.register has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 4 (5 pts), error handling 4, boolean chains 1, loops 1 (nesting depth added 4). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 1292, 1330, 1352). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-export.ts"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fc739526f66f7b0c456ac20fd431532687bbf636e7a15cc64d180768d4c508"}},{"ruleId":"D2","level":"warning","message":{"text":"config.loadDotEnv (cognitive 17): config.loadDotEnv has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"5663e53e524b926c7798e49c67ccb7862336941708a108d1a4f681d0b7d9e16f"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.augmentBash (cognitive 17): infra.augmentBash has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 5 (12 pts), loops 6 (8 pts), boolean chains 5 (nesting depth added 23). 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 (infra.augmentBash::visit) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4080568992f09ce56d0dc2cd2b28067e012e54e9213ad904a46432d319692c"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.scanJson::object (cognitive 17): infra.scanJson::object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (infra.scanJson::ws, infra.scanJson::value) 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":"src/extraction/infra.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f5f857b3d60833dc7156d2448f60b619cd8d572c72873241188fca3b267faa"}},{"ruleId":"D2","level":"warning","message":{"text":"android-rn.findReactPropDecls (cognitive 17): android-rn.findReactPropDecls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59b0153a1f45d54e581f07ce1e7a2407a02e06ca5c3b0a853cf9a37cd701b43"}},{"ruleId":"D2","level":"warning","message":{"text":"QdrantIndex.initialize (cognitive 17): QdrantIndex.initialize has cognitive complexity 17 (threshold 15). Drivers by points: error handling 5 (10 pts), if/else 4 (5 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":"src/vectors/qdrant-index.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea20bc512fd1f0481949bb0e7e72592aa92fd2e461ca6e19f4ff8f391ac9e02"}},{"ruleId":"D2","level":"warning","message":{"text":"swift.extractPinsV1 (cognitive 17): swift.extractPinsV1 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, 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":"src/security/manifest/plugins/swift.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35ba7487d27739336968a810c23d06c10ae689e62644f4640e1cb74cff74beb"}},{"ruleId":"D2","level":"warning","message":{"text":"DataIndexer.indexFile (cognitive 17): DataIndexer.indexFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2, ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/indexer.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d15c4e47b5e2624a62b188e4e2fc8fb7e98876ca9029b4fb2cead80cfc8860"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.filterDiff (cognitive 17): misc.filterDiff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (3 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":"src/compression/filters/misc.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0ff499c412cf69d69f23b260caec56e5aa00472e7613db0ed9ca82406fecf6"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryManager.scanConflicts (cognitive 17): MemoryManager.scanConflicts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/index.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf7dcb3f601f3bb178d3d69561b7a2d750f9d9988d4325a356599c62dc01682"}},{"ruleId":"D2","level":"warning","message":{"text":"DataQueries.validationRules (cognitive 17): DataQueries.validationRules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"438971848fd779c653a16771f8a148d4e99404847dd208704f621a5c36893e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"hooks.writeHooks (cognitive 17): hooks.writeHooks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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":"src/bin/installer/hooks.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fa09ab4468d80a6c82bf500ad2a8724e8e3515468b35409c50a78d0ad1a929"}},{"ruleId":"D2","level":"warning","message":{"text":"compression.register (cognitive 17): compression.register has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 6, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 6). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 27). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/compression.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1109f0e26a982e8c846b37d3c0ee0f0b8d91be46655b3016ef6390f22941fd1f"}},{"ruleId":"D2","level":"warning","message":{"text":"monitor.register (cognitive 17): monitor.register has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), error handling 2 (4 pts), if/else 2, loops 2, boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 9, 43). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc083f27f52fd1be65483fe93a794f6f9ce5b6ab5bb7cce47847fae89306628"}},{"ruleId":"D2","level":"warning","message":{"text":"uninit.runUninit (cognitive 17): uninit.runUninit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/uninit.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3472abfcb0f07186584be9d2a30e6d07702ed1e7d36ee893ddbd8103d5a67434"}},{"ruleId":"D2","level":"warning","message":{"text":"notebook.walkPythonTree (cognitive 16): notebook.walkPythonTree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (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":"src/extraction/notebook.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0add4c7a6f5898d2a86fe2343ec089ee31cfa2267dc0a6cc30574d04b792d71b"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.hclTraversals::visit (cognitive 16): infra.hclTraversals::visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 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":"src/extraction/infra.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"be826a513cd6739c0424c75dfd75175bb7bcbb0043ef52900be56593bf0fe562"}},{"ruleId":"D2","level":"warning","message":{"text":"infra.scanJson::value (cognitive 16): infra.scanJson::value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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. This shape REPEATS in the file: 2 other methods here (infra.scanJson::ws, infra.scanJson::object) 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":"src/extraction/infra.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"233e017130b4586ff3ed558174f3178b81d8a8004e432139f655df6515c7af41"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDatabase.runMigrations (cognitive 16): GraphDatabase.runMigrations has cognitive complexity 16 (threshold 15). Drivers by points: error handling 6 (9 pts), if/else 4, loops 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"63879d907928b25bea23ff127687e79bd740e82bc7eb5fdc91b5b2cf5d9db3d0"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDatabase.getTypeHierarchy (cognitive 16): GraphDatabase.getTypeHierarchy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 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":"src/db/database.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ccf6addac667186b750026de7ae125b9b9776f174913a7b94464b4b86eba63"}},{"ruleId":"D2","level":"warning","message":{"text":"turbomodules.findCallSitesForModule (cognitive 16): turbomodules.findCallSitesForModule has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/turbomodules.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"868289874c6727320fb57bbea9439179372eac0b86b284fc5b32b67da60b1486"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.deduplicateDependencies (cognitive 16): parser.deduplicateDependencies has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/parser.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05e1056d29a7750cb06fc8a525422f7564a49dd0997e07caebfbf5509d84ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"VulnerabilityDatabaseClient.enrichDuplicateVersions (cognitive 16): VulnerabilityDatabaseClient.enrichDuplicateVersions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/client.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9127b193662339a7818d787335073d9ee96abebb512c52a2a2b8e87b763c8d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.parseJSONOperations (cognitive 16): openapi.parseJSONOperations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/formats/openapi.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3322b3f69660b80c4f84953126df830e02041197b9be346ce2ec4b3faea3494a"}},{"ruleId":"D2","level":"warning","message":{"text":"aws.filterLogEvents (cognitive 16): aws.filterLogEvents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (4 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab0cb2a2d9b9484b9524979ccd2e220e4c71521e1d9c407ca7c2fe2252196ed"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryManager.store (cognitive 16): MemoryManager.store has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/index.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"19051273aff662c49c4afd7d5d0bd9174bfb73d2c4ffcc6a2070d832ca8a354e"}},{"ruleId":"D2","level":"warning","message":{"text":"context-warnings.formatSecurityWarnings (cognitive 16): context-warnings.formatSecurityWarnings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (7 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/context-warnings.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc3cb095437356eb5420b5eff94ee6bcef4f7ebbe296a13e486655becd5c549"}},{"ruleId":"D2","level":"warning","message":{"text":"sbom.getProjectName (cognitive 16): sbom.getProjectName has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/sbom.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4f7160f062ad0274ad2746c8474b362030c7921040ac364cd887ced8aec074"}},{"ruleId":"D2","level":"warning","message":{"text":"exec.register (cognitive 16): exec.register has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, error handling 2. None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 27). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/exec.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32de630f7d152207ff9c8a4e825ba47dcf08ffc0eece749f8f9738ac2f85ec4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: security.handleSecurity: FunctionTooLong \u2014 handleSecurity runs 628 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 528 over it, 6.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":"src/mcp/handlers/security.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dccdc999881402fec760fe85cf7082c0662756a27a8ad830a039db172d3102"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: config.validateConfig: FunctionTooLong \u2014 validateConfig runs 424 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 324 over it, 4.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddb574fdc7dee2879a3401a1d23d19eabb94feae129e9f852ea61afe6369afd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: code-health.handleCodeHealth: FunctionTooLong \u2014 handleCodeHealth runs 415 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 315 over it, 4.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6878c9993e90a44f3826fd306a389bb88b64a7f922f8d76522df6664d2396"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: memory.handleMemory: FunctionTooLong \u2014 handleMemory runs 290 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 190 over it, 2.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a022ccbee505b82e8cb474660ac994e82ee68edb4cfcf694dd28f1b52ca774"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphDatabase: 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":"src/db/database.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"733308624524c545edac5dae7ee95f638fb0bd8f088871b2feea958e1da7dff3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: data.handleData: FunctionTooLong \u2014 handleData runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa6b42b7675df08319f4c4e99b031209c06347fd517973ce75c1122a90508a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IndexPipeline.indexAllNow: MethodTooLong \u2014 indexAllNow runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab214988288a6ba71436ad55cf6e855088a2006ae863803e3fbe9b0d26e18ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IndexPipeline.syncNow: MethodTooLong \u2014 syncNow runs 226 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"035c9ce9b68d74291ff5551cc399af5f0bdc1b5857ce62cdfe9f9d9e7de1600c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphDatabase: ClassTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded), 82 methods. The bar is 400 significant lines; this is 442 over it, 2.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a23af60fb7436aea172be51667f503a5b50d1063cf99a00d3b0e3ed40a5d74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: architecture.handleArchitecture: FunctionTooLong \u2014 handleArchitecture runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecfdb759d305439c819d2a2cd900953ab0d63ec22170f1b0b9f08ac12773750"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: patterns.handlePatterns: FunctionTooLong \u2014 handlePatterns runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac8c05236a5fbf89bc4126e428605d8420287df185da2ec24cf55bfaf6a5125"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: wiki.handleWiki: FunctionTooLong \u2014 handleWiki runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"766826d09debf9e484b62048ffd222a7d185926bf19ae35a33c891b2256edd41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: complexity.handleComplexity: FunctionTooLong \u2014 handleComplexity runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/complexity.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"150d2dc00554903f7b88d476a892eb8518fb7e01027b88cf678064ca4ee6b2a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/extractor.ts: FileTooLong \u2014 981 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 481 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d14a6a10cdb3bca6104075c8be412f6129d5e64473497c6120ceb13ef7f7999"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: git-context.handleGitContext: FunctionTooLong \u2014 handleGitContext 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":"src/mcp/handlers/git-context.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f69bfb524202bba5d7e3a37be795ec82f276a1b8bc0e35fda1f2c350dd2936"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolHandler.dispatch: MethodTooLong \u2014 dispatch runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"902fb5bc3e69ea42d646b13740807da58cc3eaf026a1e60c76e42cd169af1636"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/database.ts: FileTooLong \u2014 853 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: GraphDatabase (24-1375). The bar is 500 significant lines; this is 353 over it, 1.71\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89343538ab717ee402cd71df7e944d5772ab609cd5469723a64e7871278efa98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AttackSurfaceAnalyzer.analyze: MethodTooLong \u2014 analyze runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/attack-surface.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca185641da790f96bd46befa7d01df96c69bcd54d029e7d34748b84158ce3dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.ts: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb02ec8127eb4a4a0d10336456c301dae7c07b00c508cba051e5a7fb1fecd46a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MemoryDatabase: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/database.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"767aae553e44b2f233bc2ee160a50c42d7898004709720a73923e97cb4c2da1c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KiroGraph: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"349e5ff97e04d19837acd59e798f295bf80402e1c2e1a510a8ed8ee211a4b0ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArchitectureAnalyzer.analyze: MethodTooLong \u2014 analyze runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/index.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a91d178a6a409c5ed4cb2a1cb64e8e95b8331c97d0bc0890e5d87d1d7ad202e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VectorManager.embedAll: MethodTooLong \u2014 embedAll runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b7fe2d56c26ec10b033305e76efafb318445795b5df5a7a75d6ebacd3a6ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IndexPipeline: ClassTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 120 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":"src/core/pipeline.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1295da7bdc6827e688b5530044dfc8b04c9e6c6ae098be9cfb7972782bf85cc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/security.ts: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: handleSecurity (4-910). The bar is 500 significant lines; this is 130 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":"src/mcp/handlers/security.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e737fa913f8f8fda56e7e342c9856ccec2f4117c69021c9948dca0e3b3de8e2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VectorManager.initialize: MethodTooLong \u2014 initialize runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"295436e13ae8a7c1384859b5f81a0ca9803d92348e7d6b4d3b10bc25d5e6603d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: edit-primitives.handleEditPrimitives: FunctionTooLong \u2014 handleEditPrimitives runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa0e56f88c6da283dc3b2732e024875d10d09521ceaf518ade37afa4c47231"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: docs.handleDocs: FunctionTooLong \u2014 handleDocs runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9618d08ff8b1ee2ee28281377a46ef5f1b121e354d82017cbabbd08a90d9633d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/pipeline.ts: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: IndexPipeline (39-851). The bar is 500 significant lines; this is 42 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7296b6a0c4a13e368e1fc3b8ca1119e8f9573a65123abcb5530aacd023336cff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: branch.handleBranch: FunctionTooLong \u2014 handleBranch runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83bef0ef493d6cf1977d6c67dd9f0db5289d5081d18964d490a3419670284b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): native/turbovec-node/src/lib.rs:111-117 | native/turbovec-node/src/lib.rs:157-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"native/turbovec-node/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"db31648287774c844d3e05a8c7609a7566b30344068fe5ff655641817016364c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/pipeline.ts: src/core/pipeline.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in IndexPipeline.syncNow at line 505. 6 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/core/pipeline.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeac03645b3901628875184da96be732aa96d1e3d26b9a810674b4d6aed396c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config.ts: src/config.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 191 in config.validateConfig at line 449. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0562f0a0815d88eff6006c13df14df4cd20d3c052b4b2ca2a07669561e96ad9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/commands/memory.ts: src/bin/commands/memory.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 142 in memory.register at line 19. 3 of those changes were fix/bug commits, and the other 4 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/bin/commands/memory.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/memory.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c30122a85cfd29bcad79c494eebeceb986e9fffab48a4a916fa6f90fe6e599"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/handlers/security.ts: src/mcp/handlers/security.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 190 in security.handleSecurity at line 4. 2 of those changes were fix/bug commits, and the other 3 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/mcp/handlers/security.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b398bf8aae79938f71b24e0933de067c34c005314afa684da78a84626abe0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/handlers/memory.ts: src/mcp/handlers/memory.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in memory.handleMemory at line 5. 2 of those changes were fix/bug commits, and the other 4 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/mcp/handlers/memory.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd3616fd3781842ad98b0077b8b65ddfac1bf31bccfdfb31969d1f5b5a131a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/commands/vulns.ts: src/bin/commands/vulns.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in vulns.register at line 31. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/bin/commands/vulns.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/vulns.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6141b85133615757de2c3a050a6af7de4a2360fc85bc9dfa68f1d3a6d3fbb5da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/installer/index.ts: src/bin/installer/index.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in index.runInstaller at line 124. 1 of those changes was a fix/bug commit, and the other 2 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/bin/installer/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":"src/bin/installer/index.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"26053dea5347717ab73cbe1b01281b4c230849e1e0a6642e090334ab2b7d44d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/commands/wiki.ts: src/bin/commands/wiki.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in wiki.register at line 62. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/bin/commands/wiki.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/wiki.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b04f4ea93fdd2b1c99f06dcbeec65a29bb51d7d030600b1ba2839ff045f0612"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/commands/sync.ts: src/bin/commands/sync.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in sync.register at line 7. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/bin/commands/sync.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/sync.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0228f3484a64f95ca6dcfe7761b314a5ef938643d68be1f04a8b1de3b313cf5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extraction/extractor.ts: src/extraction/extractor.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in extractor.extractFile at line 76. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/extraction/extractor.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c914745f93ee865120c98e791cc90517aec56adf288266832247fc6f16075f2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/resolution/index.ts: src/resolution/index.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ReferenceResolver.resolveUnresolvedRefs at line 163. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/resolution/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":"src/resolution/index.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6f1eb788d50112a0ba0dd77e0dd1f0da8c8a1deae63e20a7ca0cfa67a1defd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp/handlers/wiki.ts: src/mcp/handlers/wiki.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in wiki.handleWiki at line 3. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/mcp/handlers/wiki.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f12d168d0377b53cd74c67d9690695d1cb73fd5763d3b673fec9a63df40a3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/security/manifest/plugins/npm.ts: src/security/manifest/plugins/npm.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in npm.parseNpmManifest at line 39. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/security/manifest/plugins/npm.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d621a26c2836d64e32f6390f2b123d54e783cfd6eb08758a86592c9d066993"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/security/manifest/plugins/maven.ts: src/security/manifest/plugins/maven.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in maven.parseMavenManifest at line 62. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/security/manifest/plugins/maven.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f465bafa8d5f4da98ee3101a08980bfdb2e9419b5830ffd71e6c53a090004db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/installer/steering.ts: src/bin/installer/steering.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in steering.writeWorkflowSteering at line 976. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/bin/installer/steering.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/steering.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"8054f9d3ae4cbe74c12f7b29e2f8c36b0956b52beeaff2d1a48097ce970701c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/security/pipeline.ts: src/security/pipeline.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SecurityPipeline.run at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/security/pipeline.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/pipeline.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"580252a3186831af2ab72c91095aab6c2c569ee48f6ad833b1e86b8010efad0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/wiki/lint.ts: src/wiki/lint.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in lint.lintWiki at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/wiki/lint.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lint.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77140faf49af6c78c156578a83bac3ad42a4a08cbe94455623d58e4d0d1ab0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/sync/state.ts: src/sync/state.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in state.workspaceFingerprint at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/sync/state.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/state.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ead03b344ef1dd79bf3458b2324dac4a084f1ced1d506ab3fdf4418424bf1eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/sync/index.ts: src/sync/index.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in index.getChangedFiles at line 258. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/sync/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":"src/sync/index.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad3fab0c318d1c3ed5ecb37726018603d28b464686cc4f736267f247971f52a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/security/attack-surface.ts: src/security/attack-surface.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AttackSurfaceAnalyzer.analyze at line 87. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/security/attack-surface.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/attack-surface.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c981d7a34f48845461d2d5352f15640f0a8ee4dcf8db8fe60527dd8e84f5d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/commands/attack-surface.ts: src/bin/commands/attack-surface.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in attack-surface.register at line 10. 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 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/bin/commands/attack-surface.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/attack-surface.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9111567655ffa531d2e788eb638ed53046517cb1ddcb839222d58f297699e5ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/db/database.ts: src/db/database.ts changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is GraphDatabase.runMigrations at line 168), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: runtime lock recovery, background sync hooks, engines outside the project, multi-repo git tools, mem fixes\u201D; \u201Cfix(db): replay a hot journal before opening, make edges unique, unlock respects live writers, pin the driver\u201D; \u201Cfix(db): remove full-text entries and edges when nodes are deleted by the other paths\u201D; \u201Cfix(db): wait for a live writer with the busy timeout, not 8 seconds (#70)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/db/database.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9040f1c2659a3f259b452b78ec27c2e6f403a7b56013a38dd3e13f7ba1c1a771"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/security/reachability.ts: src/security/reachability.ts changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is ReachabilityAnalyzer.getImpactSummary at line 187), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(security): 1.1.1 \u2014 transitive dep scanning, Maven BOM resolution, reachability fixes\u201D; \u201Cfix(security): report under_investigation for dependencies with no call-graph signal\u201D; \u201Cfix(security): persist reachability verdict on the no-entry-point/no-dependency early exits\u201D; \u201Cfix(security): preserve under_investigation verdict in reverse-BFS reachability\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/security/reachability.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/reachability.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c355c4db220ff578cbc83dcda6e76256afe2cec098ba6eb0fdb4d79febd01c32"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/db/db-lock.ts: src/db/db-lock.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is BusyRetryDatabase.op at line 283), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: runtime lock recovery, background sync hooks, engines outside the project, multi-repo git tools, mem fixes\u201D; \u201Cfix(db): replay a hot journal before opening, make edges unique, unlock respects live writers, pin the driver\u201D; \u201Cfix(db): wait for a live writer with the busy timeout, not 8 seconds (#70)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/db/db-lock.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/db-lock.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"842a5dd6a5094ccc9c9c8c7bcf0b20db62a6952059999246e9d4478f0dc55e98"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extraction/grammars.ts: src/extraction/grammars.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is grammars.loadGrammarsForLanguages at line 149), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extraction): parse Lua the same way every time\u201D; \u201Cfix(extraction): parse bash and yaml, which failed on every index and sync\u201D; \u201Cfix: bundle mainstream WASM parsers and handle crashes gracefully\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/extraction/grammars.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b25f236ec9182828707b028cbf5795b63e0af75bc8f1d8cb3ae69d84c98007"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/security/manifest/adapter.ts: src/security/manifest/adapter.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is SecurityManifestAdapter.extractAll at line 148), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(security): 1.1.1 \u2014 transitive dep scanning, Maven BOM resolution, reachability fixes\u201D; \u201Cfix(security): extend transitive-dependency scanning to all lock-based ecosystems\u201D; \u201Cfix: bundle mainstream WASM parsers and handle crashes gracefully\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/security/manifest/adapter.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b966425436ebe9ff130c2ab50c0187bee7e37574d3ee618e5b477c2f300e219"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/security/vuln/client.ts: src/security/vuln/client.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is VulnerabilityDatabaseClient.enrichDuplicateVersions at line 290), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: clear stale vuln flag on success; stop mutex leak on lock contention\u201D; \u201Cfix(security): 1.1.1 \u2014 transitive dep scanning, Maven BOM resolution, reachability fixes\u201D; \u201Cfix(security): check every distinct resolved version of a duplicated npm package\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:19:40 \u002B01:00\u0027 --until=\u00272026-11-13 10:19:40 \u002B01:00\u0027 --full-history --no-merges -- src/security/vuln/client.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/client.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bc7a40cea86bc4cc8caaba55e3265cd5ea46094243e6780de573bb93e7ea3f"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060filterDynamoDB\u0060 spells \u0060DB\u0060 where 41 names in the project spell it \u0060Db\u0060: 41 of 43 names in project kirograph spell the token \u0060Db\u0060 (41 of 43; unit: names in project kirograph containing \u0060Db\u0060). Peers: branch-manager.branchDbPath (src/core/branch-manager.ts:9); GraphDatabase.getRawDb (src/db/database.ts:164); db-lock.liveDbWriters (src/db/db-lock.ts:82); db-lock.clearStaleDbLock (src/db/db-lock.ts:90); MemoryManager.memDb (src/memory/index.ts:43). Rename to \u0060filterDynamoDb\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed2cbfe1b3ca2637d4b33b5845b7ac8838f3439c952bd72d1e5f97b0db2ebc9"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060LanceDBIndex\u0060 spells \u0060DB\u0060 where 41 names in the project spell it \u0060Db\u0060: 41 of 43 names in project kirograph spell the token \u0060Db\u0060 (41 of 43; unit: names in project kirograph containing \u0060Db\u0060). Peers: branch-manager.branchDbPath (src/core/branch-manager.ts:9); GraphDatabase.getRawDb (src/db/database.ts:164); db-lock.liveDbWriters (src/db/db-lock.ts:82); db-lock.clearStaleDbLock (src/db/db-lock.ts:90); MemoryManager.memDb (src/memory/index.ts:43). Rename to \u0060LanceDbIndex\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/lancedb-index.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30d6a63e8cd581fd75562c545951e44da8c57cd424493252da7891a1c193186"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generic test output\u0022 repeats the code it sits on: 3 of its 3 words (generic, test, output) are already in \u0060return filterGenericTest(rawOutput, level);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e820883b16b9cb76d987e0575c797debd3459975db38cd2acf10171ec40313"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find matching filter\u0022 repeats the code it sits on: 3 of its 3 words (find, matching, filter) are already in \u0060const filter = FILTERS.find(f =\u003E f.matches(command));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/index.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf036ec13c4575a0741857c0fca7bd42de1ac0024791a26bc87c146d0370f54"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if arch_file_layers table exists\u0022 repeats the code it sits on: 5 of its 6 words (arch, file, layers, table, exists) are already in \u0060const tableExists = rawDb.get(\u0022SELECT name FROM sqlite_master WHERE type=\u0027table\u0027 AND name=\u0027arch_file_layers\u0027\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20ce208aae91b0bea2b9a1113fa3e558a0c0849d450be721d8e0154815a5fec"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find source nodes that call/import these target nodes\u0022 repeats the code it sits on: 5 of its 6 words (source, nodes, call, import, target) are already in \u0060const rows = this.db.all(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a1c73b5993616042326101ba12b27171b1d2e271eb467f337f49e1150c58bc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve import path to an indexed file\u0022 repeats the code it sits on: 4 of its 5 words (resolve, import, path, file) are already in \u0060const targetFileNode = this.resolveImportPath(refName, filePath);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ac925b2934d883b7e341762b7551ceb2029fa19e7877cba8e38e0e1f382400"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Sort by merged score, return top N\u0022 repeats the code it sits on: 4 of its 5 words (sort, merged, score, return) are already in \u0060const sorted = [...merged.values()].sort((a, b) =\u003E b.score - a.score).slice(0, limit);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/queries.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c0f57970e5dd88ff7139a3c56b52374b9991a37a268d37c0d8e90f49041989"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Look for roles/name/tasks/main.yml\u0022 repeats the code it sits on: 5 of its 6 words (roles, name, tasks, main, yml) are already in \u0060const candidates = [\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/ansible.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"947a7b41c3e253a60b89865f5bef873dba95b52a525b30a5ff88672a9a80b627"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Collect qualified names from entry points and related nodes\u0022 repeats the code it sits on: 6 of its 7 words (qualified, names, entry, points, related, nodes) are already in \u0060const qualifiedNames = [\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e607feb5b28df53ce58cc511a51bec1b362b5644a7d36dd4a747c20e6208ba"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Collect qualified names from entry points\u0022 repeats the code it sits on: 4 of its 5 words (qualified, names, entry, points) are already in \u0060const qNames = ctx.entryPoints.map((n: any) =\u003E n.qualifiedName).filter(Boolean);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"205b91729c61b099acf1784847c0a9b3d0541b64c3022d322b366c6ff9484d8c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Collect file paths from context nodes\u0022 repeats the code it sits on: 4 of its 5 words (file, paths, context, nodes) are already in \u0060const contextFiles = [\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"153eed1bb48f869487039a3a812fb8a0686ab681bb0cc50c029078b722bd7cd1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for expo-module.config.json\u0022 repeats the code it sits on: 5 of its 5 words (check, expo, module, config, json) are already in \u0060if (context.fileExists(\u0027expo-module.config.json\u0027)) return true;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"242ce79ce7e8c038f14d2aabb2060572724356cf7f2b3299520a87abf4f94cdd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for NativeEventEmitter or DeviceEventEmitter usage\u0022 repeats the code it sits on: 5 of its 6 words (check, native, event, emitter, device) are already in \u0060if (content.includes(\u0027NativeEventEmitter\u0027) || content.includes(\u0027DeviceEventEmitter\u0027))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"caabc7e004c11b050d7b1f618a7fdb1597b4a74772b36a2d47d69dc987d4b1a1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for ViewManager pattern in filenames\u0022 repeats the code it sits on: 4 of its 5 words (check, view, manager, filenames) are already in \u0060if (fileName.includes(\u0027ViewManager\u0027) || fileName.includes(\u0027ComponentView\u0027))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7f10a4f48dd38b4c4aa4f8bd77089db9ac6ceb8c620a6bfeb346ddf5a7ba0e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find enclosing function/method\u0022 repeats the code it sits on: 4 of its 4 words (find, enclosing, function, method) are already in \u0060const enclosing = nodes.find(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/react-native.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8474bc5e66989515f704828c05bc020da038291fbf3fa7fce3a54632bdfe8fe5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the node for this method\u0022 repeats the code it sits on: 3 of its 3 words (find, node, method) are already in \u0060const methodNode = nodes.find(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/react-native.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4686be7f504f4081b0056e325bd7fe236674f63e4f92ec75f3684cddafd42ce"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Build selector \u2192 Swift node map\u0022 repeats the code it sits on: 4 of its 5 words (selector, swift, node, map) are already in \u0060const selectorToSwiftNode = new Map\u003Cstring, Node\u003E();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/swift-objc.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e48400272d1a41479e3fb92898c4abdaa608f823167b7580aa5745e0e6f7b7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022nodeByIdCache\u0022 repeats the code it sits on: 3 of its 3 words (node, id, cache) are already in \u0060this.nodeByIdCache.set(node.id, node);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab862695739bd9ea623d36e6ee4b0d4315aba742fe8537dd0ba65ac84eeefab7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if the entry point is in our context nodes\u0022 repeats the code it sits on: 4 of its 5 words (check, entry, point, nodes) are already in \u0060if (nodeIdSet.has(p.entryPoint))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/context-warnings.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb827142feab3be49ee64377b5f49fb365e5355412ecba3b2f93f42668a7daa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if any node on the path is in our context nodes\u0022 repeats the code it sits on: 4 of its 5 words (check, node, path, nodes) are already in \u0060if (p.path \u0026\u0026 p.path.some(nodeId =\u003E nodeIdSet.has(nodeId)))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/context-warnings.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd55b57f7456599b7877618ae920b6988b52c65a11e805089f7ce87857e65a8b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the file node for this import\u0027s file path\u0022 repeats the code it sits on: 5 of its 5 words (find, file, node, import, path) are already in \u0060const fileNodeId = this.findFileNodeId(rawDb, importNode.filePath);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b569a00b5777f3c52903c4c804fb0d0233423aec8af8035367a692322b0cdb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get all nodes in the same file\u0022 repeats the code it sits on: 3 of its 3 words (get, nodes, file) are already in \u0060const fileNodes = this.db.getNodesByFile(importNode.filePath);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"563978ee9c57fd86aee02a608f905e68aea0142f8cbfe687dfffe55dacdb0745"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Process \u0060require\u0060 (production) and \u0060require-dev\u0060 (development) sections\u0022 repeats the code it sits on: 5 of its 6 words (require, production, dev, development, sections) are already in \u0060const sections: Array\u003C{ key: string; scope: ParsedDependency[\u0027scope\u0027] }\u003E = [\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a48289fc187ad4c83a70f131958a76073698ebcc138a7d4ac5de07acbb78f8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Match all \u003Cdependency\u003E...\u003C/dependency\u003E blocks\u0022 repeats the code it sits on: 3 of its 3 words (match, dependency, blocks) are already in \u0060const dependencyBlocks = dependenciesOnlyContent.matchAll(/\u003Cdependency\u003E([\\s\\S]*?)\u003C\\/dependency\u003E/g);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"209438ab0d845ef5ad5e886e3f9a7388e384208441c1bcfd3aa52f27b0c70b7e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extract from .csproj PackageReference elements\u0022 repeats the code it sits on: 4 of its 5 words (extract, csproj, package, reference) are already in \u0060const csprojDeps = extractPackageReferences(content, relativeManifest);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35183f69901573165d478f22634699db95e19496e6a725d97d4fc83cbbe951"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Iterate over packages within the framework\u0022 repeats the code it sits on: 3 of its 3 words (iterate, packages, framework) are already in \u0060for (const [packageName, packageInfo] of Object.entries(framework as Record\u003Cstring, unknown\u003E))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0220eeea89854c1fdae96a32eb7d198d5c3356f03caef10d652689e7c3869db"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Strip inline comments and trim whitespace\u0022 repeats the code it sits on: 4 of its 5 words (strip, inline, comments, trim) are already in \u0060const line = stripInlineComment(rawLine).trim();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pip.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6429acb36cba7af3c98ce6c217e562097293965cd4caa1c54d00ff4bcfaca2ee"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Process \u0060dependencies\u0060 (production) and \u0060dev_dependencies\u0060 (development)\u0022 repeats the code it sits on: 4 of its 5 words (dependencies, production, dev, development) are already in \u0060const sections: Array\u003C{ key: string; scope: ParsedDependency[\u0027scope\u0027] }\u003E = [\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae0e4ec5e376ab9f7ba2d0072a5d53d8884aa3683f3a7c841aef14a3e65ed22"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Deduplicate by CVE ID\u0022 repeats the code it sits on: 3 of its 3 words (deduplicate, cve, id) are already in \u0060const uniqueCves = this.deduplicateByCveId(cveRecords);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/client.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a425de49285270c5b73767f2e12ee8bfa5f5e5c3b1e0d1ead86e4010705769a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create has_vulnerability edge from Dependency_Node to Vulnerability_Node\u0022 repeats the code it sits on: 4 of its 5 words (vulnerability, edge, dependency, node) are already in \u0060const edge: Edge = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/client.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4c595cce98fa903253d406a374e2ecc1d88be27c5dc96b2fd859336df4f59d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Slice a batch from the current page buffer\u0022 repeats the code it sits on: 5 of its 5 words (slice, batch, current, page, buffer) are already in \u0060const batch = pageBuffer.slice(pageBufferOffset, pageBufferOffset \u002B currentBatchSize);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"273c8ccb199b0e9df9f9bdc965e0e19f7a5ec36786196c592d60ee648443e108"}},{"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":"98778887c7ee3f900ea6a509c3c635051142a2f265cf600c718f24ae9b49ed4a"},"taxa":[{"id":"CWE-89","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":"260c5a72d6ef842fc5e9148b32748dc6eed7a28a113ad9c7aefcb002b40b3642"},"taxa":[{"id":"CWE-89","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":"cbe5480e64f105dad4c1619ec6b200d5353d0e8fa8cefcac82aaae2ff20a292a"},"taxa":[{"id":"CWE-89","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":"1230efb379bbf3849ab2d6904f35f16dd3b457415a50bd6ee254091076f43c49"},"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":"11565c4367ce28291535710c621a0b8df479a6f89100f1af207acadcb3cdcc81"},"taxa":[{"id":"CWE-89","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":"84deb8f520198adbe2b3b4b25dbdfb8f1f810eb16d08b462c388ba4d6429c85f"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"485d32f9bd53afc6bb1ee36efe3dcc54898a4b925d0105b5abe862837dd90249"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0c2e18282e16dec059e1eb67b0142fc5702e3bc2f4eac34b9a90f860b8f3d57"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ca2c5d1c97656abc334944bce2633b4ad349d5d75c1ac8e1dc87ea345fa38cb"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e407a9d7c82e58d5016beb65bd476f3469f6eec96d5396bc9247ad0c0630fdd9"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f54842601e50e3984e9f5a4c724bd5cea0f3a2bb3bf41a1c8363b885c6cb8ee"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb219a1c2e4640fe4a8658c96dd36b2684d63b35c8498fc065d35cee42002234"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21c2f1520dff57b3a92f7c4107b3b0cad0fdb65bb898c3e7bbfed9383a3b120d"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c55de1a35d8c599e3967a8d321d039820f82febc775ef8a001298c2333bfa442"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"927305615ac9c12dd3af6f53990f89e0cdd02d480db66696d2a5b5e4b6cccb50"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97b9f994f3b7105321c97ef234b9d900006ddf601a2d8a0e5ee58101767e58cf"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f28ab3c8adc211a7539b5d4db73782102bd2a669b6bccaac5437265205f9d846"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5529b2edfda9479ccdf4d24f3d3f6ed04e902c0488104a0a6b6efd263d719e80"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f71b40fdd85d52e817f6ae4c99ec38c58ec7460fe4785caac76ae1c8fab9091"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7addd8417d9ebd67022378cb5a459bb7bbece4b884a4f382e443a71b1ed7025"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"331e755076b43a5f459210d179d9bdef193c858d2d87677986e36068e8e0538b"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76d8765ee8e879095c1455dbbb10094db2c57e06501f18281e267f2e565fed9d"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdc2fe4ded0cc13f483efbd42bcfd460227bbdef55e0d19879137849d914842d"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/auth-detection-jev.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb3bdb74c45b8b2492227524ec3d2b30f030c65f0e8c7fca339c3b450c7bcb"}},{"ruleId":"C2","level":"note","message":{"text":"Thin authorization enforcement: Only 1 place(s) refuse an unauthorized caller \u2014 too few to demonstrate default-deny across handlers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1240e406e864a89e38d5e3fa370dee11971db94808c3db2fda9b41bf2e5b8efb"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [added, modified, removed] decided in 2 places: src.sync.ChangedFiles\u0027s [added, modified, removed] are judged in src.KiroGraph, src.core.pipeline.IndexPipeline \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"65cb1c8fe810837855e9cf09efc1e636c6fa369e8bbb4c1c1cfca68fa1c86629"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [endLine, kind, startLine] decided in 6 places: src.types.Node\u0027s [endLine, kind, startLine] are judged in src.resolution.bridges.android-rn, src.resolution.bridges.expo-modules, src.resolution.bridges.flutter-channel, src.resolution.bridges.native-events, src.resolution.bridges.react-native, src.resolution.bridges.turbomodules \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f3d36635f7d4c9811d60abd92e9326b2de5a2766aa6a33ef5029ac8c7f851191"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [kind, name] decided in 24 places: src.types.Node\u0027s [kind, name] are judged in src.frameworks.amplify, src.frameworks.angular, src.frameworks.cloudformation, src.frameworks.csharp, src.frameworks.docker, src.frameworks.elixir, src.frameworks.express, src.frameworks.go, src.frameworks.iac, src.frameworks.java, src.frameworks.laravel, src.frameworks.python, src.frameworks.react, src.frameworks.ruby, src.frameworks.rust, src.frameworks.scala, src.frameworks.solidity, src.frameworks.svelte, src.frameworks.swift, src.resolution.ReferenceResolver, src.resolution.bridges.android-rn, src.resolution.bridges.native-views, src.resolution.bridges.react-native, src.resolution.bridges.turbomodules \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a03e60d58b7f7dfcc90873a09b52ef9416c7f3180078c7b10594b21e9d7ce2c8"}},{"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":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 17 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2ff261796fc138338724fb1dcdf478165d67d69967f423d2bb122a930703c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 21 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"08636db96712cc82b39261219b3dfda36eb0bd5b64dc2125e598dbcfe9cfa218"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 24 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04c3f061c8975d3d369e797075f02649411c1c4432abbac90c476ff6dc288b4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/errors.ts\u0060 reports through \u0060console.*\u0060 at line 27 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e36e3f1a3f5bc310d528d0a5de41d55a6628cb248499128e9b6c37e18427ce0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/import-prompt.ts\u0060 reports through \u0060console.*\u0060 at line 62 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/import-prompt.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd29867c856d56d65f1200738ef883a6031915724600379d220e9c3bf7d4fc97"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/import-prompt.ts\u0060 reports through \u0060console.*\u0060 at line 65 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/import-prompt.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea44b05ba29155f51b485770294f284e4e5841b8dbe80c10939231d5a6550b63"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/prompt.ts\u0060 reports through \u0060console.*\u0060 at line 162 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"06da757e52ebca8c2fba3c252a5685a0c2b35b317dd74cf9838b9c8789bc909f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/hooks/prompt.ts\u0060 reports through \u0060console.*\u0060 at line 272 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0ae0b63b091c325c018e96c45e0c41ed780d3535fd9935d1f0791eb9656efb"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 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":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060test/security/mock/Mock.csproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/security/mock/Mock.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d316c72297342b7af19168796c905d0ddb8fa47ca89a18010d49a1d8a4c9a8da"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/dep-confusion.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c85bd30de6cd893e7153828d868e674c0e422bfcf489f045c175dc15cadd4df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/npm.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"36837491ca50ed488173d7edea15c8d0060b075eae18912cbed57476f92dc589"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060parse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/npm.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b404c2cce77c3dbf1c6be6ac61af0697c09e872e03f467257f9c0a5fbf4c0c1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/ocaml.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"567275ec890f942d8f1b82edb002579934b0aa32d2139860453418df0495ee92"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/affected.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afae7f0825de428ea1c56ac697be9a4e5ff847f081c1aef74cd04fc47dde97d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/bench.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3af4ddaf62b7f2963c763578da574bcd79805d18510d0d2c57678b93de0e801"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60842d516961b1e82a832d8f3ad7387c4583980480f49490a9b58510ab3ae35"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39d617f9f6f31edbff0668dbf5e72270493c837d54be0359d9ee7f679c22d2c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"363e065274624cc1cfda6b283ec56a83ce3a63bf75fd8cb342dc7d9a0cb03c26"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"40323edd85472b16ced242872b9b48712073780e703ad9624db45c3f3fa83293"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060runRepoBenchmark\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5f8bf325d41c49768b35a0dccee17ce8ce88918d666e9984f4d08ff615455c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runRepoBenchmark\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b214b336e9e7380ef402fb377dcde7650a5b5d86aa4b20d61229db08b603d881"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060runRepoBenchmark\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceac838f48efe921e9ebab22dcf5768f8771b4f46cfa4ffcce039733b5b70f9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060runRepoBenchmark\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"618e35b65ff90c0e76ebbe1ea9e7505ff3bab1f73040ec7dc1ad33a08fb873fa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060runRepoBenchmark\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/benchmark.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1b5b4a35dc26affd760df2dbd0382817a92e5c0ce88cdb1b65f47f48970d0b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc6d8997a8eb124e3053b1b8cc06df750cc9ac0c39bff89c723f7960b1f00b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"11720c0576682334f21b30c7dc741404a7429ca5f22427145eaef8a716c97ccf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fd66cf3842b16e9c02884107dcd904c0e49852309c0483a39e745ea1af22eb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"114c79ebb9c04893be2ffc153d0929a15f4dab5364a98099d0191315d044deb0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f9fb9e41a2c5098322294cea4e0bdd3bdf75ca7c47a01e3d4b3b2a3b9651fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/caveman.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9f97e0d6a150a6a6da885e3d4000d305c1671dc93b309ba50bb689b46ca240"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/compression.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7962442ea5774c4fa8aa2b8197ed0f259aedb70678b37d56d5c3474715aae7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/compression.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5c136ca59e1079369641e533bfa62ceb042cfe711350c4325cc445d0bff6e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060startQdrant\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/dashboard.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"749fa542d4e5d5c9e45dea39fe9d7f82bc342d1fb16616ab276594b55ff2ee6e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/data.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f03698b4e1a9c75efa3d17b86031ea261560bbf719b7e0f0219083fee6f46e2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/data.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb10b0aa10f3e8ebb66ea7e0a058e0641454af633e99e3149cf566342c1089c3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"98384ee170d7cc886960d1996a2ccb8df40f796227dc1af4cf56b5d91db1691d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b711a25202068e24b7d93827446b4df741afb8ecbf22bc05f1e7b1ba9f4c5a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7899c9cab1a951fad40c6ef38fa8c1cd745a2b69df69ab6a2d1c1eaea2f9a87"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"517e01e350abb0d0e29be3b76bc00b816f58a4d40ab41533181a42768147ffe2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"010745cc92e848ad228a08e01031f7a0e6babf98d786616362bde39e644da31b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd24c0c93940a39fe96caa57c010e92ee3fe4afba20ab38e9fde901e7ead832"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaacb034a2b0d6b7c8f4d5ecf2c22511202587346d6f0312652cb5d09800bfb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4287e7d4aeb32e8b786a6d2f50a1c2c363a1f4b7fe897974d7ad0f99007369"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.accessSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f45df49c6f9c79e338025836b5734dc28e098ea6ef3b07cc7b4695675cba03"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a71b1350b406472dc95a906a207ebc6a0843605d6a2f3a6cc0b5a0aeafc3cb7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"686fcb3d5f3d775353c0d1184c770814d3fc77977cc2128af1463e7ce5516fdd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"80778eba136415d2d6bd7feaa199d371faa6eddaebca276a46bc0abaf03f4c8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"042cd1c31f86b0f10529ac30bdcf22201f87e7d294c6cc6a08e19cfeb40d71c9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6751f059afaf00c5b519f2bb6fe1e3db7a094ca04133d8a47028de880b696678"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77f9d6b08a63dd7af96a4d5609fb441cccef748a098620e6867fbbebd8b61ab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc33cfaab4adf8be24fba7814abb8e5c2eb9cb60267bdc406dca2f4e63425d4d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/doctor.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"39584d5c29b5c310fd2796a1daa7cd7183a2475fa71f04390984604b315584f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/exec.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3264e40d7984b6a9bd3df7aa4aea6644054c641cf3c1772a4228e5f09fa31f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060generateExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf48671776046b0572381af1d892753474afcc731538ec18f3a1e98da030933a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060generateExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e39680afb0e308852f5976b0ddbde09f8d2f2224c6ca6731c559ae2a338a485"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060generateExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a92db1c81a668a1ec728946a694a5b7ec5c635f07f857e736f7b9e0c3a9347"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060generateExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b843416fb68db5957c1d38c1e7c26cd05ad11255931d0d3bdcfdb43a518eb990"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060generateExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95a950efc857704a6d4c15bf6a679dfcd08dfc23921f91284f619d7f8779f6a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060generateExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"91adc6133ec02e72da0cd110559437b3bbfd8dec388d2653cbc9ed3596239776"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060generateExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0de1b97ecbb1e665c51d2511bcfb8dbddd3701abc735d2d519577304bdc662"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e240fb6bdb26371eebb278ebd2b0a6e486712ead0837853a05ef6d2bc25f715"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa1c078055e5a3dea832a96d266ffd4a80ea6f1dc8c87aea52198bbfde6ba9b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"60408dc3fd1745b99edfcd6ec5e483d0080caa7966031e3f465c62751326a92f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e9530f39a181b68eb7fbd33c9cafad6476caaaa851e251b41de3df50f90a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":2953}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efe595d6d4ccd33e6ec17ac1f1fb93064cb0934b13bcd9175cd1667e5f68bda"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/export.ts"},"region":{"startLine":3008}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea53728556d2003f3895773d178e783cdd1e6fb3beb13d354371b23a6e782aa6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/manifest.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"089218aee2f5b7b4ba298a938e672a4c7a9eead4f5c2865c6b987e4aa5849bc4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/manifest.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"232daac699d43350e036c0f424af5ad936edd6bbf10240a3670ba12cd7d2618d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/manifest.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab8149d4142a54c9cbe7ed53a06852b2fc8d2ccbc722fdc406d16a446b284cf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/memory.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a0cc3e98137f30664af23fd99c358e69b0706cd6ac474caa6c5ef1c3946976"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/memory.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5659db3811da7a65723a5f1cf9629f48afe650f8afb23a8a189da7a27139f822"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/memory.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbf88f993a1ddee7138ed56fee0e470d615cadbf2ec8c2010a963f0e02d81c7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"40664461c0da9d473a26bdbb859eb045eedc7120121233ddf89dd2305500517b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58a4d5c9ffe70538b246b1142835fe2572fd91e5ff6edcad34a640550812317"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eb3b0ee6c4a725de2573b2861dedc4de46c0f661d44a439df1184737d4269c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to fs.watch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8781131b6258601705ec276ef974afb3e649fceea560c1abe664569c6eeb13d6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060callback to fs.watch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0cffe746a8b78fdf9ac7acd7379d573586ecdd4402e9fc468626d503e3f633"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readSync\u0060 in \u0060callback to fs.watch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7d51c8806b51153cf71bde8d54fb6dc44c1f6889c926c59ee825051c8dd18c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060callback to fs.watch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/monitor.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"eded8820e1b2fe16540665acdbd20b17d79f985380a42851eabe0d86c065ab32"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e181515289b77b57d1da5a806c7d2a3fc0d13070259984c534dd90708000337"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"0317a3ee9a60f7d4380acfc21637c40a0d843578b2d3cfc88696a83c996ba1e4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bad3f37087d930ff475a7a83dde8c6d5289c00b0c9d9ceb00d2587b2d8b422"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5414aa534ec26d8c64f6c0935112daf1be7e9955e1e2e9ed597de304cc3117"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f088416260da074b77e588c2176d75ef52ed50d45414571b7833ff533024bdaf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6da68714a2b03cad8d143f8a03c16a966ed6225a31f57cf6f3e97ff60027e39"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/pattern.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dfa98245f4c66ee7145739c9c52f83f0fae50d08cf43dfadec283b5036964b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/read.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff30faa66c26c8c5180e50aa71b34219cb93c669924a93a4cacfb3b7623ec21"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/sbom.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecee15da42af660eba3ee295492d2c5fe1a3f7c5b0e007405a9fb2181c1052ac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/sbom.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5582fc46f70dcb8eb56496231c588f9d95987c67c6081789a3dfc80a2a1868b0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-ci-report.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5211c92116f2931525f59b9cca03fb731a7e4eee28574e1a1dd8df2c143df6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-ci-report.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcb44633caac7040956a2755ee309eca1ce742514ca7f5481c5bdcaa2da13c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-export.ts"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"121486bc27ba56b5c274362c320ef97fb90192904c9cf519d39cf16588ff95d4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/security-export.ts"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"5319e47058eafb0da5b3887eaca250309c9ad44ea8f2ef071bc6b2ebdb864894"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060isConfigured\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/status.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4c92a1a6e0ceebce6b90561fe8aa8aa7f38d980aa5b35f762a1175e015bce0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/sync-if-dirty.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bf50bcce8e9fc587ba8c6c057f843ff6adca679dcd9033f287c5d9d4f832a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060runUninit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/uninit.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"35692b1807a725171b43d25e9eeb49069a13cc9cc23aa31cededff8465a2b123"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runUninit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/uninit.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eb840bed4098a52422fd7e1b1c3a1a8a580a2d9b79c945b9ead264db79e0f7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/unlock.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb28f80e6c5e1f7bb7ba1ac65fc527d1056364b26d1c217b0e4ce1a1114d278"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/unlock.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d502dbf3ec7c72a5bd4522a416321358be00d6f4b7a60cdf668edf91b33aba77"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/unlock.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"359f546ba7bc4c4ddeb83cb387848a31541a8f676fd1e4422da03ab9a418c359"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/unlock.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51e78eaae1beb974131c1ce0ffb2a29373dd769d4b040d80b4cbe0a8ac574bf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/unlock.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bffdfac43dc76bc8f589fb8aa3ddf9c103fea93741b11ed323c2f0217ea7ec3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/vex.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"222faf11be1cb903009c0e5e72d460f4ec4002436b67d4ed403dc00983c63c73"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/vex.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"988a05f67747ad002c0be9aa0728c30ff035fafca8c7c105061f5132ea5b7af0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/wiki.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdbd6eebeb98a38ba80394585008c776389bfc21f6fc0f644173ea7e6475f25"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/wiki.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fbd8f1f34b24fea776597b9826a02ac13c8075f05eb672be65119c03f92858"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/wiki.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"337037d16c8b4a7051d2e8b2a197b8c8e8c43150ada832d00838075d8d4d7611"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/wiki.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb22ae85984ec2b25a1054856874046bc6586af89b7cdd69124b1ec9c736dc7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060extractBinaryFromTarGz\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/archive.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a0aa17d91e2069c0afcdfeebbf83b3193d918d39e68a52935187629a15b8d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060extractBinaryFromTarGz\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/archive.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"181a69536c9a2663d240455f59616b16127488f38ae71eaf8510b7acb66bbe8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060extractBinaryFromTarGz\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/archive.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beef12692912ffaa63be995094b10b8f7c0e806d7a2ab986745f25678df1bc4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060openTypesenseDashboard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/dashboard.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9c269fc9939538ffda1cec4bf98be57667099ef0a74224820cace25dbd2a8d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060openTypesenseDashboard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/dashboard.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd425b691500b76fab34b6d89d792602d6c584b4a6bd67f48f58d8991d235da"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060runInstaller\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/index.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a5e14aa480b64e46500799cc0e9e1eaedceffdb18b1f14dfb747648162dc74"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060downloadQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3fa462cf400d265091fc512e695352a891cd4025f6b3c7fd2348e30325a02f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060downloadQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fad829ee255d37d1c4ca0aba5793fd40623dc068b174f8736a25996657a6eab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060downloadQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"56186bba69d966921b6621c2e79d61420e3c785011f4989b3a9a4ba79050fd24"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060downloadQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c2dee631620c51570806b568ceaaa32393fc1097f28cc57e1ee0bcae305d18"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060downloadQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3f6efb9771d0e8ce19b800b0a9a1b8746998c6c6a045ec3aa53a8ec7aedc93"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060downloadQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea848c91f4a175fa44eabf93ad79855f4ab72287d8e9fcc13b1c103b6aa85397"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060downloadQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc69f14ad1ecc8954bb14073558762e46a86caa9cc02d3cdc9d7716647733855"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060ensureQdrantUI\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8117d6b111872c2f6e8051573dd5271a258efbeb610d05cdbac1d16486209569"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060openQdrantDashboard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/qdrant-dashboard.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fc03494698c93cc6302b1bba75035fd8e23b7ed65b9469b6297811ca9ee404"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060loadConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a479df51e72981413f1d909993f2ed80002b6ed2728017017928e793198494"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060syncNow\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9925e7c2a3255ebbbba114048d786d3e6fde887f0eaeacbd9087d72a21fc0f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060indexFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/indexer.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7102b20114c0d8f7cc61bb4e5f8da50c0189cd53ba4dd3c638022c421bf890e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060indexFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/indexer.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d804d344752ca8773995afe42825f220e76333519a9109ed22901228a50f37cb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060indexFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/indexer.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6209b9ed84d9f137f65719b262046d98f50a4b0252a2641b71dba7c57f8ba5d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060parse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/pdf.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"495ec8072f9a6301ac7c347af4ba03a14fca5b998dfa6eef874927372456cd16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060indexFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/indexer.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4ab41f4822b05eb3f624600c86499633d58abd1659b9777323d118f7008db2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060indexFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/indexer.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1734c270f5309716dab8dbe30ee7ebe62fc4f8fe6f6e7e785eadb12a7acb80ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060indexFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/indexer.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c95da186aa436e140132a281824132bb0cc474ac8864f1e3db61dfe1a8dc13f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060extractFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e86687d5d633a147afc7de82181adc5b0116215e77ae70f0c7ad56b00ff3ab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to grammarLoadChain.then\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d568ab7b9913cbc86bc38ce9c47e810ec51c4919d6fe2b546cbc1deb1f6a85f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060extractNotebook\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/notebook.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6530109b2eec46e2656caa8a82d8eca2650ea1508df31ff87561cb8b4480bd5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060detectFromPackageJson\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b429e94f7f7c7501c240e48e27eafb15e069651366d17bba59e0ae118c03fb7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060detectFromPackageJson\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e72a69a0749b0dbf166295ab61ff8190987caa81706c9380594e8d28db0963c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060init\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9989c3ae2b6f6aa7e8bfc5d13ffc09f3ee1ca2402f9f4ea06709e6a3d0aa144e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060open\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc39b5a0cdc1950ab3138178e8a0d6d136d48a682f4d816824d02f655f66be53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060dispatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36753285e8e793cf0384ca582ad8643be4dbac25274df7c9a657027d0a8eb98"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b235f51f0ae9afab54b4f928efc4298161b85fc54af2eb54ffe4147458696d5c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba067cfc9438699b1a2ce7a8a9fc4fe557bdc68d2254d6c5b2beae1d9309cb8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleArchitecture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c13cc938ad8f7f8d152ba64169e430ee95891f87490c9819c2f546893024831"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleArchitecture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f0721ee393b6c5fcb79566fdd1fc424430d5653dd6478f5c993d88631ccbeb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleArchitecture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b1a87558dce80b240eb5effcf2ab12ea0eea2055452e7d4e768ef392fb4524"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleBranch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2deb52ddd1ad4f0a83835c70e0103636a491c53b28a0e30c80fa0d63f51173"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleBranch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95435813ba48dc08e0462ace0ecd0f57ae3dc585a5a6cd95b1b1e23a77342f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleBranch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fe930bef5ea1222b4d494a1b2207402e684f9472fd892efb345514d577deba"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeAndSync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2311c6c5492d1c89f754b35c7687cd604278e0164517a1cd646d81fd11e6b375"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060handleEditPrimitives\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c673cba3f69a2c3caad3b2edc0496510ca656b4364b2976832e424f86e4160"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060handleEditPrimitives\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5793efe2124ab6a6d81c7a7578900ba39c2b393f839c21766f1fd9fd1f2b92fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleEditPrimitives\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"373e30880246fd5284e628dba212b76a13acb48a2c49bfc379613db09dab52cb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleGitContext\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fef660089bd28dd45c5e383c84326ab242cefbf4368abad70b1d9633f819c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleGitContext\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e1c811e3530f26a212f90604dadbd76d9af20ad141d2b338ea4b5548415013"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handlePatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c297c25f32134c7843ad1e5eba308bfa748d2698830e19a2f1d1f6b6571cb3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handlePatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc46f1f99356c1006e7e91ecd7b9dcceceb4c04a2ce6e0b5c5ce079e3c2810f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060handlePatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d9c03e35b5bce48aa3aee2619171954b43028fb2cff68c34f0a5d10a5a833f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060handlePatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"878edba01003a9c2e2fd8f081a41d95e29efa92e5169ae2926520a942b7e7dac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handlePatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"414da2884418133debfbee09812b57668b692380ed613d8e90537af4e16d7e86"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handlePatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02a947a22abff4f2a2b2ad6108ac515cc149376eb4472cb042c9ed1c2d0dc15"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060indexFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/indexer.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec28fce279c95523141cbe4672bed87255bee4d21473711c46e75a3f55d228c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f802ada214c46b529b3e6091e1845ebfd93396553fdcf9f68b94460776c2a00"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseCargoManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"035a1063bcc0cc4430dc97babed9298cb9f86b2fbe3596784546a4c93ccaf9f0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseComposerManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3589d8e3e1978fda176c13bced681d778e8218f2960a02fee95c09163ba6ed7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseGoManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/go.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a98df760ce9849a4cf8fb03c6a3c995f69272f9df553c06172cbac3c24bd9ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseGradleManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/gradle.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baeff9a1759f3ea36e4b73c6400508260aa0274c484f69215ab59680f8308e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseHexManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/hex.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"65efa823eaa815ecafa049e0d1271b8d288fd62a854724ed83f85a118e0cb2f7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseMavenManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f042dedc1c7d56eb518871cdeea166e6238b0a8be2b60a6f2eaabb6c4504858"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseMavenManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"677e5fd0b55e031944422026be7c214a5fc938daa21d07e725f34e6bd59c8e23"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseNpmManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eac7acde8c0a9c217cc4fd8d873fdec16596d2f906172ca3a6aee99bd98640"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060parseNpmManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d213132386a0af439c4f0c0775c2b92a1ad88e260e23c2f9174f964904da69"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseNugetManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dda2fb8c4e409d762c2af667e017c60fec038ffb9c1e116560a531bb8d58e54"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060parseNugetManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31367bd01d190eaf79015ccfb68e580ee02c0cd374f2f570cf5f9164813e7b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseNugetManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f5d152393201a41e7405f375efae7185ad0e2bbd40d91c16002a82f40b61ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parsePipManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pip.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1059fe3def1fb05783c954a0778b5570001270d917b9e1f5969542d440ed6d7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parsePubspecManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa39098199d1a228712f416312d3d68fc560218da51992d5ae388f3871271e3f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parsePyprojectManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3415a465cb0c335b7326a80a529d6a9dd21aa2a53b91d5c99e802b20f9bf94"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseRubygemsManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/rubygems.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9bd8c2098431ed43a03478946dad334afec2f4495632e3d504c80a091d2b9c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060parseSwiftManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/swift.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c138c522c3567c1a7ab67719398f9089b0129b3122ce9c212895dd19d1f952"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060scan\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/secrets.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f03521bdd4fdbf93b19ec284d0a5c0ebd2467252856f3c8c68df13eb2731668"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060scanDirectory\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e08c066c6aebbce80786ef7546d44c3a77bfe7977cbee6d808d7c7cb3ab714"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060getChangedFiles\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae006baa8287677ba9c05c4ac51e956204fef119c4cb7684643b579c26ac261"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060getChangedFiles\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bd551651b09380de6720f29b03bada94239a9b3a3d7d6024abdae77c16b57a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060serveSync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/remote.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75e78e243c0e169af9b382c021310a638627dc5a8ca42639c0b288abfffc98f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060serveSync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/remote.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ad9b7b0220b3171f2090e50015b2260389b6935cbb453ad4b2a59eeeeea0ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/remote.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca7c72ac88323ffb0ef132365d2f7af8b8ce07fc1582a8603a744d7a58b68fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b81cf71c9221e4b46ef6aa9113c233f408c4a50cb2c81a8fec0b72d08fdc52"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bca671c7826be7ec75fafa7e7bd4469f20719beba413d90ba22f35392693c1f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d40d55310ff6171811bebd2a835f2772ae20ebc1e56c449d4e58520fa0dc385"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ace982cd425fba8b3eec2129a4bf440453be6e29aa1e22918e6931ed9209bb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce05ceb54c610ef0b24fc877a4f1dc76f38987fca6c9297090a028631fb2c75"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f57e7e326e566955e439ba3e3efe2a2f7744e486e8edada6776ad4263c3d27"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2f8b27827aaa8081ad5e7f1326c627ceaa0be2c2c4020bf28477fe8dbdc43d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f359094cce714c81ec6be8668536a135a2b6097d48a55d1081cfbb2454a2fdd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fc75e746497a51e6b422e6940eae603d922f8fbbb9c15ed4b5c31f5bac9f88"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce264280d4487015db279fd05c70478f2ea269c0b6594db8103b82c97b6d07b4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2416f51b6d7c08c1eea1e159fe08146eeecb6915624762d5a4bec9ba3a7b497d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1303648b391cfff4cdffd256388881a50f3f1c3fd1869523661bae614c1c4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9b4ed5e6503e2110a6127e218f99bc89ba6ff675734e6f2547da35f5f39e50"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4064d6524e318d52843290609300ae1fd5e9ef0196327cd152e2b3af1a6ae963"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cd887eb8aff47be0a93fbec28c6a8f7318f90ea19c16b3cd288f252f57adfc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61a540a51e6a54dc79e1ac029473d428414a7766429aeb3bf4a22b29b59e6f6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a674c4c17286bed941cea7c6bde685344ace9fe238553a2779217ed5297aa5b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedca9e00e4c1cdcccff5c158f28036919ed7f738435fbba5ecde0fd8747551"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe5dd1a2d295e1cf6836a766dab9f1535c0a37807121d240ab1062004f92c88"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060downloadBinary\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ea4bb6ba1ce557ad174cbea4dde0e4b9711125ad06cb4196170c25497bb3b5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4a705e3080dd8da1e0c1aa31d512f09850399830de642ac255815f86e5e86e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ed1e193df656ffa3a18b40131f7f2d1026aa2d5794141a811c080504682f93"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060initialize\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5331f0f0d382aad02b203a73d287daeea4cebf6ffc7909a870d2fda3d3bfef7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060getGenPipeline\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/synthesize.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dada2cd4abc3dcb9e94d6bb92cce6d5ebb4c0608e4cd12b03816a96a21b67d81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 14 sibling directories (27 clone groups): 27 duplicated blocks under src/ have copies in at least two of the sibling directories architecture, data, db, frameworks, graph, mcp (\u002B8 more sibling(s) not listed) \u2014 14 of them are reported below, and 13 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 27 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 27 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 27 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/index.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad1efc1cfe1dc9280295df24feefb6301551404320d30766694bd8920ef9787"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (161 matched lines \u00D7 2 locations): src/vectors/qdrant-index.ts:59 \u00B7 src/vectors/typesense-index.ts:103 \u2014 the two spans are one implementation copied and then locally edited \u2014 1114 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a65331f13449d5edd59517178d0d196e55943bd495c331dcba7df913fa4956"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (93 matched lines \u00D7 2 locations): src/vectors/turboquant-index.ts:88 \u00B7 src/vectors/turbovec-index.ts:38 \u2014 the two spans are one implementation copied and then locally edited \u2014 688 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2fe0f7e52e5a4c4fa274f5e609015cf75a77faee46a2990c83cd08a5c48502"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (79 matched lines \u00D7 2 locations): src/resolution/bridges/native-events.ts:15 \u00B7 src/resolution/bridges/react-native.ts:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 617 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"496d9798397684c46162574170955d404715c389bbbfaedb6491cb6265df9146"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (69 matched lines \u00D7 2 locations): src/vectors/lancedb-index.ts:33 \u00B7 src/vectors/pglite-index.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 464 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/lancedb-index.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6a8d829099099b0fda13d77ac8f84298ffa28f429608f1c0e1723a1e1c79d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): src/security/manifest/plugins/pubspec.ts:72 \u00B7 src/security/manifest/plugins/rubygems.ts:95 \u2014 the two spans are one implementation copied and then locally edited \u2014 345 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"176ced5599b5701ef78990ce966f3f92539e15625514742665ac35a1cb473d70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (55 matched lines \u00D7 2 locations): src/jev/client.ts:12 \u00B7 src/jev/strands-client.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 378 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jev/client.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46e0625885b87145e783feb4712ff95e21bf2599209c52cc78e83caffe78b84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): src/security/manifest/plugins/composer.ts:50 \u00B7 src/security/manifest/plugins/pubspec.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 315 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e469f6df3565dde542c7795abc6f956da0d7623f92d923780c7e3b5a6f29a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): src/extraction/extractor.ts:888 \u00B7 src/extraction/notebook.ts:310 \u2014 the two spans are one implementation copied and then locally edited \u2014 405 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"52287e5e3f8ea1d6da4603ff11392d8da355ffa685da9ead6cac29c3aa1b0ed9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): src/hooks/prompt.ts:125 \u00B7 src/hooks/prompt.ts:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 381 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"432c58ff334b89f0e494b7caa82effe3f7ef355acb1e2ff03b61ff010cbd6878"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): src/extraction/extractor.ts:1065 \u00B7 src/extraction/notebook.ts:351 \u2014 the two spans are one implementation copied and then locally edited \u2014 352 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fd4e27cf0f4ac1e52c3ab66ca07ae6ca362abce8cc475fefe129ea8815be78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): src/resolution/bridges/android-rn.ts:231 \u00B7 src/resolution/bridges/flutter-channel.ts:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 292 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed7c5c3c15f82aa0920eacfbe968877f4d732c2ff56e7e77112f4c77bd35025"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): src/config.ts:567 \u00B7 src/config.ts:642 \u2014 the two spans are one implementation copied and then locally edited \u2014 362 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6796bc46aa81f5a3a9dcae27111e44e9284bccb5cc2aa478a0ced7eff82dd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): src/resolution/bridges/flutter-channel.ts:407 \u00B7 src/resolution/bridges/flutter-channel.ts:453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc6c9f365d3b2afa42030b5fe7260527e5ed43363049a1622e6131879ca3e7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): src/frameworks/python.ts:85 \u00B7 src/frameworks/swift.ts:79 \u2014 the two spans are one implementation copied and then locally edited \u2014 331 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/python.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f02e21aa73256188edfdce6a89c040c7a2e86a28843376ed72fab8874849262"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): src/sync/git-head.ts:17 \u00B7 src/sync/state.ts:92 \u2014 the two spans are one implementation copied and then locally edited \u2014 242 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/git-head.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"204da7d6ba79499782896737eb3133d707cb39381467278a6ecb497c2b9a6045"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 11 locations): src/architecture/layers/csharp.ts:34 \u00B7 src/architecture/layers/elixir.ts:50 \u00B7 src/architecture/layers/go.ts:55 \u00B7 src/architecture/layers/java.ts:57 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 11 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/csharp.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d492557df449aa7f1f54dcefed61eaa1600344f2ad9c79e9e80c263551467965"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): src/resolution/bridges/android-rn.ts:343 \u00B7 src/resolution/bridges/react-native.ts:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 184 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1674509057921d2678ab07cb95fd758b90eec515d4b62c02223c0c905e792f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): src/core/pipeline.ts:403 \u00B7 src/core/pipeline.ts:775 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84be9710df5b8f0755e38438f6dcd55fc4894a0f390a169eeedf0fa0c623358"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): src/frameworks/csharp.ts:34 \u00B7 src/frameworks/java.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 295 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/csharp.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"113f892935409e660914db20b2c70ea6dec46bbb0fad3b2f85988ca5c2726c6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): src/security/staleness.ts:28 \u00B7 src/security/supply-chain.ts:31 \u2014 the two spans are one implementation copied and then locally edited \u2014 242 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/staleness.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"504e0a45c973183fddc9eb53db7bdc991b7b29114cb5339e4b3c31b0c44783d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): src/frameworks/go.ts:37 \u00B7 src/frameworks/rust.ts:34 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/go.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0e40016cbed96ffd30585592b9a099a466f7ec11aa3fcd25d8b65fea8e6bd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/core/pipeline.ts:266 \u00B7 src/core/pipeline.ts:677 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b653a866e2b0d5075f2d00fdf6ce4c1c464a241bf791957d1c178ed8aec6a09e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/security/manifest/plugins/hex.ts:73 \u00B7 src/security/manifest/plugins/nuget.ts:105 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/hex.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b732f988632037834c4528708c6bcf4881303a469d23d7837b0195e2c37fe9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/security/export/serialization.ts:160 \u00B7 src/security/export/serialization.ts:186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/serialization.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"447721ca3678cfaae3ffe677c92d0cd8fd8a9e4914b40e08fee80a62d5ce20eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/security/manifest/plugins/composer.ts:93 \u00B7 src/security/manifest/plugins/pyproject.ts:83 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9da698488c2ace1d3bb5b099fff429bf7de5f76ef98b416d7a3d5ee26fd687"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/architecture/layers/dart.ts:63 \u00B7 src/architecture/layers/typescript.ts:91 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/dart.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"de50b9069f6fac33ea300a5cbb431f5e1cd260270b973e700fdb521c162f2af2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/data/parsers/json-array.ts:43 \u00B7 src/data/parsers/jsonl.ts:32 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/json-array.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"641c1b876b2b45fe0ad6f80bb06a6b08188c301215613513e220e84585725e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/mcp/read-modes.ts:272 \u00B7 src/mcp/read-modes.ts:313 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ce2e98db5cb7743e65adb268a700579310ca1d5bd226c5f05cf2255547f0c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/resolution/bridges/flutter-channel.ts:304 \u00B7 src/resolution/bridges/flutter-channel.ts:328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce036a11c637b4b88f23cd6f11d2c07bd8ee70f03c05178544ff93c2b81ed635"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/frameworks/flutter.ts:63 \u00B7 src/frameworks/flutter.ts:88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/flutter.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b461e804b93b2f666ff59bd36fccd30b7c1ae94bcb8053b2568f2baebfac508b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/resolution/bridges/flutter-channel.ts:262 \u00B7 src/resolution/bridges/flutter-channel.ts:347 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b486a75025589d8f2058eecc2d3479d4a17a4e1dec79da7208f4e9bd97057a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/security/manifest/plugins/cargo.ts:279 \u00B7 src/security/manifest/plugins/pubspec.ts:244 \u00B7 src/security/manifest/plugins/rubygems.ts:199 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73319fc1e42a36f9ef1a5a70eafc8eb073ce2a37bfc09a1e5f14553b3d787b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/compression/filters/aws.ts:146 \u00B7 src/compression/filters/generic.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"492b631b2d3c0783f6269c2af5879ae0bae8b1dc3b968c452ac2b78113c67435"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/compression/filters/files.ts:105 \u00B7 src/compression/filters/misc.ts:53 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b692c94cd1bd972258e2263d9516be1a293950cddc09629c7bd4d3974bac6444"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/frameworks/cloudformation.ts:73 \u00B7 src/frameworks/docker.ts:52 \u00B7 src/frameworks/docker.ts:72 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/cloudformation.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e369ac98a49b32e74ad09808718bd6816063279e6d95a2554278cba310dbe83a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/frameworks/index.ts:166 \u00B7 src/frameworks/index.ts:195 \u2014 the two spans are one implementation copied and then locally edited \u2014 191 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e97ed261f637732648d78c582637dcbb9ec880f98bdf846b5ddaca2807e8a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/mcp/read-modes.ts:90 \u00B7 src/mcp/read-modes.ts:148 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"238c0194cf585bd1bd9ae7e60be65e9d268d65d28d25e0db99f4822ad797a20d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/resolution/bridges/flutter-channel.ts:147 \u00B7 src/resolution/bridges/flutter-channel.ts:172 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c99c907c9046151800a93da8eadd11c343b90698738d90a0625b8a8d4aaef4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/resolution/bridges/native-events.ts:225 \u00B7 src/resolution/bridges/native-views.ts:285 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"694bff9ffa647cd99880c85d38fd776751a6bdce435937104498b3fac3c3e53a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/security/manifest/plugins/gradle.ts:200 \u00B7 src/security/manifest/plugins/hex.ts:228 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/gradle.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"446e03ea69a77039c4eccb3fc88738d561b90e85dcb8bd338c57dd8e39331d54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/security/manifest/plugins/nuget.ts:25 \u00B7 src/security/manifest/plugins/rubygems.ts:22 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ced6ded0ec948940046a1c71787f9b0b0b10a33e8773b1d554737667b36bdc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/architecture/index.ts:117 \u00B7 src/architecture/index.ts:144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/index.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1291ee592046112abebdfa145cd5fd0c2979b48e225a44e3fe02504f24b151"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/compression/filters/git.ts:174 \u00B7 src/compression/filters/misc.ts:109 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a219e43752ca06d137fa3004f394fdc8ab2dbf2b7e6c1df32ae68622805e2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/compression/filters/github.ts:25 \u00B7 src/compression/filters/github.ts:88 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/github.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8023c704c09b1be28d76329e042ae4ac9e39e3fa8aff07c0b6657fcd07ff01b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/data/parsers/excel.ts:63 \u00B7 src/data/parsers/parquet.ts:66 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/excel.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7623b7cd389e5587ba2bd1adc17fd22f1280f3ee3faa3d5bc17a320c0b7c86d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/patterns/runner.ts:137 \u00B7 src/patterns/runner.ts:183 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/runner.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a17467ec5474bdb0caae04e80428aaea2a697f9945fe92ad3613c964424b67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/resolution/bridges/react-native.ts:77 \u00B7 src/resolution/bridges/react-native.ts:134 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/react-native.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf34a9a937bd94249ad249187d2f824839dfe18c859e4dd087b6dc9cc2e1674"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): src/security/manifest/plugins/cargo.ts:25 \u00B7 src/security/manifest/plugins/nuget.ts:25 \u00B7 src/security/manifest/plugins/pubspec.ts:24 \u00B7 src/security/manifest/plugins/rubygems.ts:22 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca0ceb438623728a710f624458b46c1fad57a6071a9a9465f5e1a324bb027c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/architecture/manifest/csproj.ts:27 \u00B7 src/architecture/manifest/maven.ts:27 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/csproj.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aab6f43e71ef0efa7b5e92428140f0edf1f7f5562d9673e7c433a65e249759"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/compression/filters/aws.ts:150 \u00B7 src/compression/filters/docker.ts:141 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8655d3e84359a2fe218e2a77cd1e5b0802e2d1b8477ebc653126685113c71039"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/compression/filters/misc.ts:206 \u00B7 src/compression/filters/test.ts:115 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bd911ad96d1f0af588ff2d2472b72e73f2a1b5440848ba72eebfe92ca56ccd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/compression/filters/test.ts:63 \u00B7 src/compression/filters/test.ts:160 \u00B7 src/compression/filters/test.ts:202 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5698b4e9e14dc9699fac22ac4f3a424a24a78b23e5e5eb0c3c8767ceb5c8d33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/frameworks/ruby.ts:71 \u00B7 src/frameworks/ruby.ts:88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/ruby.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58624522b03ad874d51fcfdc0609f497b1ddd50f44b991ad7e494057c3a08c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/security/manifest/plugins/go.ts:29 \u00B7 src/security/manifest/plugins/gradle.ts:60 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/go.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae2291201512ad489f379594e30faedcc29eddddce6313d41dac5859fcc6f3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/security/manifest/plugins/npm.ts:197 \u00B7 src/security/manifest/plugins/npm.ts:355 \u2014 the two spans are one implementation copied and then locally edited \u2014 158 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d667eb7c6bce31d21118677faa94055cbcab274771badb5188ebcda52faa85b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/compression/filters/test.ts:96 \u00B7 src/compression/filters/test.ts:141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf53f0dd4580c0f5cee4710404da22f41d98d9e00960496abffa5f2f6f830e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/compression/filters/test.ts:223 \u00B7 src/compression/filters/test.ts:246 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"580f4b2a8b689156e103f99c2de2c8c01da0e017c39bda6340ed7bcbae195fc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): src/frameworks/elixir.ts:96 \u00B7 src/frameworks/ruby.ts:73 \u00B7 src/frameworks/ruby.ts:90 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/elixir.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"45850b6c9652d8a8b3fcd83cc5400906ae946b8cd177dc408fab538d8ebf52f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/frameworks/iac.ts:87 \u00B7 src/frameworks/pulumi.ts:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f10462da94e628595e9ffe05d35fb48c058559ea85f2b8a26d2a371df9abd0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/mcp/handlers/code-health.ts:180 \u00B7 src/mcp/handlers/code-health.ts:409 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f4785821c29d096d363e724309dc957bce1525e4d31c987eb374cbce177d89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/resolution/bridges/expo-modules.ts:92 \u00B7 src/resolution/bridges/native-events.ts:25 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a8a9bccb4997be2443325c756c4d8652b00154a3aa486c2170dfb311061519"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/pipeline.ts:249 \u00B7 src/core/pipeline.ts:326 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"be64721a9381b97d9c442dd86769cf14ba10109f98423bdc0986d3674ff24938"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/db/database.ts:744 \u00B7 src/resolution/index.ts:528 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3c5781e77737a94fc96b72ff0459cd3c87ee22081b6eca0af99780d7704bb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/frameworks/angular.ts:57 \u00B7 src/frameworks/elixir.ts:27 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/angular.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9019c95a99a2226e177381f718e86701239cbe535ec8173b2ea3d918acc040"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/mcp/handlers/data.ts:282 \u00B7 src/mcp/handlers/data.ts:303 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0314f20dec8fac00c6c3890ae52e2cb60a1a535e3c3af1ee10626d47327de1d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolution/bridges/swift-objc.ts:205 \u00B7 src/resolution/bridges/swift-objc.ts:259 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/swift-objc.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b6856c6cb8fefcbad3943543b2b416efc49b201d0b2cdc64c4e81c5e68851c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): src/security/manifest/plugins/composer.ts:21 \u00B7 src/security/manifest/plugins/hex.ts:24 \u00B7 src/security/manifest/plugins/nuget.ts:25 \u00B7 src/security/manifest/plugins/pubspec.ts:24 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8585e03d77eadd37daa233c16f6d5ba16d1205e6efb11117478156610976a118"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/security/manifest/plugins/pip.ts:35 \u00B7 src/security/manifest/plugins/pyproject.ts:20 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pip.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d88ef38722d9d23c3b5a2c7dc1b73934c5844340d3bcdc3b9eb015a40e7fda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/security/manifest/plugins/pyproject.ts:59 \u00B7 src/security/manifest/plugins/pyproject.ts:76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"886b30c8dfea5a2d611119372d12706fd3170f0ff371d5939f829f1bfdd19a3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/compression/filters/aws.ts:402 \u00B7 src/compression/filters/aws.ts:416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"75259c105f81c9ce267b2af6a96cdf4ed8e8ff4ce3b2e9a37837ae4238f2fe66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/data/parsers/csv.ts:97 \u00B7 src/data/parsers/excel.ts:69 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/csv.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0367b421aa167fb6a409f962662ec5fb126c667edc2a2df296b6155d1d5caf55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/frameworks/elixir.ts:51 \u00B7 src/frameworks/elixir.ts:65 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/elixir.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffe7ebad01231df3f66fc8d938dee93e630a5e65417ce200a33a2060e26b3fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/frameworks/python.ts:68 \u00B7 src/frameworks/python.ts:107 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/python.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e99de3907af4eafde67c7f918c5862b78f7f7605c9127535d6f161b720c00b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/frameworks/react.ts:32 \u00B7 src/frameworks/ruby.ts:28 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/react.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"18953ac9a6a915d3f9f7fbe8df387e097edc47ecf63294eece885a9180d83991"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/resolution/bridges/flutter-channel.ts:81 \u00B7 src/resolution/bridges/flutter-channel.ts:388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee27edead668b22918756c1b25a0bb02655c33f695d6a4a37efcd1cbdedc7eba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): src/resolution/bridges/native-views.ts:133 \u00B7 src/resolution/bridges/native-views.ts:170 \u00B7 src/resolution/bridges/native-views.ts:189 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e4b282c3dc1e0525446549f1ddb379dadd9664753a4712a2c8d84f269cd829"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/vectors/orama-index.ts:121 \u00B7 src/vectors/orama-index.ts:153 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"060204d79f73695ed3f32520f33bb6503e69cc1334f1c5c032e21c77d0058e23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): src/architecture/manifest/cargo.ts:10 \u00B7 src/architecture/manifest/elm.ts:11 \u00B7 src/architecture/manifest/go.ts:10 \u00B7 src/architecture/manifest/maven.ts:10 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/cargo.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a1e52f5418f5b7803f5c32fe54a0e60652ec7ea4873b143175979fdd098852"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/architecture/manifest/ocaml.ts:16 \u00B7 src/architecture/manifest/scala.ts:15 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/ocaml.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cea97213f2f6cef0c16b6a4633cc2cd3d937ada95074d3abaeda779ab542954"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/compression/filters/lint.ts:174 \u00B7 src/compression/filters/lint.ts:284 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd0c4cbd6fca6eb5e87e7e79093a6f942c061eb85f129aa2431906b4769a3fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/data/filters.ts:48 \u00B7 src/data/filters.ts:63 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/filters.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb61fd33d2135938a257a9d78add2fbf5fffaa3ad2092e98123a4184bbc2033"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/extraction/extractor.ts:821 \u00B7 src/extraction/notebook.ts:312 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d32c7df3e7e05c941cc2f479eb3163b4336fa1b030df219512e7b7e9190259b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/frameworks/angular.ts:13 \u00B7 src/frameworks/vue.ts:10 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/angular.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6229083e84a16e4f63ba16cbd715a2d6a6613d8d937618110b57cc217e1667a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/frameworks/angular.ts:108 \u00B7 src/frameworks/solidity.ts:46 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/angular.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3bc59a94320d372ae63727227180c3de6ab799bd26a649cf54ba40e2a28bfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/frameworks/cloudformation.ts:30 \u00B7 src/frameworks/elixir.ts:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/cloudformation.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f299d1e3cefecfdb9ada99e089a79e9cfa14db0984ace3fb444196eb3664e6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): src/frameworks/cloudformation.ts:59 \u00B7 src/frameworks/cloudformation.ts:79 \u00B7 src/frameworks/docker.ts:37 \u00B7 src/frameworks/docker.ts:58 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/cloudformation.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee17bf25682202e285e79f29ecbe58c992240142e395a4730e19d6a94cb85d6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/frameworks/python.ts:27 \u00B7 src/frameworks/swift.ts:98 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/python.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2c26869316944e9542252012ab6e7f87afb5e14b0a5d726135c95a18167597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/frameworks/swift.ts:33 \u00B7 src/frameworks/swift.ts:69 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/swift.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1713c45d66351aac6fadb08223b5b1824740009ac46a8981cb9c93ea1f79bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/graph/traversal.ts:25 \u00B7 src/graph/traversal.ts:80 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/traversal.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa95def30dfcbbdfe46203259a3c07326810b024879fffb9ae7497a3428570b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/mcp/handlers/security.ts:324 \u00B7 src/mcp/handlers/security.ts:340 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d27085c4a329601d98224170ddafce986e28e0b2d7df3e385d9e817909e9b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/memory/database.ts:60 \u00B7 src/wiki/database.ts:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/database.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f8ee4defaf964fcbb655b7d43ac0861bcfb86888352af318d40f705c70f7d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/security/auth-detection-jev.ts:26 \u00B7 src/wiki/contradiction-jev.ts:24 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/auth-detection-jev.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fd20456241ff81d32983e49091af2750f06e04283f34c0b0816bf974b8f165"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/security/manifest/plugins/maven.ts:62 \u00B7 src/security/manifest/plugins/pip.ts:45 \u00B7 src/security/manifest/plugins/pyproject.ts:24 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d85d664ce5405eabe88551d7115afbda9c056234d2ff09834bf066748e692e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/security/manifest/plugins/npm.ts:20 \u00B7 src/security/manifest/plugins/swift.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"41729f4f63e4fb4450fa559d081522c9d1f4bce2ef203d0b0f1a2aee0aeb2a75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/security/manifest/plugins/swift.ts:282 \u00B7 src/security/manifest/plugins/swift.ts:310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/swift.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee542f299ba25386c46a20a13a39c65ab0806df104bb010ceb87c107e20f3dc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/vectors/index.ts:167 \u00B7 src/watchmen/synthesize.ts:64 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5798421b2a70acf39195bd83ee8a91f2d0859c6be0290bb89b13cab37a80871d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/vectors/orama-index.ts:138 \u00B7 src/vectors/typesense-index.ts:358 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4757362b35acb4c3b77c31905b95ee797aef322c3850d9cf45df90c622f973"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/vectors/qdrant-index.ts:264 \u00B7 src/vectors/qdrant-index.ts:299 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fcfe55ed2a12ebdb308a66564ba669468a9032838109c0e50824a4b37105e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/frameworks/ansible.ts:102 \u00B7 src/frameworks/iac.ts:320 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/ansible.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c5db7937047f4ab09c7bb56f527e8cd1f574710440accbc3db3238f982b536"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/frameworks/cloudformation.ts:109 \u00B7 src/frameworks/docker.ts:112 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/cloudformation.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"184fbf07a5e86125587d7c07af9069e99b90e20815affbd92f43ecefda0df69e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/frameworks/express.ts:86 \u00B7 src/frameworks/scala.ts:90 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/express.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"01709f6856de08957fa86a46ba21a5fc55870977e92007af9210bd1436ce7b44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/frameworks/iac.ts:34 \u00B7 src/frameworks/pulumi.ts:38 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc964b59810298c7717c7283417c7db189f3cf6f0794265275e02fead211c42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/frameworks/python.ts:53 \u00B7 src/frameworks/python.ts:91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/python.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e15e1d5f4518cdf6b9fded0b6a1b741cf44e346657809540bb28c80ce12c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/frameworks/ruby.ts:17 \u00B7 src/frameworks/vue.ts:100 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/ruby.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8ac79bed94b8bca71be530022174d9f0f422f5974b0a889e57e6fe36949d79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/mcp/handlers/core.ts:55 \u00B7 src/mcp/handlers/core.ts:299 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3886e88af009e68c2f549249cfda82ccb694549527e0cca44b59449d6b685a7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/mcp/handlers/core.ts:87 \u00B7 src/mcp/handlers/core.ts:128 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41b27c3a89111b5459dee73570d35013043253a647d82d2bbced3248868bc31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/mcp/handlers/core.ts:261 \u00B7 src/mcp/handlers/core.ts:273 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcaea9fc714a347afc869ba01459f0ed12c1e92ee40ca997b2ea1dad9c20c6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/mcp/handlers/core.ts:430 \u00B7 src/mcp/handlers/core.ts:467 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d184b3a9d4431cb1729cfffae6cc81c145a8d1713537c0fd22832493ec96ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/mcp/handlers/wiki.ts:88 \u00B7 src/mcp/handlers/wiki.ts:148 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe688de4d293e630b19d205d816d219922f3e82230366a778bcadd23f4f1ea3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): src/mcp/read-modes.ts:67 \u00B7 src/mcp/read-modes.ts:124 \u00B7 src/mcp/read-modes.ts:255 \u00B7 src/mcp/read-modes.ts:296 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"94797a05a79ebd1326d9cd2ded09fe8a13a18adbd229e7a5f8a37f71fd63b221"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/resolution/bridges/flutter-channel.ts:175 \u00B7 src/resolution/bridges/flutter-channel.ts:419 \u00B7 src/resolution/bridges/flutter-channel.ts:465 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81a03e7719ea00375c709115f09c0a72d7a2c55ff7bb03177a4ee6157d6668b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolution/bridges/turbomodules.ts:113 \u00B7 src/resolution/bridges/turbomodules.ts:127 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/turbomodules.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c3b5634c9f08e1bc8dcbf6ab83ce9946f7c8ffcc1f06e1a42f70f319138930"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/security/manifest/plugins/pyproject.ts:45 \u00B7 src/security/manifest/plugins/pyproject.ts:61 \u00B7 src/security/manifest/plugins/pyproject.ts:78 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c4df346afbc38d3d3ecad6bc5c6b6a8bf97b46721e9cd2354b86d6ecfff332"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/config.ts:470 \u00B7 src/config.ts:587 \u00B7 src/config.ts:784 \u00B7 src/config.ts:794 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea12d9f422dd7127797b0423a2a32fdb6dde4f184273b124e46f8c8fd90c34d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/db/database.ts:910 \u00B7 src/graph/queries.ts:118 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeee1308ac188db044233663152ecc132954ad21bf09e13c3644bcc0b5fabc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/extraction/extractor.ts:367 \u00B7 src/extraction/extractor.ts:592 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e247b60dd19fa499c2dad23263deb5245a86e78432b3961a41aee24b9c5841"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/frameworks/amplify.ts:30 \u00B7 src/frameworks/angular.ts:58 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/amplify.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b8eb147dcc8c55b9179abd5094c79cfd8d9455cf1b7452f6913d2d2640ff3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/frameworks/iac.ts:115 \u00B7 src/frameworks/laravel.ts:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cf70733981ba84999626bc25bfc8170b48e042fa95022a208d8fcf1599e972"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/frameworks/iac.ts:295 \u00B7 src/frameworks/pulumi.ts:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ec57872b34e4b0bbfeba8363bb173809b76af64107d5d5e7e8ec76aabfdf64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/frameworks/terraform.ts:55 \u00B7 src/frameworks/terraform.ts:74 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/terraform.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad67e8b88db115d734255f29ece44dda2872dbf84d80785e2bf58478139437ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/index.ts:83 \u00B7 src/index.ts:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1931efbd080c8cd9b37cb9b327e569eea14129b740e899e0c92f7ceba571e7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/mcp/cache.ts:53 \u00B7 src/mcp/cache.ts:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cache.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c755b9d7c4a33b7e230f1cfc2c0446661ad183bac6ba597c9ec08c77c9ead4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/mcp/handlers/data.ts:117 \u00B7 src/mcp/handlers/docs.ts:37 \u00B7 src/mcp/handlers/docs.ts:95 \u00B7 src/mcp/handlers/wiki.ts:58 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec76d72d325ad77d2f38ebbf11677a8f1a050344a2cdc784d316cec0a3194af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/mcp/handlers/git-context.ts:131 \u00B7 src/mcp/handlers/git-context.ts:146 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0124a5c3195afc6a48b30806bc6fa37bbd3d280fcb70cee9780c3c331f6e3c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/mcp/handlers/patterns.ts:77 \u00B7 src/mcp/handlers/patterns.ts:180 \u00B7 src/mcp/handlers/patterns.ts:218 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d4575e3260897159d2c157520cafd1c2a655e9b2aac67e8087fc8fbece6733"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): src/mcp/handlers/security.ts:241 \u00B7 src/mcp/handlers/security.ts:444 \u00B7 src/mcp/handlers/security.ts:657 \u00B7 src/mcp/handlers/security.ts:704 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f39d8f8b626a9fd0fa869246a2db974bb4e538e22e09aa254f47257cc17427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/bridges/android-rn.ts:95 \u00B7 src/resolution/bridges/android-rn.ts:155 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9af893d5d385c7554578b029fa46ac3a1f4b00c6a0372c564039f03d0413c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/resolution/bridges/native-events.ts:55 \u00B7 src/resolution/bridges/native-events.ts:71 \u00B7 src/resolution/bridges/native-views.ts:72 \u00B7 src/resolution/bridges/native-views.ts:87 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa4060070c580066a14d018bbde2c146dafc28ca66417b65d788b05895c5d9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/resolution/bridges/native-views.ts:66 \u00B7 src/resolution/bridges/native-views.ts:82 \u00B7 src/resolution/bridges/native-views.ts:97 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1b7c136033370733939da0923aca6b85dcb498f33d1d059804a8f1f30b7497"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/resolution/bridges/swift-objc.ts:48 \u00B7 src/resolution/bridges/swift-objc.ts:60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/swift-objc.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a209b42c9e4b23d30bd516ccd1da9da90ba796b33bdeef5da99136f56851cf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/security/export/sbom.ts:133 \u00B7 src/security/export/vex.ts:23 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/sbom.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c113e60d873cd33ef9877b01ae07d306b42419786748494e61b71db80d9b38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/utils.ts:30 \u00B7 src/utils.ts:96 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ff1b225082f8dcb3eb7e60fccc60e75a3119743498a1a729760956d5af24df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/wiki/ingest.ts:144 \u00B7 src/wiki/ingest.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/ingest.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a16943065f2ed67c11942f375db7fc61af712e2ffb21600110899ebc026621"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/architecture/incremental.ts:45 \u00B7 src/security/incremental.ts:57 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/incremental.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e629d9c0a350c1435d059363756c995c7ae5f1e482fa0960b4028bb77433fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/architecture/manifest/cargo.ts:57 \u00B7 src/architecture/manifest/npm.ts:48 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/cargo.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6cf07ba37016100b2eee7e2e8dad4bc93fa7c48d56d44783de49f7ada120f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/architecture/manifest/index.ts:123 \u00B7 src/security/manifest/adapter.ts:308 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/index.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"969d9e4d9dcf949687f03a5272b345767d01d253a21ead34bde01ee8c4780ac0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9 locations): src/compression/filters/aws.ts:97 \u00B7 src/compression/filters/aws.ts:128 \u00B7 src/compression/filters/aws.ts:171 \u00B7 src/compression/filters/aws.ts:213 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"592b728a6dd0e5de0a154543157351e3feafe56c859c2b642c0d5b853ff94d8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/compression/filters/aws.ts:323 \u00B7 src/compression/filters/github.ts:118 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a62ad439452a32c5e3e87a4dcf91cb062f84579ba0ea1a7f51dff11c8dd075"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/compression/filters/misc.ts:125 \u00B7 src/compression/filters/misc.ts:151 \u00B7 src/compression/filters/misc.ts:229 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0103f0051a0171125c0d752b2b0097c16512028516d652fbf959bcc682fb6ad7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/config.ts:521 \u00B7 src/config.ts:554 \u00B7 src/config.ts:585 \u00B7 src/config.ts:622 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b0b23646d864e4571cdeea887a7d1ef9f52ac23fa193a13a2b0b522c374251"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/pipeline.ts:391 \u00B7 src/core/pipeline.ts:764 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba50fff02d852476de65ef4f524bbe33ea8730c513c115736c5a8b15df58d45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/db/database.ts:431 \u00B7 src/wiki/database.ts:92 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75243efbcdc7c34e9356ca2a3f0301496718145be0ab33476caa94dcc43f6b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/db/database.ts:442 \u00B7 src/db/database.ts:468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77aa297a8cdd0766854a05a73a82dc8e1f8240df6ca757ebfa8706110431fd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): src/frameworks/amplify.ts:11 \u00B7 src/frameworks/angular.ts:11 \u00B7 src/frameworks/iac.ts:11 \u00B7 src/frameworks/pulumi.ts:11 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/amplify.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd4335a2dc050167a8834687bdfc7110d46aa53de436c1610a1725110fc286"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/frameworks/docker.ts:25 \u00B7 src/frameworks/iac.ts:190 \u00B7 src/frameworks/iac.ts:278 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/docker.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d059ef5460de8daac333d988be6f0b1a09d15336b5444c632042cbbcf85c20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/frameworks/docker.ts:91 \u00B7 src/frameworks/flutter.ts:67 \u00B7 src/frameworks/flutter.ts:92 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/docker.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac89d4e2d9c0454b909701e42cad9a48802d6928c93858d41ac78c8f4c6591b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): src/frameworks/express.ts:9 \u00B7 src/frameworks/react.ts:11 \u00B7 src/frameworks/svelte.ts:21 \u00B7 src/frameworks/vue.ts:89 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/express.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaee2278e38f98a1f71783d56e861e1de215af1ee44470ca164e30668c0c27b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/frameworks/kubernetes.ts:83 \u00B7 src/frameworks/terraform.ts:151 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/kubernetes.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0584787dcca4127cec69f0a5c33efbb6feced1bb90a2c006c5555ce4d1fea5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/frameworks/solidity.ts:41 \u00B7 src/frameworks/solidity.ts:59 \u00B7 src/frameworks/solidity.ts:71 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/solidity.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aefb342d805c0e4f48cf7dba5d0edd5fd564804712bbbb45cd378a976cddc89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/frameworks/terraform.ts:227 \u00B7 src/frameworks/terraform.ts:237 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/terraform.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf51b3a47855775f16c75d734fa734c501c892b4514779eea3b23a1519d09227"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/handlers/architecture.ts:114 \u00B7 src/mcp/handlers/architecture.ts:240 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cccae62a1429364dd74f9afdc27b1bb3c8891785ade94e3c0dc3370e7d330f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/handlers/code-health.ts:42 \u00B7 src/mcp/handlers/code-health.ts:54 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa38c46db5c923dc77f4693ac5997ce0967fe1610b588a308cec1400860ad88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/mcp/handlers/complexity.ts:32 \u00B7 src/mcp/handlers/complexity.ts:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/complexity.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9798f090f0476bdeb8a1222c4aac322af60516e156b905d1889f25be74aa42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/handlers/memory.ts:324 \u00B7 src/mcp/handlers/wiki.ts:176 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac3e3db804a8c7a5fe4979d7f2c41750c8ef01aceba0fde17772e65769a7c31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/handlers/watchmen.ts:10 \u00B7 src/mcp/handlers/watchmen.ts:41 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/watchmen.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e97761ee918c35cc3e76f5273d423a2121c1c05aea80762db635dac758168dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/mcp/read-modes.ts:115 \u00B7 src/mcp/read-modes.ts:173 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7275f788331d73d9b358d226fbe05ccb770f5ed80703b38e4dfa98bfb673e32e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/memory/database.ts:389 \u00B7 src/memory/database.ts:413 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/database.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed112e34bd4533a239eab64096d01e5ea2b5917f022e0a38c7507cdc4dddbbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/memory/index.ts:197 \u00B7 src/memory/index.ts:207 \u00B7 src/memory/index.ts:219 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/index.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3571dc2ff50c0bc13232aa1a1c22e641fcf95ba2cb9e57ee95e8953db0b21e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/bridges/android-rn.ts:177 \u00B7 src/resolution/bridges/expo-modules.ts:110 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5f7510b15426ec6db5419d96160afdce080a61c3dd663f183d8e548a35e41a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/bridges/expo-modules.ts:58 \u00B7 src/resolution/bridges/expo-modules.ts:75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f0391b00a42f9e34f142ec643d7937572c7941914bf987e228eb53ca694957"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/bridges/native-events.ts:123 \u00B7 src/resolution/bridges/native-events.ts:165 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a031210416d179a79aefecddaf048b1e07ccd52086569b5d65eb7b27082580bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/resolution/index.ts:335 \u00B7 src/resolution/index.ts:354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ac36d3468f09ad31b7e257912e3a58b85fb50d2e66dcab3e29bc22bfdfe683"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/security/data-flows.ts:144 \u00B7 src/security/data-flows.ts:174 \u00B7 src/security/data-flows.ts:216 \u00B7 src/security/data-flows.ts:336 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/data-flows.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae7732f2b788be576efcec1fd03dcd63ec9a3b6d6bc3847e84e92fcfeecbdfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/security/manifest/adapter.ts:166 \u00B7 src/security/manifest/adapter.ts:176 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/adapter.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b108ee1d17e58dcba436a045ff64da3e421367babda3823f6ac770864083d2e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/security/manifest/plugins/cargo.ts:102 \u00B7 src/security/manifest/plugins/cargo.ts:380 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b8ce39554b26a68b6727a57c03f81e3cbcc33e6f116cb22166ca7e724917d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/security/manifest/plugins/maven.ts:171 \u00B7 src/security/manifest/plugins/pubspec.ts:76 \u00B7 src/security/manifest/plugins/rubygems.ts:99 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f912f46e7495837a0a51723febaeaadd71a493ef95b9215c58bff5161689191c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/architecture/manifest/gradle.ts:15 \u00B7 src/architecture/manifest/python.ts:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/gradle.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14460749549dcd0925a0db47ad2c2d31950e78e4515a9a8153d12662beda5a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/compression/filters/aws.ts:231 \u00B7 src/compression/filters/aws.ts:454 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dd249509a51ba2a64dbcc9153708f1df666d21b42b49370afd0e47c635c03a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/compression/filters/aws.ts:283 \u00B7 src/compression/filters/aws.ts:305 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eb009f71c3621dd94b70e5b306d2ab08c4bb8cd3f7e5e0cd15bf706d0d1c04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/compression/filters/docker.ts:107 \u00B7 src/compression/filters/package.ts:91 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/docker.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb9aaa5a14dc9caba2b1b14059e72dfe3e547d9e1aacb489c7907bbf6cea581"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/context/index.ts:196 \u00B7 src/index.ts:241 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f472bce072685fe1733a42e5a88fbadc3bd244427fdabb79581ff82be8ba5e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/pipeline.ts:378 \u00B7 src/core/pipeline.ts:748 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e40b596fed9afdb0bcd48041979259240d3158d9105638292810025f416b649"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/data/queries.ts:405 \u00B7 src/data/queries.ts:459 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb2329ea14aef0b197ea6a88281a468d8a9a6d637791c86cbf7757a82e8f1d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/db/database.ts:68 \u00B7 src/db/database.ts:153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e476c48da215276188eac0d830d70eadbc4f943a2c23050c3fd51b667d4717d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/db/database.ts:92 \u00B7 src/db/database.ts:107 \u00B7 src/db/database.ts:123 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a8a99005c81a3db3b3c82e3948f6a0c788bd654d72cc5ada4000e9c05ee0e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/db/database.ts:115 \u00B7 src/db/database.ts:145 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efcfd544b5943d3bb14122584c7bb5c5d0e0fdb9be48139c52071edd81a08bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/errors.ts:75 \u00B7 src/errors.ts:89 \u00B7 src/errors.ts:103 \u00B7 src/security/errors.ts:9 \u2014 the 4 copies are spread across 2 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/errors.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a55d30768b21d735023edc3bb448abe4380a384e4e160e33ab40137e70ebf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/extractor.ts:574 \u00B7 src/extraction/notebook.ts:282 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b9a428de6ace0bad201d164e1afa152ba0e3b99ce9ab5cb85b80f4afa76b56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/extraction/extractor.ts:856 \u00B7 src/extraction/extractor.ts:890 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d593337f9f1a384d60e7420f682d125cb2848547493957ed889fbe69f7ee1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/frameworks/amplify.ts:84 \u00B7 src/frameworks/kubernetes.ts:103 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/amplify.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5a0221eb66177071b3f17ff3a30c5938105ee8818185c9ee8611d2e89f13e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/frameworks/ansible.ts:22 \u00B7 src/frameworks/cloudformation.ts:26 \u00B7 src/frameworks/docker.ts:21 \u00B7 src/frameworks/kubernetes.ts:31 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/ansible.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"14df702085bebfce68870123c25b875e8809f9f1e8a3d09d6a0d362488728e42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/frameworks/fastify.ts:16 \u00B7 src/resolution/bridges/android-rn.ts:354 \u00B7 src/resolution/bridges/react-native.ts:177 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/fastify.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a778a8d1a2c723a6936f3227876175cdb8f4180a7e6c7c1a8dfedc8e3585741a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/frameworks/flutter.ts:40 \u00B7 src/frameworks/svelte.ts:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/flutter.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e780236612dcf3683d371e6039c1a814325a6d4e3e4011cc9cda91375a1064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/frameworks/iac.ts:189 \u00B7 src/frameworks/iac.ts:277 \u00B7 src/frameworks/laravel.ts:49 \u00B7 src/frameworks/vue.ts:35 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d1d40844a6a41b54c15569a7afcf4cd77a0acda8391daa30e3af431deb58d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/frameworks/svelte.ts:114 \u00B7 src/frameworks/svelte.ts:122 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/svelte.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b182902e5aa968a5faf355dc149bdaa6964020e8f2e037cabf4f53dc0cf22b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/frameworks/terraform.ts:78 \u00B7 src/frameworks/terraform.ts:95 \u00B7 src/frameworks/terraform.ts:112 \u00B7 src/frameworks/terraform.ts:129 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/terraform.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46d9abe1867d747284d15a40a9a7d4fb6cba02f9800e062af55329bd4efa4a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/mcp/handler.ts:259 \u00B7 src/mcp/handler.ts:312 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05e6a7eaf25702cbbac00919e4a99d6f3c609d4946cab0871dbbc77b47965e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/mcp/handlers/architecture.ts:159 \u00B7 src/mcp/handlers/git-context.ts:92 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"54efe0888b6d8ed9aa3d8eb129f9d748c8592094249e4f605b1e0e35f14a1f8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/mcp/handlers/branch.ts:100 \u00B7 src/mcp/handlers/branch.ts:109 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca685d28214707158a4db5115a4f4f0d81924a8e0c50160f0c1971ce5347543"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/mcp/handlers/code-health.ts:168 \u00B7 src/mcp/handlers/code-health.ts:188 \u00B7 src/mcp/handlers/code-health.ts:281 \u00B7 src/mcp/handlers/code-health.ts:343 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ec496e2ed424a87063685b06468ec9a729fbca3101d5f3db8fab8ac884109e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 24 locations): src/mcp/handlers/data.ts:40 \u00B7 src/mcp/handlers/data.ts:60 \u00B7 src/mcp/handlers/data.ts:124 \u00B7 src/mcp/handlers/data.ts:165 \u00B7 \u002B20 more site(s) not listed \u2014 the 24 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e99a86328a79081141e9de3c91980e88b52461531bab573dee49ff90497384"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 19 locations): src/mcp/handlers/data.ts:57 \u00B7 src/mcp/handlers/data.ts:121 \u00B7 src/mcp/handlers/data.ts:162 \u00B7 src/mcp/handlers/data.ts:198 \u00B7 \u002B15 more site(s) not listed \u2014 the 19 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd528b1be47b59358e4976c801b1a8370f24ee6e2617a4e7bbe3a217a6e0e0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/mcp/handlers/memory.ts:127 \u00B7 src/mcp/handlers/watchmen.ts:29 \u00B7 src/mcp/handlers/watchmen.ts:69 \u00B7 src/mcp/handlers/wiki.ts:203 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d994aa923ba9f9833a1e60899e325b7e37dbc05a9ba86546a0084a5a6568a043"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 13 locations): src/mcp/handlers/security.ts:94 \u00B7 src/mcp/handlers/security.ts:245 \u00B7 src/mcp/handlers/security.ts:317 \u00B7 src/mcp/handlers/security.ts:333 \u00B7 \u002B9 more site(s) not listed \u2014 all 13 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b554538e754d7d750a4ab0bccfea482b637077f5c71323c2d015120c758c3c06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/mcp/handlers/wiki.ts:9 \u00B7 src/mcp/handlers/wiki.ts:37 \u00B7 src/mcp/handlers/wiki.ts:186 \u00B7 src/mcp/handlers/wiki.ts:211 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c690f5d32a4d46b66e66522a430b7a9c31a55b2287783aed89865da2c19ffeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/mcp/handlers/wiki.ts:70 \u00B7 src/mcp/handlers/wiki.ts:100 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0df7c3a8af825521b94fb1b6b33a27ef2c7a05fe59a6fa6b58ceddfe216dee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/memory/vectors.ts:164 \u00B7 src/memory/vectors.ts:185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/vectors.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d56c58b41c44bb836e9e3f916807e5d0f8439ca1e781a8ab74799e724aaf00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/bridges/android-rn.ts:331 \u00B7 src/resolution/bridges/swift-objc.ts:201 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d21bef3bfa6103706f2c7200a1489f155e5533a215dc0e3aee923c53472c68b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/resolution/bridges/expo-modules.ts:121 \u00B7 src/resolution/bridges/expo-modules.ts:145 \u00B7 src/resolution/bridges/react-native.ts:54 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc5db1568609739f0e9f24e8ee95f97da47dfdeb332052e661f4f513a4c0b95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/resolution/bridges/flutter-channel.ts:246 \u00B7 src/resolution/bridges/flutter-channel.ts:257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"126d8b60a1860b5707af4d098fcb3557e12e2b6edbd08b4af8559ce5537bc157"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/security/export/sbom.ts:75 \u00B7 src/security/export/sbom.ts:84 \u00B7 src/security/export/sbom.ts:93 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/sbom.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"949ef52da31bfd52b4d89f36d76ad9fd5bb2353a054f24d924b76dab726992db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/security/incremental.ts:70 \u00B7 src/sync/state.ts:168 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/incremental.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad8a881254547d32c8da2da8a985771cc369277d40a466cb42fcb8dea7b4839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/security/manifest/plugins/cargo.ts:208 \u00B7 src/security/manifest/plugins/cargo.ts:224 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5575f6bde164d10dddaa63886df454dd7a8ad216a53ed2ff059bda5b1f577ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/security/manifest/plugins/go.ts:156 \u00B7 src/security/manifest/plugins/nuget.ts:247 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/go.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633b732fbfc3e736b4c0fc8f9c685abf9ffd742d27d2e6a794cd3d5d9202b7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/security/manifest/plugins/nuget.ts:127 \u00B7 src/security/manifest/plugins/nuget.ts:191 \u00B7 src/security/manifest/plugins/swift.ts:95 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bbc77f9c49e56588a729e09f88e2e8f5792796f2edb56d72a9f3f9e26c6d5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/security/supply-chain.ts:67 \u00B7 src/security/supply-chain.ts:179 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/supply-chain.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0386cdc217f057237389e545f1e7560b172f61e0b764c4d081bb23f671b9e79b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/sync/files.ts:61 \u00B7 src/sync/index.ts:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/files.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91320618b81f952ee7bbcc905a0df75b93d156888e936f4c908a9b49f7fb245"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/sync/index.ts:31 \u00B7 src/sync/index.ts:55 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bf6596e97f29fd0ba984f73344453783142e4ffd2b9371f10b834ed48c30b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/vectors/lancedb-index.ts:109 \u00B7 src/vectors/orama-index.ts:144 \u00B7 src/vectors/pglite-index.ts:133 \u00B7 src/vectors/typesense-index.ts:388 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/lancedb-index.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d48103ea53c5489b17581de22b17180652817b957e6a50f6f29dbcee8fd5b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/vectors/orama-index.ts:167 \u00B7 src/vectors/pglite-index.ts:147 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"92258d3de02e5025cc27b18b2cc8c634c72586a0f0b3ec5a2ea89d1895f08421"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/vectors/orama-index.ts:192 \u00B7 src/vectors/turboquant-index.ts:177 \u00B7 src/vectors/turbovec-index.ts:125 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0551dec6edd09d3ae39119e1b448661a66abd31cf2a06881748ffde9f2ba9019"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/vectors/typesense-index.ts:356 \u00B7 src/vectors/typesense-index.ts:377 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaa75566dd6d9782ed324a1f8a58e303053fde1348faea801bde34b744a6540"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/vectors/vec-index.ts:114 \u00B7 src/vectors/vec-index.ts:144 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/vec-index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"567eb9b40314e91f1e71f5e064e8f3278cf1256147b4afcdb473a3f5d89b1bf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/architecture/manifest/elm.ts:28 \u00B7 src/architecture/manifest/ocaml.ts:22 \u00B7 src/architecture/manifest/scala.ts:21 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/elm.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7df6d49e682ba18c7ea1fdc64a9253f9985d2debc20cb7c16dc97389a307842"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/architecture/manifest/index.ts:84 \u00B7 src/security/manifest/adapter.ts:127 \u2014 the two spans are one implementation copied and then locally edited \u2014 124 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/index.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6860c610a0ba81f91f5e5b0d5022a4a4a0f45d1341cfc77776a75b91af78412"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/compression/filters/docker.ts:32 \u00B7 src/compression/filters/docker.ts:60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/docker.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6db785704ae8d85e9ce991bcda45c89290f1dec9aa76a85716a26a0dc555df1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/compression/filters/misc.ts:48 \u00B7 src/compression/filters/misc.ts:58 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ff3461088c8882e431f758701b850cdf9866971db1d9e002ea78492f79ddd0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/config.ts:1084 \u00B7 src/config.ts:1092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"f350790a787f6118953159569c5055abdd251aab4b2766a151cf4865a87e3306"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/lock-manager.ts:56 \u00B7 src/core/lock-manager.ts:148 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/lock-manager.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f407ab71aff39530b46c3706548e72cb8e15961c6ff2e5be9c1559516b3792"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/pipeline.ts:365 \u00B7 src/core/pipeline.ts:732 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b168c924a99f09aa76954ecd52d12f30a74db5bf1180200c9eab1463c2756e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/data/linker.ts:65 \u00B7 src/data/linker.ts:81 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/linker.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81480305afcaa54bd308f7197225cb3e9a7600b53b094531029b467c190dbbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/data/queries.ts:558 \u00B7 src/data/queries.ts:606 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf75dd56f06cc01072d89746dd9981d3833f4501939a58365fd5517a5e39737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/extraction/complexity.ts:94 \u00B7 src/extraction/extractor.ts:234 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/complexity.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46356fbdcdd56541e7321907c72965138412a5d248c71864986f95ebebec9fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/extractor.ts:319 \u00B7 src/extraction/extractor.ts:517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc8aede58bb875250b82cb52b4107cdb958be713579f3c5d9ab53949d354674"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/extraction/infra.ts:194 \u00B7 src/extraction/infra.ts:227 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8684c8534ed99e352e0be566edf422cf1e169b244c1c8093f7cfbb25a742aa8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10 locations): src/frameworks/amplify.ts:60 \u00B7 src/frameworks/amplify.ts:76 \u00B7 src/frameworks/amplify.ts:92 \u00B7 src/frameworks/iac.ts:147 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/amplify.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d997a677b678537489fbfabf4471dc4c986a0444c3d1909e7c32db918381df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/frameworks/csharp.ts:10 \u00B7 src/frameworks/swift.ts:10 \u00B7 src/frameworks/swift.ts:45 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/csharp.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf9614e4907e085f7673d6e71a0ff6332ee4002ad37977cdbdea8cf5299998c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/frameworks/iac.ts:158 \u00B7 src/frameworks/iac.ts:298 \u00B7 src/frameworks/pulumi.ts:53 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff446e5b7121e505629aaaddaa10babdb93f53a9486768366c95aba14d3853c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/frameworks/laravel.ts:57 \u00B7 src/frameworks/swift.ts:109 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/laravel.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f39e6886ee2e2b8e351d9e9bf5ca39a38c26882633a219a266223f4ea2546"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/frameworks/python.ts:10 \u00B7 src/frameworks/python.ts:87 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/python.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe18baf0c258843279218485aca19cdef0fff5b2bf73908ccf224e1c73878f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/frameworks/python.ts:51 \u00B7 src/frameworks/scala.ts:8 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/python.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536911d9d1579ea831bdd8fc7189f280d1510a58a8ddc2897c4f6905c4bf697"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/frameworks/react.ts:143 \u00B7 src/frameworks/react.ts:153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/react.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73888577453a8a49adf2e2c8f5b9cd08417cf6e8ca81c1dbaf8b95481fa9d45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/frameworks/solidity.ts:63 \u00B7 src/frameworks/solidity.ts:75 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/solidity.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"382fb22e5704ab7fed222e3e1ac99fbf7d88a2483d79b00a7a6a08e303480604"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/frameworks/terraform.ts:200 \u00B7 src/frameworks/terraform.ts:212 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/terraform.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e34d9fa34a38d2a24c95477f748cc8a62bd2f5104104b4481caaa8715b0f4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/frameworks/vue.ts:121 \u00B7 src/frameworks/vue.ts:149 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/vue.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8177af2aa5e1e55d26ce331f350b3c3f3abeadf67927e192f4ac69b60fe7bad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/mcp/handlers/code-health.ts:31 \u00B7 src/mcp/handlers/code-health.ts:144 \u00B7 src/mcp/handlers/core.ts:285 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1d6fab8f813b6b9860d905ce3db5a1ed803beb38092d588fd75cbc06e5e053"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/handlers/memory.ts:5 \u00B7 src/mcp/handlers/patterns.ts:6 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d3a38f5f85d8c227d8fd521a0574f8bb8ee4922ef19d32f8a74a3b2f14bf85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/handlers/memory.ts:146 \u00B7 src/mcp/handlers/memory.ts:232 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6bc415f20f43f61760b5cd63ddd2025efec2ecde605ffe643329fd2c7484a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/handlers/security.ts:453 \u00B7 src/mcp/handlers/security.ts:514 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"75585c91439ac7f86a396e45ba7bb1ca2ca1c8872ebe3229d239113fd0652ecb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/handlers/security.ts:745 \u00B7 src/mcp/handlers/security.ts:827 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e7dc493335c73bbd27bef7199eefbcaae99c83da329b06968d7a23b128e525"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/mcp/handlers/security.ts:764 \u00B7 src/mcp/handlers/security.ts:810 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"91455f040aee6adb31dec304b1ea40bc91363bb49c99099fe9ed25df896cb075"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/resolution/bridges/native-views.ts:261 \u00B7 src/resolution/bridges/turbomodules.ts:168 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"424b57b9d6021dbdc19ae072a08696c5fbc891daf0c9a484f0f87e99147ab1c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/resolution/bridges/react-native.ts:40 \u00B7 src/resolution/bridges/react-native.ts:92 \u00B7 src/resolution/bridges/react-native.ts:148 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/react-native.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8440642c851d0e507c67af92577c1e4de6a841eedf05abd5d26ee79a70928a3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/security/integrator.ts:249 \u00B7 src/security/integrator.ts:449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abfb7485fb2328defc061bf933758cc285f824bcfb4e63232139a73c9a54208"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/security/manifest/plugins/composer.ts:207 \u00B7 src/security/manifest/plugins/npm.ts:530 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6266a5f4c09019965ad8345642a5d103ac096bdd880b6d718e051ed2ee60f9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/security/reachability.ts:222 \u00B7 src/security/reachability.ts:231 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/reachability.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba21cfebe0db75a08b63f3d4118a66b3b799088a98ae15e1d3194c11f09880d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/sync/remote.ts:66 \u00B7 src/sync/remote.ts:104 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/remote.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f42e0a58570eaf0deb3ac4724e3fe0bd3d6e152fddd13e373dc51be3199613"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/architecture/index.ts:268 \u00B7 src/index.ts:329 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/index.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6ca3d19f8c1e22ce95c9a7cc2cfaf57718d2eaabad73b71b3641f830664979"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/architecture/manifest/go.ts:26 \u00B7 src/architecture/manifest/ocaml.ts:51 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/go.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"48947fb227128e17127f54bd4904e65fee06f2e1e8069f42c7f41eedfbc1edfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): src/compression/filters/docker.ts:23 \u00B7 src/compression/filters/files.ts:18 \u00B7 src/compression/filters/github.ts:21 \u00B7 src/compression/filters/lint.ts:26 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/docker.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4916b9795b8437b9a103de69f1147a461fe88946f178145b147e79c803db83b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/compression/filters/docker.ts:59 \u00B7 src/compression/filters/docker.ts:87 \u00B7 src/compression/filters/package.ts:84 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/docker.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a0c17012268bfa3b203b7ab218983aefbe3bea1fa21cda275972b15313f651"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/compression/filters/docker.ts:82 \u00B7 src/compression/filters/docker.ts:118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/docker.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9c0052e9ed9f3c771d8b24326ca26f766e5ce978d45ee4b23be655a236fd6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/compression/filters/files.ts:78 \u00B7 src/compression/filters/package.ts:90 \u00B7 src/compression/filters/package.ts:164 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"766bc0ab5ab5f5e9d118dfe9d5c4fc07ba3f339b9b8a20ab1ec99cb772887cfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/compression/filters/lint.ts:30 \u00B7 src/compression/filters/lint.ts:157 \u00B7 src/compression/filters/lint.ts:238 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e38e8eaf74277ffead8e21452ba810f2ada3cc5b64c35cfedabd7b8c5c38c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/compression/filters/lint.ts:165 \u00B7 src/compression/filters/lint.ts:275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"626f1accac98875b9a116f1d17b0d40e5eed1b8dd2793a5f6b65485a8300fe01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/compression/filters/lint.ts:246 \u00B7 src/compression/filters/lint.ts:323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc46be439f8505f4bb0176ee2d953cfd7c2be5ef2cc396ceb656b83d26c8e449"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/compression/filters/lint.ts:312 \u00B7 src/compression/filters/test.ts:132 \u00B7 src/compression/filters/test.ts:178 \u00B7 src/compression/filters/test.ts:220 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a596f90b31526566b6580f30a20e5f66010b6ba93b5ec12b89c4592b9d436d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/compression/filters/misc.ts:184 \u00B7 src/compression/filters/test.ts:42 \u00B7 src/compression/filters/test.ts:96 \u00B7 src/compression/filters/test.ts:141 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e2e5395881a8e177b2aebb4a9409f45e5ee3d95553f840166e96cb5089b79a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/compression/filters/package.ts:107 \u00B7 src/compression/filters/package.ts:162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/package.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa27818d0a5b43dafe9bef31d3ce51ffbcf965cd9219b925b5a36fbe26219746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/compression/filters/test.ts:37 \u00B7 src/compression/filters/test.ts:92 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be0388c7874fd3c8a36a6ed94112e627c49460a1fb803760776c19838d5dfd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/compression/filters/test.ts:133 \u00B7 src/compression/filters/test.ts:179 \u00B7 src/compression/filters/test.ts:221 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"514cf654eb71e35d2da7a60eb9191a71aee263389bf36b6f72c63a255d48f24a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/data/indexer.ts:125 \u00B7 src/data/indexer.ts:207 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/indexer.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1033959e50e8da979131072fb1212566579811ca8e693ce169304d359fb4b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/data/queries.ts:97 \u00B7 src/data/queries.ts:141 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"470fdbf97f673d65ea3df8ba9ca5691d0b542a11e1e7bec978dea9c3b836f3a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/extractor.ts:100 \u00B7 src/extraction/extractor.ts:119 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"312fcd555128aea55a21f70d6ff5882728c6f33b852aab75d54d9681a1c4a823"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/extraction/extractor.ts:514 \u00B7 src/extraction/notebook.ts:222 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1e05e3e58aa9f70c4aa5981db7ee755e83ca68985d1ec45a7cf45a9d315320"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/frameworks/ansible.ts:39 \u00B7 src/frameworks/cloudformation.ts:103 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/ansible.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c162c881a8cfb5ce376fc1c947dea8c8787160392ca09b015c0a4bb8a69fbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/frameworks/elixir.ts:43 \u00B7 src/frameworks/scala.ts:42 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/elixir.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7b404a9aef2ce4f2aa44e0d07df93a6e104595f66573ea28894c023e0892f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/frameworks/laravel.ts:93 \u00B7 src/frameworks/ruby.ts:80 \u00B7 src/frameworks/ruby.ts:97 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/laravel.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"997996334dd456b04e98de76a5472bac4e1f151fbc0f9d1f3382b1585c67c7cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/mcp/cache.ts:155 \u00B7 src/mcp/handlers/utils.ts:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cache.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcfc1dfef8430721038b3dfd1bf2ce4bf19fb5c9ecb8120ece180004320f83d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handler.ts:228 \u00B7 src/mcp/handler.ts:234 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c8a52fdcb427523ca078fcc16b1648df55fae198e82ba9e737c364255aaa51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/architecture.ts:132 \u00B7 src/mcp/handlers/architecture.ts:140 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc64935124163cce3084ce92336327cd9636a3206b12f9205fe228d06c0ed3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/mcp/handlers/architecture.ts:191 \u00B7 src/mcp/handlers/branch.ts:99 \u00B7 src/mcp/handlers/branch.ts:108 \u00B7 src/mcp/handlers/edit-primitives.ts:54 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6632634aac1c3d91500eedb168d7acb6c9c5228d0b5d4b9b26eeaac63b4e6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/branch.ts:51 \u00B7 src/mcp/handlers/branch.ts:136 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba3ba8bffea810842ee00ede43f20b30f01a8adaffdd640be5537c23027e4e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/mcp/handlers/code-health.ts:9 \u00B7 src/mcp/handlers/core.ts:270 \u00B7 src/mcp/handlers/core.ts:282 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dafd45724a4fbd811bb14dd61137c82549fb22f669936c3908deac440fd9ce2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/code-health.ts:88 \u00B7 src/mcp/handlers/code-health.ts:95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f9d45b9ec30b2fd3a2c1ac30eafb01cc1bf812fe64d56f7394ea93394a1c96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/code-health.ts:249 \u00B7 src/mcp/handlers/code-health.ts:297 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d25bb2944d4df6958d42108e0096164fe89f414effb7ac7044baa4bacafe5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/data.ts:101 \u00B7 src/mcp/handlers/data.ts:110 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4ac1aa788721ba77d9eb9c0a5b9fd8cce1c5b9f03eb52476bb3b3911d28b08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/data.ts:130 \u00B7 src/mcp/handlers/data.ts:171 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce00efa8d592a949bc5e36d25f85d2c507c9cfa0c81369c2fd3f3facc6eab5e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14 locations): src/mcp/handlers/docs.ts:8 \u00B7 src/mcp/handlers/docs.ts:47 \u00B7 src/mcp/handlers/docs.ts:71 \u00B7 src/mcp/handlers/docs.ts:105 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c417522a3f92ce048776b770223251aa4a4ffe48c0263c56f6eb6cd0db2012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/docs.ts:72 \u00B7 src/mcp/handlers/docs.ts:106 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a605643dd008d436baed256ef088fa75ad35a3e640b691f4c1be8c3b4d996c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/edit-primitives.ts:87 \u00B7 src/mcp/handlers/edit-primitives.ts:157 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8bb059fa0968b832b4dcc58feec0a45fb476d381819cd040b8fbe2db4f2705"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/mcp/handlers/patterns.ts:287 \u00B7 src/mcp/handlers/patterns.ts:294 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4013f97fcf7d7bf9ad908ba5e38e0581a997a0ca895227c99eed06cde72926b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/mcp/handlers/wiki.ts:160 \u00B7 src/mcp/handlers/wiki.ts:229 \u00B7 src/mcp/handlers/wiki.ts:245 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"329ff5ed329773bebf278062a34ca87ef0b7400fdf3124f23db986413a8f05e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/memory/vectors.ts:51 \u00B7 src/vectors/index.ts:76 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/vectors.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e67e02816b093de4fbb2b35cb33e798eef31ed829b4c20e08401488a9dcfa9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/resolution/bridges/android-rn.ts:46 \u00B7 src/resolution/bridges/android-rn.ts:104 \u00B7 src/resolution/bridges/android-rn.ts:164 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe925bedaa8a6067c316b8770836bc19d9a095d318660012b97a23ce30d2ce7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/bridges/android-rn.ts:264 \u00B7 src/resolution/bridges/android-rn.ts:324 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4539a7844998af793c16379b314a3b47e6240f8d73d3c2649a32f188e1af58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/resolution/bridges/android-rn.ts:316 \u00B7 src/resolution/bridges/expo-modules.ts:33 \u00B7 src/resolution/bridges/flutter-channel.ts:282 \u00B7 src/resolution/bridges/native-views.ts:52 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a99861b98dafb213e70824e504856d12b85f4787a380c06f84600e99e9ccbf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/resolution/bridges/native-views.ts:122 \u00B7 src/resolution/bridges/turbomodules.ts:85 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ee5779607bf572fb90350566be555a92a2436c993246980a51eff8e8af7ced"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/security/dep-confusion.ts:83 \u00B7 src/security/dep-confusion.ts:112 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/dep-confusion.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f5be1845c2b69f70935fa8f8670a13514d8cbfdc7aba2d3dd94f96e523b763"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/security/integrator.ts:50 \u00B7 src/security/manifest/plugins/npm.ts:264 \u00B7 src/security/manifest/plugins/npm.ts:372 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f73d076f47e40f02c3c4dbe2d9da3adfb5f472e89a7a5e1c10970fe17cf3f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/security/integrator.ts:86 \u00B7 src/security/manifest/plugins/npm.ts:448 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"744d8cb8b590b0844fe598e0c1b74588130ccc5775bc8298ba1a188dc4c13f79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/security/manifest/adapter.ts:148 \u00B7 src/security/manifest/parser.ts:384 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5949ca589e11503970e6b9203a0041a4dbfa1ebdc4a1a1c71bd1b530fead883e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/security/manifest/plugins/gradle.ts:169 \u00B7 src/security/manifest/plugins/gradle.ts:258 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/gradle.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35a0ceaaf1b8b245456eea6917df9c14ca1c944fe4a125c3d9d32be0882282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/security/manifest/plugins/maven.ts:263 \u00B7 src/wiki/schema.ts:77 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1943aadbe7c2e2d857f941740a9066fee72f92c18e20f1f0150b619eeb8dedd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/security/staleness.ts:66 \u00B7 src/security/staleness.ts:77 \u00B7 src/security/staleness.ts:89 \u00B7 src/security/staleness.ts:97 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/staleness.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe3f06f013c68009bf70a1c36600a0e1be38e251324185c5bb7a3a26a47664"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/compression/filters/aws.ts:203 \u00B7 src/compression/filters/aws.ts:279 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"557170bc370be25868ccae573565f700bf4e11a2946da70ec4d3199655c62a13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/compression/filters/aws.ts:302 \u00B7 src/compression/filters/github.ts:41 \u00B7 src/compression/filters/github.ts:103 \u00B7 src/compression/filters/lint.ts:310 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6da07681e4a7d30f4f0c63ba1a7d2a9caf43b841e7c503b6ab2a1509d10aef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/compression/filters/docker.ts:95 \u00B7 src/compression/filters/files.ts:134 \u00B7 src/compression/filters/lint.ts:154 \u00B7 src/compression/filters/lint.ts:267 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/docker.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"684acac81b2a53748df1c9a7f2428b4b208071c4fd3b45dcc1f8ef1345276b5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/compression/filters/git.ts:243 \u00B7 src/compression/filters/package.ts:157 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d843ae9a8c9b6bede09f68422d352badb3abaac871254f5acb5842c98df6915"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/compression/filters/github.ts:107 \u00B7 src/compression/filters/lint.ts:233 \u00B7 src/compression/filters/lint.ts:253 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/github.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab94167c9496f1be28f0e8fca2e1452dcbe0db3c98f4e7f2edc0c15f32ac01f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/compression/filters/lint.ts:40 \u00B7 src/compression/filters/lint.ts:48 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"128c386ee2f7f09f8115e55095294f76a89dc8b7cd3d9e8d86e408045960faa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/compression/filters/lint.ts:135 \u00B7 src/compression/filters/lint.ts:179 \u00B7 src/compression/filters/lint.ts:289 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9d169e3c9a8fe845d1973e253b8f175afbce19e2e92cc6924625ab407278be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/compression/filters/lint.ts:154 \u00B7 src/compression/filters/lint.ts:235 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20a556681303d48a07dd2b0472eac6c37f0cb72118cc40dca45f37d2a04274a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/config.ts:637 \u00B7 src/config.ts:662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"79873179a7f1e6bbdff581bd913e4c3ee10117841db8a71408dad9de25c11e86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/core/pipeline.ts:601 \u00B7 src/index.ts:174 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8901de7f2c8761cdde275e57e94148c9aa682c567b376f671ff6b5cb44006bab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/extraction/extractor.ts:465 \u00B7 src/extraction/extractor.ts:1006 \u00B7 src/extraction/extractor.ts:1024 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd265253dcfdb9290fdfe1088de60effbccfe4c4e172f5d366553995749e515d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): src/frameworks/elixir.ts:20 \u00B7 src/frameworks/python.ts:23 \u00B7 src/frameworks/react.ts:33 \u00B7 src/frameworks/ruby.ts:29 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/elixir.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6e9b8431d91a728be53cccab0885f73c026e376ef4a8cee83321fb2e978ef1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/frameworks/express.ts:40 \u00B7 src/frameworks/laravel.ts:41 \u00B7 src/frameworks/laravel.ts:47 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/express.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6caf18007b103250259a633511b2ac6db525d5c5be20ffd8d57bb3d607c120c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/frameworks/go.ts:13 \u00B7 src/frameworks/solidity.ts:13 \u00B7 src/frameworks/terraform.ts:19 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/go.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"20112883fcd37c55d782aa3c842a87c4b9ab19cf276344c51770daf2e96f1274"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/frameworks/iac.ts:243 \u00B7 src/frameworks/terraform.ts:55 \u00B7 src/frameworks/terraform.ts:74 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8eed8e42280ef0dd6b3483cc83a62313f0dd7ef989f668290eed89e07a3348"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/frameworks/python.ts:40 \u00B7 src/frameworks/swift.ts:37 \u00B7 src/frameworks/swift.ts:73 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/python.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c0abb8bf385bd9875c652534a4578294531b120702a63f49098770720c8fad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/frameworks/terraform.ts:31 \u00B7 src/frameworks/terraform.ts:37 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/terraform.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1163fd9677be51a342798110284e512bf33b4fd061fdc15c3df98d9425f6dd08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/graph/communities.ts:193 \u00B7 src/graph/communities.ts:381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d644d6f6bea3182116f8c3a4bfd82a8c52eda6018dae132aecee70f1d82cf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/mcp/handlers/code-health.ts:297 \u00B7 src/mcp/handlers/code-health.ts:322 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d027dad18400706b3aab335472e133736c6779cb01d1b1b60e2f812dfddc19cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10 locations): src/mcp/handlers/core.ts:304 \u00B7 src/mcp/handlers/memory.ts:111 \u00B7 src/mcp/handlers/memory.ts:136 \u00B7 src/mcp/handlers/memory.ts:170 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e35792e7118d65758a398fa895ff86e2a2c27fea70dd6fae26e665f9d3f5b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/mcp/handlers/core.ts:574 \u00B7 src/mcp/handlers/core.ts:599 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4275ce16f265b34163f4f9751285e3e4178a04ed6beb0ce1cb3c26fed928e1d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/mcp/handlers/data.ts:207 \u00B7 src/mcp/handlers/data.ts:270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6f0923d0e8688f2dfdbbb6410a945b279c26a6a1719171493bb1a77d0278fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): src/mcp/handlers/docs.ts:3 \u00B7 src/mcp/handlers/memory.ts:5 \u00B7 src/mcp/handlers/patterns.ts:6 \u00B7 src/mcp/handlers/security.ts:4 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"836b973054cb7af8178748ed7eea257a8de62dc28b3b92d7fd8ee1eee53c3db8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/resolution/bridges/swift-objc.ts:31 \u00B7 src/resolution/bridges/swift-objc.ts:77 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/swift-objc.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf8fdd6f5f393e2a7456e781bd726e0094905d3e1623b65387f47f4d8a2b387"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/security/manifest/plugins/pubspec.ts:220 \u00B7 src/security/manifest/plugins/pubspec.ts:350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ced8577c3adb8734e48fa81c8575e0c3bd49199bf6046f5db139de90e6943a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/vectors/index.ts:316 \u00B7 src/vectors/index.ts:473 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee8771275dcafe7b6ef371c4e58a6593171e3a5c14850bd4c0de2f4b05bb76"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: src/extraction/grammars.ts:136 imports tree-sitter-wasms/out/, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"de64cc0ac7713cd0a1eae3feb87fc379a1cd3ce21f6895cd5ba55478847c49b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSecurity (cyclomatic 210, cognitive 448): handleSecurity has cyclomatic complexity 210 and cognitive complexity 448; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd7721e4398a233d4ede7f4898754392fac0a7e98b41d6ec5469c73ca1ff951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateConfig (cyclomatic 190, cognitive 205): validateConfig has cyclomatic complexity 190 and cognitive complexity 205; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2d7bf01ec133c93b9c4ff11a9ab904d5a9b5982cdb1ba1c5129279af775966"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCore (cyclomatic 164, cognitive 365): handleCore has cyclomatic complexity 164 and cognitive complexity 365; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"638abd92b1c88a902c49a81664dde7681369f937f2cf6929625b3831348796f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCodeHealth (cyclomatic 123, cognitive 215): handleCodeHealth has cyclomatic complexity 123 and cognitive complexity 215; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a238b224715a69db781a79215455a506c9d6d4ad081002482a2af766e37d36a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getLanguageSpecificKind (cyclomatic 113, cognitive 162): getLanguageSpecificKind has cyclomatic complexity 113 and cognitive complexity 162; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c45aa96097fcdda8409051f3a97aad05d47f5be7b667063dee8c600e707fc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleArchitecture (cyclomatic 100, cognitive 230): handleArchitecture has cyclomatic complexity 100 and cognitive complexity 230; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f783ce649de4f199c4ecf22c1beea4eb6fbfcbaebc9968260d7cc98652384bbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMemory (cyclomatic 88, cognitive 124): handleMemory has cyclomatic complexity 88 and cognitive complexity 124; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8254245933955605f1f6a213a383edb0afd7112335e45eb4a4d3f2aec4bc168"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 86, cognitive 137): dispatch has cyclomatic complexity 86 and cognitive complexity 137; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c329ce92866c6aefe0d45ced3b0d87ed3a00d3d33057d94045614fe30b3b11a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleData (cyclomatic 78, cognitive 138): handleData has cyclomatic complexity 78 and cognitive complexity 138; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7642d00da568821e61ce5b87ee38222686512d5fe9421de9a9b87246b21ab637"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleGitContext (cyclomatic 77, cognitive 172): handleGitContext has cyclomatic complexity 77 and cognitive complexity 172; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dae90bea61af866801b737b0616bcfba66e4b919dab7174615af1aa840521e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleComplexity (cyclomatic 76, cognitive 133): handleComplexity has cyclomatic complexity 76 and cognitive complexity 133; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/complexity.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f5c2d86756aa4f3601df02a3bd268cb776350cda3e7611c77b9de18029208c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 66, cognitive 116): analyze has cyclomatic complexity 66 and cognitive complexity 116; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/index.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c41bf133f463dae7a50f47ae27e5502a589b26ae82ceb9fa33356749473678a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncNow (cyclomatic 66, cognitive 113): syncNow has cyclomatic complexity 66 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0859e0718700a1d0b7cff6875150a539c187986a1438a6a964b0e0a81cc135"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWiki (cyclomatic 66, cognitive 104): handleWiki has cyclomatic complexity 66 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fbded66dd29adb31b3e14612f84c250a4ba854a433e12172ac3215c7ea2484"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractYaml (cyclomatic 63, cognitive 153): extractYaml has cyclomatic complexity 63 and cognitive complexity 153; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdd70a4ade526422489d354b48fe87dff7fae20259758b2c653f92d83df3caf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePatterns (cyclomatic 63, cognitive 121): handlePatterns has cyclomatic complexity 63 and cognitive complexity 121; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0fd338ffa4ff7ae48347c95f803dd7c699be51b1ae7b0b8f315158b2e7769c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function embedAll (cyclomatic 56, cognitive 82): embedAll has cyclomatic complexity 56 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fb7f027f449544847e0a713d85c7b029be8d877f8d1acba8e8f8076ca6c700"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexAllNow (cyclomatic 54, cognitive 96): indexAllNow has cyclomatic complexity 54 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa534eb16ec0f78570b4439b7471e635b018c029de8e89f8ddd61714738be9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleEditPrimitives (cyclomatic 47, cognitive 110): handleEditPrimitives has cyclomatic complexity 47 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c76680afd9109c50f24b301e0f528021c237e31542f34550105681f79ced3ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractImportSource (cyclomatic 44, cognitive 89): extractImportSource has cyclomatic complexity 44 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"7989593c4b74cbffa597022e3c8a0fdbb927e80e0ad354d2b71213733255631a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function estimateNaiveCost (cyclomatic 43, cognitive 9): estimateNaiveCost has cyclomatic complexity 43 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/naive-cost.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"53035649ef78ea944d44de4b3731721a3588238fc2412d100be580f8d6cd1baf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 41, cognitive 87): resolve has cyclomatic complexity 41 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/swift-objc.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0899f0a70ba9d10c3e52e046ef95491a3df48b0a6ded2451c3fff340dce02bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 41, cognitive 68): initialize has cyclomatic complexity 41 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d07ebcdf87cedbd3cb9a4abac75c474559eba8ae933fba5a9ca07990912a20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveUnresolvedRefs (cyclomatic 39, cognitive 106): resolveUnresolvedRefs has cyclomatic complexity 39 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0bc7bd5ec6c139561654988e9fc571f55dcdb10957142ec7b759b7181a2246"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectCommunities (cyclomatic 38, cognitive 69): detectCommunities has cyclomatic complexity 38 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e329cb80a35aff615b6c867ff89a3c5866ef79533832b2146ffd1699a6d8073"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterGitStatus (cyclomatic 36, cognitive 56): filterGitStatus has cyclomatic complexity 36 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b955e3afeed5a09b7324f07941f254c13b4db96b5c9d68892b2c680063ecaa3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAgainstSchema (cyclomatic 35, cognitive 56): validateAgainstSchema has cyclomatic complexity 35 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/json-schema.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"873117ca44af4acb16d0bc43788d93db027ed56f21c12164b084abe6ef70576a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNativeViewManagers (cyclomatic 34, cognitive 76): findNativeViewManagers has cyclomatic complexity 34 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1487c2d69356d76c86168f1271ccc4347489f058b4255c00f0bdc0d88b9cc23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractHcl (cyclomatic 34, cognitive 74): extractHcl has cyclomatic complexity 34 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c08fe4e2cd1c6c4c4db2e7f672fb5628d66aaf93c6fe56693ddf1f36f1d8eb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNativeImpls (cyclomatic 33, cognitive 68): findNativeImpls has cyclomatic complexity 33 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/turbomodules.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac24ad674d30f129d58764c619f40b429691bf263d1b99fe1aeecb2926be3c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFile (cyclomatic 31, cognitive 40): extractFile has cyclomatic complexity 31 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"033d258d1ffbaca26f93f5c5f41664afe3a57e51427516a09a95925f01942b94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleBranch (cyclomatic 30, cognitive 63): handleBranch has cyclomatic complexity 30 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faf1b7918fd7daf79a7388c02694998d69f51f6560618f1bb97504fa4c0d5b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleDocs (cyclomatic 29, cognitive 56): handleDocs has cyclomatic complexity 29 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"11419712bd479d2179acf14adbe429d353c48316eb7a9d7f88cdce84463017b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractName (cyclomatic 29, cognitive 54): extractName has cyclomatic complexity 29 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a00dde432001d0bc524d24b560ba1203fd6cfb482891e53c85fb6b366747525"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTransitives (cyclomatic 28, cognitive 79): resolveTransitives has cyclomatic complexity 28 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8f6c3ad850396c3b41e4ec1b2139018b48de6ae071477116c077a8e251e32d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refinementPhase (cyclomatic 28, cognitive 69): refinementPhase has cyclomatic complexity 28 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"716fcac699b0dd1006c149a652b3e381a73aa13cca53a7cf55fb3f6248e0538c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNpmManifest (cyclomatic 28, cognitive 51): parseNpmManifest has cyclomatic complexity 28 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"255560ce5ef37aefd6da1ec82944027fae6cf12b35fceb46d6ae4106f4f4fc32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sampleHints (cyclomatic 28, cognitive 49): sampleHints has cyclomatic complexity 28 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3132854bd23a1a54902844ff8c84e38c7b3ed0dd7d1dad4763cf9b5d866d78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quality (cyclomatic 26, cognitive 35): quality has cyclomatic complexity 26 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3921e9ef55b241e5562f7df3c455c1a2a2049591c4b668917a64d5aaeebb95d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 26, cognitive 27): run has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/pipeline.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a039ed63b544937fdf354e37750c379cb1905d4c3b3f208b021ef4410c23531"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDiff (cyclomatic 25, cognitive 49): parseDiff has cyclomatic complexity 25 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/git-context.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e6ffa57aba4ced87ebb1a345dd76b22ae270a1445645c40f0e70bdd9f2f629"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addBatch (cyclomatic 25, cognitive 45): addBatch has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/profiler.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"820cfb0b85b94b914df3b9da2f02ab6234c1f34e2ac2c1456a5cfb9006508c64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMavenManifest (cyclomatic 25, cognitive 42): parseMavenManifest has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb4cf61abfa299f496cb7936e0c6185873b57f01b789de668e8ee9c1c7f1445"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMessage (cyclomatic 25, cognitive 35): handleMessage has cyclomatic complexity 25 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/server.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"db06d7d551502da7041219667eb839d9d8ed0e44b84d18794259e5a70771ae93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeRisk (cyclomatic 25, cognitive 23): computeRisk has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/supply-chain.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"857b4ab047bad62a88a2de968e3ec56e40933e874c557c7dc7f9a14c69d0778e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractVisibility (cyclomatic 23, cognitive 44): extractVisibility has cyclomatic complexity 23 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8c9dd7c26c30baad52caffdcdde424cd67ec5186a5931f6028119dc0e58d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWatchmen (cyclomatic 23, cognitive 34): handleWatchmen has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/watchmen.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c0616f13038f997aa2033dc99dd0c20370090b09160a4fb878b71a1838aeb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replayJournal (cyclomatic 23, cognitive 32): replayJournal has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/journal-recovery.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00dddbfb4f1db37db469e5a428e4c1d44ce7e2c334c8b6e65e631b7358bb9ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 23, cognitive 32): analyze has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/attack-surface.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39b3c06de50dca62d2ffbdfea35d937adfa633404bd0d2ce6ff2e79821a5c75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkTree (cyclomatic 23, cognitive 30): walkTree has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc5f4e16603c551adb9fa6e032563bea8e71cec83d38c769d77ca7e27c1857a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNativeMethodDecls (cyclomatic 22, cognitive 50): findNativeMethodDecls has cyclomatic complexity 22 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/react-native.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a4c1886d25cbc50a4ce3bae5fc806517ba881f63192757c3add382be1546df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getChangedFiles (cyclomatic 22, cognitive 46): getChangedFiles has cyclomatic complexity 22 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"060ed669c3ace6b98af38472dfdf0efdcc36e4211a6b25510a14add6587ab00c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintWiki (cyclomatic 22, cognitive 45): lintWiki has cyclomatic complexity 22 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lint.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c14332b92ec7031674320f3cc77d3f9ecaa7cc4457d7b95d33573e49f414c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findSwiftHandlers (cyclomatic 22, cognitive 41): findSwiftHandlers has cyclomatic complexity 22 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c78549bba8007ccb8fd4192b5268c5487e55d74578489e89449ff96788f0309"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRelevantContext (cyclomatic 22, cognitive 38): findRelevantContext has cyclomatic complexity 22 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbf829d963e8e4c09ad3aa37f3b663dcabdf5c061506999d3732ef4336f4622"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveImportPath (cyclomatic 22, cognitive 30): _resolveImportPath has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c661b310dd9df517b9ce4613a23963edc9ae86cbb0fa61f345f2c1bbd3e1b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localMovePhase (cyclomatic 21, cognitive 39): localMovePhase has cyclomatic complexity 21 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"538ac942af789e833ca1d047aab5db8946dd939f3dad160c0340b535a6466be4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNodes (cyclomatic 21, cognitive 29): extractNodes has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/ansible.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a929defbc0347f0504239592b4c4410d96a32264761339c277840ca35c9c8254"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 27): (anonymous) has cyclomatic complexity 21 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c5b480b6020240575f017be62a8c8ec13d949387dd8c87aa8717fa234631e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateColumnSummary (cyclomatic 21, cognitive 24): generateColumnSummary has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/profiler.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2da1cb0aed23a9a43bfea927e2472a0300dc2df98518627705d6908a0b5d2bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterLs (cyclomatic 20, cognitive 38): filterLs has cyclomatic complexity 20 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0c4c5e91b80924cbb4e28f7384fb20098a5dd6746ed4e24643a2f96dd7c625"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterJsTestRunner (cyclomatic 20, cognitive 24): filterJsTestRunner has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9027279a589d63f7efe4190d02de8454d37ea8bd1aeb2c43d08cf2164c86ecf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyFix (cyclomatic 20, cognitive 24): applyFix has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/runner.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f9c65a10578c6ec79151103d263ed6d5dca82b5f66adf610af580bdeea173a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function embedNode (cyclomatic 20, cognitive 19): embedNode has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c7c0e9504e2874b63e1901c8953b0cead3670e8be12670ed60a789c5def12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findEventEmitters (cyclomatic 19, cognitive 51): findEventEmitters has cyclomatic complexity 19 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a793cca20491872762af6c8a52ea7a4cd39132d1e6cb22837260b6952b9429f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterPlaywright (cyclomatic 19, cognitive 30): filterPlaywright has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"48149626eaf2bbe8e470c2e806ee60ff2d78a7f9aae7d9bcd76cdf0b7006e823"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWhereClause (cyclomatic 19, cognitive 18): buildWhereClause has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/filters.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0fda60a8e5700099af47b175f28861a623c97a0ecf713c2c47592e492eaed3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractInheritance (cyclomatic 18, cognitive 60): extractInheritance has cyclomatic complexity 18 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8ef1e0fb55d22c6c00352601fc346cf9f118c8be797f324e530eab74e2d924"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDartChannelCalls (cyclomatic 18, cognitive 36): findDartChannelCalls has cyclomatic complexity 18 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f2cefc23d60f19cd04e05eec237be0efbaee69cb98f7a6e6605337cd635892"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSequence (cyclomatic 18, cognitive 34): parseSequence has cyclomatic complexity 18 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/yaml.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b72d8c59f9c8e81bc225ac80ae4c272c0b701fc5c7e7f9fe30487df216912d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workspaceFingerprint (cyclomatic 18, cognitive 33): workspaceFingerprint has cyclomatic complexity 18 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/state.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8f57ba177931c46908c3c4cc1482bb6116f56c1f8f35a54bdc3a31cfc33f72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFile (cyclomatic 18, cognitive 25): readFile has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e87afed0a8eb41fe2ed97316bce7ac16d67420d9a8dc3954b4fc1a9420d964"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 18, cognitive 24): parse has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/json-array.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f44d63007b92605fb50319ced2249a7fd257fcbd1fbf44f66596115875e0dc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterCargoTest (cyclomatic 18, cognitive 23): filterCargoTest has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c197a09e769336c7095d9dd40a380015b22c1e0407d8504a7223da15780823"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTransitiveNpmDependencies (cyclomatic 18, cognitive 23): extractTransitiveNpmDependencies has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"830cea203d410cea267b96d94a1488b33d326072c94eaaa8cb67850d177ee3b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function store (cyclomatic 18, cognitive 19): store has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/index.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d9400bb8a6075f61a730fe31bc1bd9d169f6d901d4164a7d2bd80a84bb02a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processAll (cyclomatic 17, cognitive 36): processAll has cyclomatic complexity 17 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/health/mock/src/processor.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"149e772aa122a577248a920e6a990fac38a4244731fcda1007a1a5cf55acfcec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlock (cyclomatic 17, cognitive 32): parseBlock has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/yaml.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1badc4daf84fa981bf8e0486372b553387645bc04607aeb544dce441c99561f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDiff (cyclomatic 17, cognitive 32): applyDiff has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/ingest.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74faf550014ce00eb5c5ee4b59e4f4091289938a996080b28cc5cba9a4ee400"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRubygemsManifest (cyclomatic 17, cognitive 30): parseRubygemsManifest has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/rubygems.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef85451874ca80f4e2f84e3b81ec014795e1e42fd4659b120609aa397e01771b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lint (cyclomatic 17, cognitive 27): lint has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/lint.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6375d0bf501a6e1d63b232dc135ce6a84fda77d28ead6d5bf75b548bcdf1d16e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findKotlinJavaHandlers (cyclomatic 17, cognitive 27): findKotlinJavaHandlers has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b398fd54320de9e9e1d57dadf9f46df9e9bbf119782a0bce7b24a6bcacd555b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterTsc (cyclomatic 17, cognitive 26): filterTsc has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f99a132eb1b3417c9cd9ee05d23e0a97ec9513ab28493be769249722c19ee70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 17, cognitive 24): resolve has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/angular.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"40faf7bdedac52ea1d8ebb4514e755d9c7ccb0a573ae8d3bf86144a692a133ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 17, cognitive 23): search has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/index.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae690b2cee3806445729c969e4ba875a4c89c4f436b1d6846ca4991df376524d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ws (cyclomatic 17, cognitive 22): ws has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aba4319ff78291047fa1a31c1c765815f7b2645e5c6ec74ad755e1fc9ab886c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 17, cognitive 16): visit has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6104c1e20b10921ce689446d4f643f0687f4c33c46c1bf0276d9ddb6aac5e334"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregate (cyclomatic 17, cognitive 14): aggregate has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa164cd306afbff0f657b75715be7389a85aa91f5a20c3b5eb127820c4d3572"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 16, cognitive 34): resolve has cyclomatic complexity 16 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8efd3ebc74259568ab55235d3591a125011d6105fbceb84afcd10ca0e57676e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveUnresolvedRefs (cyclomatic 16, cognitive 32): resolveUnresolvedRefs has cyclomatic complexity 16 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaf47b105d19dece9e5d2c05edaa5073b261f8a860741556158e175d3048ab9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findAndroidNativeModuleCalls (cyclomatic 16, cognitive 32): findAndroidNativeModuleCalls has cyclomatic complexity 16 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4babd3936c14775ecf0577ffd8b39d0ba3f579921fc9d396a28339af76b3339"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNodes (cyclomatic 16, cognitive 31): extractNodes has cyclomatic complexity 16 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/react.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ae197dce2a822f1715813641c6b69fa827fa5a7d364077c43a4e108c9b55a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSectionDependencies (cyclomatic 16, cognitive 31): extractSectionDependencies has cyclomatic complexity 16 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7329bd7436505dd41214b8a557f19b533876071baa5c20109fb524758a93e788"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 16, cognitive 30): parse has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/python.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aec0f8e62ba09194223371a22bcc6ad836c36692693c91ad46b69ec17dc358b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchReference (cyclomatic 16, cognitive 30): matchReference has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/name-matcher.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc3267600bf20f2885fb3bb90db4a0d6dc6a7c2dea4f9ec34ebb7b8468ca07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getImpactSummary (cyclomatic 16, cognitive 30): getImpactSummary has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/reachability.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd2adc1e110f35b68ecb683870bde3eb832fb2e648f159bd501c1a148ace4f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseComposerManifest (cyclomatic 16, cognitive 28): parseComposerManifest has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e42e4a7dcbfe861072c1afcb2e085a7bd0fa57e7839ff869a2d28159831315c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 16, cognitive 26): initialize has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2277e51582ae9ced115257b5f3a044bde3c50595f06398493415fa5627c59b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterGrep (cyclomatic 16, cognitive 25): filterGrep has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf8f44711332c9ef1791831b671bfcc38e081d07082faf20f2133c7de62c4a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function integrate (cyclomatic 16, cognitive 25): integrate has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d366e2ce04f3b723efd1f1e9d0067669c17cb358a5b0e22cd96dcd1867289e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unwrapDynamoTypes (cyclomatic 16, cognitive 24): unwrapDynamoTypes has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"233e0f964ce9f2a9a39c6bb0f5397f8134a6d7e42eda8b3eb315487e86436a38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queryBatch (cyclomatic 16, cognitive 23): queryBatch has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/osv-adapter.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"798bd6838188de95b07ebfcd5e1c1f272230bcd0a6c6a5522a3f68607518210a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWikiDiff (cyclomatic 16, cognitive 22): parseWikiDiff has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/schema.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b2ccc7b89ea5a5b7fbebe0d0b163ba45800df04fca7ddf1e0ad7d085dbf45d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNpmDuplicateVersions (cyclomatic 16, cognitive 21): findNpmDuplicateVersions has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2f92c588f1fb937f2177cde8bfbff8c0a027889ce806f3f0d870604ffbdca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterGitLog (cyclomatic 16, cognitive 20): filterGitLog has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae25f834eac9da75745808cb03175bd2e688608dbee1b3b32f182971f7d0d92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterPytest (cyclomatic 16, cognitive 20): filterPytest has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ed57956704a97e2f4bb057fea78b2b1ad2941517e03a4591010420d84c037c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeLicenseField (cyclomatic 16, cognitive 20): normalizeLicenseField has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"695ff2b6b5fa0e6512ccd71763197ca19e614f177217aac46361767361e4d079"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterDiff (cyclomatic 16, cognitive 16): filterDiff has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"829bd2b8dafb9382016abf2a1d830b32c47519a431b0bc2f5e5820e89a54560f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swiftToObjcSelector (cyclomatic 15, cognitive 45): swiftToObjcSelector has cyclomatic complexity 15 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/swift-objc.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95ee8d6f41c4d5d7a17a7068278e8e1ce3d245c6ef08f27d27f9676fe478d0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractAll (cyclomatic 15, cognitive 35): extractAll has cyclomatic complexity 15 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a164b35c6d18a145b66ee3dd09645e35bf398bc33c04b795899d6c2579b588ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractAffectedRanges (cyclomatic 15, cognitive 34): extractAffectedRanges has cyclomatic complexity 15 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/osv-adapter.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5a2a5082af3f6e1b37eda9dcf082fd3ce04f201b422e47d7f9f61cf0064535"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareVersions (cyclomatic 15, cognitive 28): compareVersions has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/parser.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"da78128dd8f0729ecbfbdfe0d83d7db5162fb7416a821ba1ad150df20968481c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 15, cognitive 27): resolve has cyclomatic complexity 15 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/svelte.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"da010e03671e017972c5902b8f7382ab667920d5082c271f1392f86a7c533382"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquire (cyclomatic 15, cognitive 26): acquire has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/lock-manager.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b490d1f7b75392935ed1f8776d03d172f84936d466f5893b14a96dc73646fdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePyprojectManifest (cyclomatic 15, cognitive 26): parsePyprojectManifest has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed8c0a5fb84c99e0382c92a876ec6a3c515e82a336cfdb2616476ff55aa0b08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterEslint (cyclomatic 15, cognitive 24): filterEslint has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e32572b2aa43a497aba25a2105153998d00e14168bafd52b3a98d68f0e7f83d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJsonConfig (cyclomatic 15, cognitive 23): extractJsonConfig has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"3175a2f6136d55395aba9db55fe19198b7543da5f7a32cdc69fdf3641fdc6b9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchImportToDependency (cyclomatic 15, cognitive 23): matchImportToDependency has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e76830b186b37cafdff217e90387ec99d768320d9c508a7dd9ff7a0ca8855e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAll (cyclomatic 15, cognitive 23): parseAll has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/parser.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e725cd97e2cc15b365139159da4218c822eb1d5e7e9dc66e1bfa0cf415c586"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileExists (cyclomatic 15, cognitive 22): fileExists has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"483644f904e7d8dadcccccd9ded16f779018b33b9eeb16d08a27c745ad4d8bd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPackageReferences (cyclomatic 15, cognitive 22): extractPackageReferences has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"12023c0285864798600b017d6c44540da0362a99cb2c454d74ad611b15a1c0e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterEc2Instances (cyclomatic 15, cognitive 21): filterEc2Instances has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f022a60a37e54ee20a55f06f499f3541aaaefbcb553e7c43ad0f42921352cfcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNpmLockTransitives (cyclomatic 15, cognitive 21): parseNpmLockTransitives has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5ee033d89366bc9dab75425a96e503ad0ee6f7e98a2773990799731e62c2fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterGoTest (cyclomatic 15, cognitive 20): filterGoTest has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f660025c4371648b08113da786220abe3388adf5b5fece59d69eb27edd76720"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectDrift (cyclomatic 15, cognitive 20): detectDrift has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1a6723ee4397dc4ebdc6246800e25dd3d09984699e36e2f85d2304b47f7883"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadNpmLicenses (cyclomatic 15, cognitive 19): loadNpmLicenses has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d58ab5a9b4db42d7e7bc2e75074d5db414537673ecf64d2b8c2fc7069a75c81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validationRules (cyclomatic 15, cognitive 18): validationRules has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a62c2ffae702d6c7af849106dc94b2ed98d17718e221ee13ede1f655486fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchPackagist (cyclomatic 15, cognitive 18): fetchPackagist has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/staleness.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e87a1bfbef53bf2db9bb7cdf670c5853def19aac0b92904d2823c76e240619"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 15, cognitive 17): detect has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/express.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb2763f8151f487707a59eee4a2347115736cdb27dd656c5bd9e4cf30a328ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeParams (cyclomatic 15, cognitive 14): nodeParams has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b66b2c2916c9f04f7d7e8f5df027db36071de48b8ff0f95682fdbbcbe598624"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"175b6742940fc46bad696355ac4502188e1e714eebd4d66d41140435d3b0cbc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 14, cognitive 34): scan has cyclomatic complexity 14 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/secrets.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a85b53717efcba7561a44a3ab603442f825bf1daa9cb080bbbb1a378cc8d12f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPoetryDependencies (cyclomatic 14, cognitive 31): extractPoetryDependencies has cyclomatic complexity 14 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pyproject.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5640ec999422760157d75d7b34364f540df920ed6a058b5289a0d30f4550063e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPypiMaintenance (cyclomatic 14, cognitive 27): getPypiMaintenance has cyclomatic complexity 14 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/supply-chain.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e00062e26beb867b51d89495d4330a3cddf30089d00e3c10c7ea932a48c823c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function zeroMallocInBinary (cyclomatic 14, cognitive 24): zeroMallocInBinary has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/libc-shims.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c1703ffc7397815b9cb27462a5a0ba75de6fc14e3bab04f315a39b9afff27b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runLocalSynthesis (cyclomatic 14, cognitive 23): runLocalSynthesis has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/synthesize.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"05165ca646db657a7cfc85b1fbaa1e0051cc58dd85506710cd64d3740609348a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 14, cognitive 22): parse has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/jsonl.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded91dbaa10ff2aaf37d7b05637227ea0187ca7d3b3dd4ee51bc00658eeca1f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRoutePrefixes (cyclomatic 14, cognitive 22): applyRoutePrefixes has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"84542e8448b1c52e5e322c27e262d6559186d474baae952692b6ed27bd779433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFromPackageLock (cyclomatic 14, cognitive 22): extractFromPackageLock has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3df370dbb8ccd0ce4570e81f89be90add4ad1a4186e0f611c38aca2b1b1226"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFromPackagesLock (cyclomatic 14, cognitive 21): extractFromPackagesLock has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6b13436dcfc376be6c8940cf29aa1b188b4069f3a84852550a5ece7fef06e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractCallName (cyclomatic 14, cognitive 20): extractCallName has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c6c5ebe63ad58f236434fb2e1648735514c50add12f33c2b50344f2f329168"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterFind (cyclomatic 14, cognitive 19): filterFind has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4e412c6685b96eb60202eb16ae82b4f8e3adee60627391fc8ba1856117106c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanup (cyclomatic 14, cognitive 19): cleanup has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a5b791f047fada6b4400fc2ca52092786321dc08f46b0c9939cdc72a2d0c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPinsV1 (cyclomatic 14, cognitive 19): extractPinsV1 has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/swift.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd96ab36f0af89b933ffd751838d3b8140dd12fb1428cd7db0f352eff37e0729"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 14, cognitive 17): detect has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/kubernetes.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c661d7451f639d86303b82ec96c17900b1779d6bebd6aa06a8d7399c475250e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 14, cognitive 15): search has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7abab427fe7198bb8afa5ecd0d7dc4e856c59277c53e28e1246966a9a63327"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 14, cognitive 13): parse has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/pdf.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cebf3fe64582595a704d2d37a14d5efb6dd5562d6c194f8106c3e2501c1a04c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9bd21fe2a2eb2f516c09b827fb997eaaaaa46629c41f7929c9873afc9dd47b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function traverseBFS (cyclomatic 13, cognitive 32): traverseBFS has cyclomatic complexity 13 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/traversal.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc89b7eb9f58862667acd5d2867fb3e3724d702c119f33dfa88e52bd0accf1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFromComposerLock (cyclomatic 13, cognitive 28): extractFromComposerLock has cyclomatic complexity 13 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"02508655cb4939f79bc1069eea3a598e5cdd892961f816f92ddff87535e3e078"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 13, cognitive 27): check has cyclomatic complexity 13 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/dep-confusion.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb98cae1fb9886e5e54a2fe80287b0b0ee77ca6d8f1a097abef076537186706"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPath (cyclomatic 13, cognitive 24): findPath has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"482e8851d2bb363876051000db6dc8c9d541bd38b19ecb47ec6fc7b153ed6bee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 13, cognitive 23): visit has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"262daaee1dd6b010679adc222d11135820757c744d6712ea4bfdd5bdd819948f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPath (cyclomatic 13, cognitive 23): findPath has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/queries.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f173ce9a43ede66bc6ed6862eda042fdd72af2f3486753b337dd6da9cd0e99ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNodes (cyclomatic 13, cognitive 22): extractNodes has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/kubernetes.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7d3b3aa8d4092ea95aabebdc38183b5b9d84f7a8dbf6cf7d6a14a690494211"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findEventListeners (cyclomatic 13, cognitive 21): findEventListeners has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4209d379650917abfcb61df0accc99b3cad6384eda6f98c23d14f67ee51c1763"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/traversal.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec841da7346603f50e91f956974b9f68da3a3cbb14be334762e55c41103805"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSecurityWarningsForNodes (cyclomatic 13, cognitive 20): getSecurityWarningsForNodes has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/context-warnings.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e712094a9f7d1891ba42ade13052c6f8e38f3c60b281fe15b5a59c8135f0e22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterGitDiff (cyclomatic 13, cognitive 19): filterGitDiff has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb41bc39654fb1486264259400fd331bb781f97ac2b5f9eb877c338a678a12f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 13, cognitive 19): handle has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f3a82839c563fbf446ea2ca5fc75e96b0df0e212495103bf41b2d3d8055b56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 13, cognitive 19): walk has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/index.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f0f8968aa32d32f90c7a3d30093d9bf8aba5cf1a589282aa9cc1c6b90fe7e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 13, cognitive 18): parse has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/excel.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39d89c2e73a58dc6fbb433df7b94a83fa396fb1dd1f53c2f508db57bd36abe6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 13, cognitive 17): parse has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/parquet.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7652595639839462e76825805d904b5595485333742dbf8ad1a2f68bded24f91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function warmCaches (cyclomatic 13, cognitive 17): warmCaches has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3380758c62ed9b24166ac9e1dedc98ad68e9e9256df2c268f5bd4df5354f1318"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDotEnv (cyclomatic 13, cognitive 16): loadDotEnv has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b3a5ed038d41bca2c52d47feeaca3c0cf325e106f9f0d50fff6828aea5166a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMigrations (cyclomatic 13, cognitive 16): runMigrations has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b06c8601affc2de3d775c66a965cdec1b817973d1c1dc8269a392eded902d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getProjectName (cyclomatic 13, cognitive 16): getProjectName has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/sbom.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde17ca4470b297a213e98d25daea56eb5f2de419fcb1321bfa116528b62abd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexFile (cyclomatic 13, cognitive 14): indexFile has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/indexer.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc92a9df3854f14ed312b7855ed8985eb1962145bc22343a0f031a42139bab27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferValue (cyclomatic 13, cognitive 12): inferValue has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/csv.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5474155ad0d2fdd01c57b76394e36a2296691ad14a7b2ec4668afa8f14669f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTypeName (cyclomatic 13, cognitive 12): extractTypeName has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"048259485746fccc930d95f54a5a47b802ddccc2073f231ccf36a2c4eaa6069b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invalidateFile (cyclomatic 12, cognitive 27): invalidateFile has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2abf9b193a5ea0143c9e1242b13cb711aa21a12bd3a7c1607b1ee3deaf28afe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function correlations (cyclomatic 12, cognitive 24): correlations has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b9cde8634548896db67618314473d7421e52e6e1e16320e5cd12058bda9149"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDiff (cyclomatic 12, cognitive 24): readDiff has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ed64baa9d1c8bafe893d9b9ef01f3fe9187e6abaddc0e3d7e5dff31af697b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importBindingNames (cyclomatic 12, cognitive 22): importBindingNames has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4f3880ee01fa56080de4031c3e89a1a22c1fcbff275b55d7d074be6413815d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCargoLockTransitives (cyclomatic 12, cognitive 21): parseCargoLockTransitives has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d388ee1b1477a3f904da3c9b8f66cd28570e4a6ad92f99ec7ba1d9710db89651"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkElixirCall (cyclomatic 12, cognitive 20): walkElixirCall has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a57f385833b3ffb9eec346011c5ececc5aefc80f960cff6dadce2005abffa30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPythonCallName (cyclomatic 12, cognitive 20): extractPythonCallName has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/notebook.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"35356fd1258734aec5ca8fa068e33404326f9237087ce1391cf35ed72931b52c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findExpoModuleCalls (cyclomatic 12, cognitive 20): findExpoModuleCalls has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"48675b6949a8ce7ad1a5c16ec96fa78143411f6f2da8a1667130050c8fbeb7b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNugetManifest (cyclomatic 12, cognitive 20): parseNugetManifest has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/nuget.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f5f42ef0a94cf80f5f8e369417d5f346e18ce5cfd4dd72b29823e2dc6af82b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 12, cognitive 19): detect has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/vue.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8ff1f02ec59dd159620e650717662026039c5c4f4c4a0f798f88071bc43432"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 12, cognitive 18): search has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/vectors.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8090c63355cf5307cf7c47928459f5ec744fad57dd8f1fb4b3d098c1d22cc81e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 12, cognitive 17): parse has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/cargo.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55594978b7184b592684711b5df14e0876f2125469b60d1c787e3fa3cedc6685"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPinsV2 (cyclomatic 12, cognitive 17): extractPinsV2 has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/swift.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb049f6c48928a100c0f8779ca0c0b2a0cba33773b26b09579f4a27ced6f457c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 12, cognitive 17): initialize has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"823727cfb820aafaa9c95703fe01a34389cf9186633a68cde464c90376a8c65e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNotebook (cyclomatic 12, cognitive 15): extractNotebook has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/notebook.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f9fe63dbd7332287207154fe2cd36737a1fb967422e2d36950e01dfccc9d71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 12, cognitive 14): parse has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/scala.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51de10780f47e2f2d65c00862b750452f40dc60b030e6c7037dbcc5984f9f25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 12, cognitive 13): detect has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/java.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f3146f5a4293586fd3f14c5cff83c227ab2cf03618b36d14c4f007808dc3b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compressObservation (cyclomatic 12, cognitive 13): compressObservation has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/compress.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aee5ac31115de4910e834770f55e8c4111b923970888273b3817d499f47ee1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 12, cognitive 13): detect has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82af7ab3e4cd23634fb73ded8a1f7a43f7eada5922a41fb1a49d6a061e6f0ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function join (cyclomatic 12, cognitive 12): join has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c51557c4d3eaffe2073ed5386f884e4e11ea9791b012c27f51fb78d7c2c6ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyGenericArgument (cyclomatic 12, cognitive 12): classifyGenericArgument has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d135e9741e2fbf63716f76a02ffe8b1ba992f89a87928a3ee58a64795a11a10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlScalar (cyclomatic 12, cognitive 12): yamlScalar has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff618f6dec8d9fcc60e7f61292f580c8f158935b3bdb32188780c29d1eb316a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRouteObject (cyclomatic 12, cognitive 12): parseRouteObject has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/routes.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6322563d9bb9fa0a9b56ab8a2d3914ff853f2dc72cdc7f365a1b948e88cdc863"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 12, cognitive 12): detect has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/csharp.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ef206533e1d5685c77a4ab5e3dc55e6bd9388dd2bd0140eec5fad9e42b86e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNodes (cyclomatic 12, cognitive 12): extractNodes has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/terraform.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f2f00815c7ae93bc91099e22c396baa1acca05c84bb8390fac1b18b106ba96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertObservation (cyclomatic 12, cognitive 12): insertObservation has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/database.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"41653036f755a693a932414aba26110f4d4fa3b71248885c6e72fc7e22cbb2eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/remediation.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e802b49a3ccce980e802582b7cb1ba605b603d1b7fc8971325a738348c2ea1c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 12, cognitive 12): initialize has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0416b316d6072c9369dc49cc10fa39251a2880cae4752a674d89e6b6c8a81af5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCall (cyclomatic 12, cognitive 11): parseCall has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/routes.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a36bf49b88527035e0e1ce8595215afcfeb9cfabebade62aa19fcc84f4c354"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAffectedTests (cyclomatic 11, cognitive 28): getAffectedTests has cyclomatic complexity 11 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/queries.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff3e23031bcc01b9b62b953105a1cb296f96f67f797b32fd72a519905f6587e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectDataReferences (cyclomatic 11, cognitive 26): detectDataReferences has cyclomatic complexity 11 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/linker.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a4693dd9dd9ced4cb518e864e3fb95c3df21dbe105eb27291066171f828863"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSignatures (cyclomatic 11, cognitive 22): readSignatures has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff6e8925baa9769cda9a27c1b5814f0b967fcf2a96241747d19763b2c9a97d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reverseBfsToEntryPoints (cyclomatic 11, cognitive 22): reverseBfsToEntryPoints has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/reachability.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e71503322431b5a9fd3f79274a5900cf6c3c1c3424e46ea1f649efe88e1b8ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMap (cyclomatic 11, cognitive 21): readMap has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30ec2fc224a1a861920c583d71110f168d2dcf717d2b4767d1dd8c97ebb3f13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNativeViewUsages (cyclomatic 11, cognitive 21): findNativeViewUsages has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bcc14fea1fa72a0fa7a439f4f9e02737f3b00d701b5fcc26a40247bc84ac0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyAssets (cyclomatic 11, cognitive 20): copyAssets has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba179ef12bdd0ef1d1f463af6ebde7fce76e727fab7e84df082799ecb4c365"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 11, cognitive 20): detect has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/dart.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8e602f39ea4b407384b856864ad558320647b142e58cc31855e803e4e861e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findExpoModuleDecls (cyclomatic 11, cognitive 20): findExpoModuleDecls has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15bdaa8e27ecf6beae0bcf34e19cdbff21d5b8da23d1022db0b7e0244a15803"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 11, cognitive 19): detect has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/elixir.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b76dce0e5493b6999ee42d198bb612956bf46937331cb7c831cf3048111125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 11, cognitive 19): detect has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/java.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"219ce047f2144d35583398c58e2ffc9eb40feb1fd55e3e089e76523796073a26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 11, cognitive 19): detect has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/ocaml.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f91e584ce29095f86a587306051f838dd41775f22c190b598b9744f5420aab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 11, cognitive 19): detect has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/scala.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"84caa8f328b4e7519d5c6fa0c0d91e42b4a1a647072464ad1854fed486a75ae8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFromPubspecLock (cyclomatic 11, cognitive 19): extractFromPubspecLock has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/pubspec.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b769eda458fe667baa608e48b2a0184e568cc2c9635028b5965d7b57d248e385"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 11, cognitive 18): render has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf424d0fa00bc690c10d81ef5874a131c1dcaf7588815e2803b0c7a81535751d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"112ad000bad6da315832011b7f5c6332b6db33a078482295ef6d3b334a4b44d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function object (cyclomatic 11, cognitive 17): object has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1916aab9c60bb86ac5dd3b144b039f4e370cfc12a52eaefd8ede6daddde3d03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkPythonTree (cyclomatic 11, cognitive 17): walkPythonTree has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/notebook.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"360343bf7f9daee4ea236c22cade2b08c28f0fab697ef959c2d2afe39e91153a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 11, cognitive 17): render has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c1a47d7f502c7e5d348381a7b8652791f892de6740d50659fc59c8bff7b449"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNodes (cyclomatic 11, cognitive 16): extractNodes has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/iac.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a01c73e716651c8e0971b176641845d72805d5635364a46ed9f037a6c239fb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichDuplicateVersions (cyclomatic 11, cognitive 16): enrichDuplicateVersions has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/client.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e75c7923b7fb6889196f024d54a80ab563a028a93d7a2f73141a71ab5eeca6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDependencyLine (cyclomatic 11, cognitive 15): parseDependencyLine has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61b3fb4094e403b953d9d422a99bc9302bd816651ce4067411213486c1cc0d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFromGradleLockfile (cyclomatic 11, cognitive 15): extractFromGradleLockfile has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/gradle.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124db6b06b6f17e681c21b14282e70fbc4de1c7b9ca4dcde2c34b154945106b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 11, cognitive 14): parse has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/go.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5b6a6205bd3a0f73e86ccd32b3889ac77f85e8886387e8d9cff7347b266a42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterLogEvents (cyclomatic 11, cognitive 14): filterLogEvents has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5074359fad5d34f16f7a80b12fe35d93f304a02b2de34c019277a1b50e2dcd70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filter (cyclomatic 11, cognitive 14): filter has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/generic.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e91fe28e45bfc93a4d73fce8351bc976576b66186b73f7910148bf4a6274f4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFirstArgument (cyclomatic 11, cognitive 14): classifyFirstArgument has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b8ab9d8bf8f69e7b4d6a9d7cd1bbc73c7b4dadf88d57f7efc26244054b2186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 11, cognitive 14): resolve has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/csharp.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ec0586d8588b33ab668d919f05c26ffcdf97d8caed6ca5de08c73a0d1498a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNodes (cyclomatic 11, cognitive 14): extractNodes has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/docker.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"be25c63530f1b7e01d1a96f69723915e46bed37968a6ab402ae9d2100f7d9e5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCallSitesForModule (cyclomatic 11, cognitive 14): findCallSitesForModule has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/turbomodules.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d855337649a323964cec323b48dec34a63bd1f5ac7be24c9bf6e29acc419cddc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveComponent (cyclomatic 11, cognitive 13): resolveComponent has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/vue.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c43f281abdec278e61a757eed1ffe2985d066910b896c0843e56d350ec39cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectInternal (cyclomatic 11, cognitive 11): detectInternal has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/dep-confusion.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d070b8149c50dc15572e133ef9692235b2f8f8f8efda1f7bc9e226d53946da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 11, cognitive 11): initialize has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turboquant-index.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"92142b54597b0364ca9c7b2f03ced2d0ecf7c06831f9d2768ce98cfa76735a5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filter (cyclomatic 11, cognitive 10): filter has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8baf7f28622782857e4384cfac4ddecdea1fc802bb796b22c97a7a7ff26791d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToNode (cyclomatic 11, cognitive 10): rowToNode has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2756231417714747507d5a2cfe101d695a7d1f083765c380d0502d5aa8c6307f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToObservation (cyclomatic 11, cognitive 10): rowToObservation has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/database.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2842d0445e574c6ffec8db25ab0da93ec78d08b2df1ca7801d7e20b6b09f67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _validate (cyclomatic 11, cognitive 10): _validate has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/loader.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"261f99ad3de8c015a18f3a59b373b4d0bf19a986c9abcac1c6fa40fbe82d9a4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseScalar (cyclomatic 11, cognitive 10): parseScalar has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/yaml.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"947af0f15ffee2e7060745467593ba0ee778eb4a7440a82239945f0e26221304"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe7e85cdb749e63a17f47fcbb73662f496d03a5a84d496137684e9aee8422d3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/extractor.ts: 1397 lines of code: src/extraction/extractor.ts has 1397 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00914f115d6ae73a8673e11bf1035d53068ada9530e28ff6748802e1a0249b2d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/db/database.ts: 1231 lines of code: src/db/database.ts has 1231 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7965cc7693c1168c49cfd759cf44a9b98c1690e999b24fa9d2e27229eae57b8c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/config.ts: 1051 lines of code: src/config.ts has 1051 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"388dfd6321d1627cd6f73f52de917525bc8cd144c6ddfd80aa21756dad98c75f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/pipeline.ts: 769 lines of code: src/core/pipeline.ts has 769 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"511d0e43b232475df2ec9b3dfe5570a2cc345f7368aad9147ee3cb15e69e5c9e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/handlers/security.ts: 759 lines of code: src/mcp/handlers/security.ts has 759 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"863a12043bfacf2ea324b8e25815bf97d8b2e385bac343cc768f6595518c0d7d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/index.ts: 682 lines of code: src/resolution/index.ts has 682 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda4dd67fd4b7e3c3e32555ee6e836b332ac7250675709423471e7e2b55721b1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/extraction/infra.ts: 635 lines of code: src/extraction/infra.ts has 635 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c58939f41f4ad282b11aca56f6c7d23ff489b8f00777c55e9a734b82e5aac8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/memory/database.ts: 613 lines of code: src/memory/database.ts has 613 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"837a07ac71a298ca9adfdd182d81c1d530eec5a13deb42990c7520ec25538436"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/handlers/core.ts: 608 lines of code: src/mcp/handlers/core.ts has 608 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b96cac816ad8cfc5dc795de8a7f92081c133e8e5141ab1350ac530a6211479"}},{"ruleId":"R3","level":"warning","message":{"text":"src/security/integrator.ts: 603 lines of code: src/security/integrator.ts has 603 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb044bff04656cd87b6ce6addcb1aff5040a70c0ab2ed82e559935cb394299a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/vectors/index.ts: 575 lines of code: src/vectors/index.ts has 575 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20558bcfca8733916cc2e71a0f7b203350ee0be56feb6d676e6c3f5aa570672a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/data/queries.ts: 565 lines of code: src/data/queries.ts has 565 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7d9d4406e14356e82025e18b1163b57a21907f943b58e0ad8989ecf20dcf35"}},{"ruleId":"R3","level":"warning","message":{"text":"src/security/manifest/plugins/npm.ts: 516 lines of code: src/security/manifest/plugins/npm.ts has 516 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/npm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6575aed4f71ae28550c13286f5155aaa6a35391dc64629ad3134da84b638ce4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/security/vuln/osv-adapter.ts: 513 lines of code: src/security/vuln/osv-adapter.ts has 513 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/osv-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3aa67934d2b9b6968d3e5dc430b418d18404ef1e6703282b828a926ed3864e2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/mcp/handlers/code-health.ts: 511 lines of code: src/mcp/handlers/code-health.ts has 511 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b85512be277aea14e186822e775445a9469c2e32da70ce9f9ba35fd9c95262"}},{"ruleId":"R3","level":"warning","message":{"text":"src/resolution/bridges/flutter-channel.ts: 497 lines of code: src/resolution/bridges/flutter-channel.ts has 497 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/flutter-channel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec116f7633decadc34a4b36acd18ebb5f0b11fe47e719215d91831e7a5cb6438"}},{"ruleId":"R3","level":"warning","message":{"text":"src/security/vuln/client.ts: 497 lines of code: src/security/vuln/client.ts has 497 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41124a88f89fff96efc8993fcdbb5a9a72e656451212b82039243ecddb67b73"}},{"ruleId":"R3","level":"warning","message":{"text":"src/watchmen/synthesize.ts: 496 lines of code: src/watchmen/synthesize.ts has 496 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/synthesize.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29865fee5391c676ce61191dace1714efacd462c4d74d11d87f4ca427498342c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/memory/index.ts: 460 lines of code: src/memory/index.ts has 460 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c0798f6c71edbea711efbaabf0bd260aebdca5478e1a987574202a33ed25bc"}},{"ruleId":"R3","level":"warning","message":{"text":"src/security/manifest/parser.ts: 447 lines of code: src/security/manifest/parser.ts has 447 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4a36dad94629027cd24a5e9ec3ecca054c48fff732c3b82cf59b43ac6e901d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/vectors/typesense-index.ts: 426 lines of code: src/vectors/typesense-index.ts has 426 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"467a5ef4c4fd402e9f775200bae71f4826dda4e2ab1cc6d12f5504b670b65103"}},{"ruleId":"R3","level":"warning","message":{"text":"src/graph/communities.ts: 424 lines of code: src/graph/communities.ts has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90bc3d5592c4437605487ef6a327b5963efff5eeabf20e181c1f50be9bb9ddf"}},{"ruleId":"R3","level":"warning","message":{"text":"src/security/reachability.ts: 408 lines of code: src/security/reachability.ts has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/reachability.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4058b31501f5ef7d375ad8baab4570bd08b80ca7e01b5c8faf9d7c3eb01931c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c4bd118041b5dca04f99d49b1be4649771906a47d1ec143e4b8f1f5d56a466"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"529d28edcdc87299803db6883bfbe31f6f65782d6bbacb8e7bf3b3c627b2ba6e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/queries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b5af847060d18e588bf0c791395fc0b893d4c88b71300ad15d99b82b01ac58"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"762233e1cc4fa19ed5b8b4e69019206fc28f03f2e2d25e51eacd7b8d1d56ad3d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/synthesize.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d121fe404f9b6dfe582f45d16f7a4b0e094848a16b8819868274ce032d4f2b73"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d289303de07e7d190f2f681ec5419e5e15b32a795698e3d8b8a67f521639b01e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"995ff51cc4a69bc07628a1e4e563768ac38320899bcb9117052c8a782d8b0133"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc047e2d81da63dd888b1d223256440eacd05be13441a89c22511f89f51342f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/aws.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee4156f7d284c07dc4f70fb21add7ba3ffeac5416470a449e013294bfc2be6d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ece01a83ff2d529902145d752c6a57770e835b100331690daf9efc823736ba0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/tracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df7eb460d97871fe5b72d2c1d39bd03241f2755b03716403fb518f5365ab324"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/supply-chain.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea81f30b403a00f48fc0992f7ef65e4284f2b41ed18244a9389aa6860caf7d5d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2234601de09e0f6bc37b7489f3868235a30ce5765a6b202b3102cea43b29ceaa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"621fefa7d2e3a7d7a315fbdd1c968904aca5d762438245ce0496a93468cef330"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/data-flows.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d319a68e762a6c6070701dbf51a8b7ee73855d00c48ed575a2af0ebb7900ec92"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85de61aaba5ee71fb3cb284396d247f3820cedaa27328754e11b9bcad6f53ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/lint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d29cd2dac6fcccc58827b12a5054d42070f273b836f03c5ec68228e8909f9e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/prompt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"916a7f592ed6508ed7d7b727671955466866e778c8d7d0f0305c4a499f4247c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/attack-surface.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc22fc293fd5bc1ccf858b4f9843df9d40d17c312ee246cae1570945282ca47"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4575e5b694ca1e0b7cdf673c293d2395cc2d36a05538428a2e04d85522e139d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b1feadc4b2f22d47514da1ca4897cb21c0d3bc92d630d9ac97d06ef9bc7ab9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f267a2c313f05e6f857de4b770c99b654391858cb58dd8a1855f69a77fea23e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/dep-confusion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0c0b94069d1a6a98e39c0dbad07866cd03acc4977e86f0e6a3b1b6cebb7561"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/staleness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c016b143cef3bb0f6594c7253d4a9b9583f996755b688721c5ca0ba08d890b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/sbom.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f4a3efca2cfd899478ace44151febce0e0360d967c44164b50666659475341"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/git.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cea7745a387cecb6d2a63aca3ffd79c8eafc4e8b4d85e5e3a0aa71ed761cec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/ingest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a076a1fc955a663b72f1b9058fac14895d80395e24edf74a7c8135269abea3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/complexity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f9f01435d8cb4f056bb4a65909ac66b963f5cf1fbf1f518fbfd41b77ad8524"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/vectors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9d2c4715357a310eb9f513c49e4d158237904b7ccd36f44ca1bb1dd6ffe624"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/vex.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a639977a1007ee8811865d1be2e8a5acca596a573dcb7a8e1524fd06ebfb526e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd98f05a6c5b38c0d2463b0fb9ffbb9127eeef2ce2c33578cdbd59621795c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68da4cc6cf90b60b9ce196ff6cad5c30375ce8023a096596d87ea2588a956fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/misc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90da26310f4c806978c1ff8e627d840a0f3756aef1dc16700b64129f2b6c113"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/secrets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9762c28af430e5d5e4b2d3309677881c2fc9a5b2035e152246963e0676de60c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/naive-cost.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2896d1cc9810637bd8cbf9d479762b2471887c01c471eec2b8bbed1c15e936fa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1616d0c20ed2f9eec4eedd37ada0b9fea5215c133fe50d648c12915320e1d957"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebf796be789a2950d01a4d5b36c9f8c3d3399f7d2ca5b7d0c9e3815afca2688"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/serialization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf5d0c718ded055361647d2e36af9917442abcb17cc93d2afd48cbb25d5a97"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/compress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6415224f2249f4b879ea12f1af3af8b6eea9e5d8da86133b936f821f2d80a937"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/refactor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbe0e70dd61af33312677fc8984610a4e9eec66cf0ded640f4f7bf2288e2479"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8bd995d7d132aab5eab411fb9473f2537e50a8a8edebc451768893532d089"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a849fa4a10a3b2876fd9592060c73651f2253c6a511e6a2247f6d0a66c00dc49"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/flows.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d288074238526847a3bb3a09077fd4f90d0687f43db2ffc897842e637be73e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c696a484ba7693e69db6fb04d6d2b9cf567f281f17b91e6dac787023ea2f41b2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/docker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced219c23ef2b6ea9d584aeff351b972385674d2cdab8d0b1c70fbf9045f0ca3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/package.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceec4bd3529fdf6fb9ff2d07bb3e4f126f5b600d11ba66af0084f7415c584afc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7df542bb9a18ded311312316ccfd3016681920b8e5be4aa4574a818353d284"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/context-warnings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae45285e0ce62b527b51aba6cf9a2d3d4ea653b141996cfba401e07174b5695"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/remediation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17337e9b3a915e2634e1781176b5210e05df598d5451a0d24362f0cc2e5dbb3e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db13b74a9a475d15c64b350799125cdef527fda2c41e71cb7e534c99fa103b9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29db0941ead57f22dd82839558d5989a74d529d31912e9e69382ad7d23626c2a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/json-schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5467d046e0a69ab4da44a8f93de80c11ecc13de5e0588035def6351ac7858e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a9a3c860113a9bb2d8026a7a0be6d0eeb21d643a4f9573e54489cc2b740f78"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/github.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e49b9b87ecc18bbe8386a17feeeb7fa322356917dcd0aee3f03ba06301d8056"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"982feffa7398bb89dc25c3ac85debbdddd1624e4c54e369ccc26b89069e53e38"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bf8e0078833d0cb3c05459cdf5e9f08af29ee8693f1475f0697fb53cf9c214"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/lint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"718a68f6058edc31905462bf33d2a4b16a95426a5ddd4f2b5cb27de88e5181c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/filters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b365db40a60efbcbdf379b41c44fb25c2abf159ae25f748adcae47ab4b011e54"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/lint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95815342a3258f5be9457dfc2f05e097c60262901dcb52988f780713dcf6d5a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/synthesize.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09b528dd36156099fa4e00e6bd5db5bd639a67cbb8fd84b92f3715575d996e7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/complexity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68026f5cd8e0a02f9439f67919bd11b9bd59f2e3afcc9790c5e9cfa9b896c54b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jev/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1157a50dcebe16d25428a729ef287fc4f2f5ab88d28105095ecbaefe3de15122"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jev/strands-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ac6deb259bbaebd584adb5ced7ef2e9aaff6a131f60dce1c9c49d860f361c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/rename.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3686913b0ecb2ca0e5239c47f9bf052610e154ac3ffdde53943f119fcdac12a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/license.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f98227d291f1d9d07b4f262a315052c7c97476db7696d96c7cdafde841f495"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/filters/generic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a8187b415767762be3951a5285a0eaf7100ee7797f0721e12dc978d9f38cd2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/watchmen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cc11c85345ef587681fddf556bf3b636a68e4c2bb55de9cd221760d17dabd1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/owasp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a909a43db54a3d7e3254400bb05007ba63eecf7dda61c19b8cc3d7565b8aea41"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/suppressions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffe0a90a5f827f450a8f440a3a9f915208a30df2a24b6254cb641e81f6c2956"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb8017680353049dd9cc20f131afcf94101deb9b2f27672fe1f04a4cb23626a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/branch-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad39cbebd3ed4679c196d4e9df8c937bd0915db41724ce4fa0ca742b77614df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"398162d7b9644b5072c3663e8b57a675078aff39d6facf70d782e350b99f62f5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/import-prompt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4659a50677f9aa35dcf09aba9b43f1188075a6221937e60db7ac20f1d632b58d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/typed-pages.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d7a5e408fe08d2b6d69b67a894d587252ac31a96b693bd2ca13e8e2f7808c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5a4d5e10ff088895e6d0d92b6ed355351705bf70baaa71b4e99f73f5552308"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36f1d0fd1e41fc0a4aaa311fd1a6fc62943d79fc91dac0d8c299190f20e8f9f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/symbols.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84e745697b41468cf9a04426da06f488c96a1c83963b751f7a72414387b6c24"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/links.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"748cfef0588294a6b7d13128960b66ded7303d0c018bef9bab1dc693c3a47fc8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/relation-jev.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"174b03bc89d7c35b1d15256c16979f4c878307ffe4313d8e2906edc4a84143db"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/fix-suggestions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d102ff1bcb2598a36416fd73a0e6adc6736dff027736022988dd7fca726090f2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/turbovec-node/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9442776b87e56c82462ee78fd213589d8c5b82b28a3d4203a8d7a094e5ea01c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jev/factory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b601542c52bef30a028516c194a33b1b3ebeb0119cb9c65c6aac08ed70c2bb95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/auth-detection-jev.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82963491d6cf0d71924b164830b0ebf46061208f77ac3f860be85bb42515acf6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wiki/contradiction-jev.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a80a40c1c29dacee2c95fc278e2e63d75d668745ccbcf025e6dc6252d852e4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b03815b97dd9bc3d8c5bab14b9ff1d2d7ed92b690de4c3df145c7a08d2a9d8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/relation-display.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"565db09921fa3f6b8835642cd509e4d6324ac0a7f993a4bb9b126f5d0aff40ea"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1674 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/server.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a0e530263636034dadfba754cbaec6458224b4811c9bdc299b19d2bdbf28cc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~910 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/security.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2314f04704596691b2ce1ac9c02714eaf9ad9cb37ef7ca5cb081a657720f1c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~548 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/code-health.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b6d79d3b9dbe1e8e45c88740b4e6a26b50bed70331dd466d0370552482183c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~505 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/architecture.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/communities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec56eb126a266023863a8ece86891fda43621c6a20f43d78b6a6f563bf2a55a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~428 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/tools.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b84a8f0d42b9ea7ef73fe540e60e6d1c014edfd86b710575b187d48b8385e9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~399 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/supply-chain.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0376762fedd1106058f42ad0745cd26e7d367a4181ff9617272de4c418a1b0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~365 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efce703eb018fd607a4917b0209c15b561b61425937674f4111256bba7056f9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~363 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/memory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"153ad363881be0be39c3dceed5fddb637f1df2aaad9ebd08f5d36a5fbde8cc35"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~349 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/data-flows.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c949e0396950069b82e2836fe2506b3f803bf2f46eaf7ecbd39e633c25c8ed38"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~338 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/read-modes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d180d759e1ff2160d414b2f86cd05f3574c9854273c776e21301145d7add9484"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~314 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/patterns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60c3019410db8e6db184755ec4df71bc381039d4bccb046989a829ec5ddb471"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~311 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/architecture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3105cb9a4e595300d656ba81744b9c4f72c97f109b2e3ea03e94a6c173ed193d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~303 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (src/mcp/server.ts, src/mcp/tools.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/tool-names.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284685bc80be0fb01f10c6564ad3c1e970f67fc8af180abce381bb0698087e6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~295 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/dep-confusion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e495a3db04940fd157d31ad2c907a272233906b235e2e69a5d8a3bbc77fb6a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~291 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/staleness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d852026f3affd7ba8378866866cf000a26e9ca30dd386bb59edd01cc82a879"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~288 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (src/mcp/handlers/security.ts, src/security/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/sbom.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1106c6df5442e6805200b7cbbaf32069ec6d4dbde5c08b2d85f60542710d9915"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~278 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/complexity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c470fa5edbf4b7732b09d2d8e731eb5be193ae264f758cd059fd9781789273"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~268 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (src/mcp/handlers/security.ts, src/security/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/vex.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bc5b1b88d7148290c250989ef25ed018c8fe5b5a2244addaacf90dbabe7ee3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~267 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/wiki.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb6c34f073d9b4e306d42026ddff6b5b7a9240c2c72116c1c197278af095343"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~258 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/git-context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e76e3bdfc70582f5e3a2f0497e618f679b2c90e01b2ad619567a17b3f4dc62"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~232 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/secrets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3532a2f61397528ee26fbe2cdf41e341cf116d1d40be15a1c8467f501477db"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~231 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/naive-cost.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75baa443e3447f145a7502541ebb5ffb3512c097b715e47938c69ac2771b0e1d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~208 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a510cb1d8f7456c7e7092f3a5a1bf5704af37e34a4bd99af5abaf38675f9df90"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~206 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/export/serialization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"069ceb8849806481cddf4ca3f5adf5bd60f08265f2e67888f17a4dd7d45b2c6a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~182 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 3 in-repo import(s) from 2 other file(s) do name it (src/mcp/handler.ts, src/mcp/read-modes.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da0ffbc3ccd9e22874a50182400d21653e5a1aa696bcb24353a1c8ad9d9576c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~177 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/git-context.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graph/flows.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6071e97c9b15ca6ba2b897a263975033c408eb13f18b46316e2d0afb2149eec0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~164 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/remediation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c16ec232b61c851f2a4ed934e242d512263e7b9b9f75501c2a9112398af030"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~161 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/branch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cd4b3e319d31fd01b51a15ceebaf6268cc68cde11c9740db30d51567a86bae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~160 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef301c84b63f4cc9f417be91c7f08ead9996f53135c433ce95c51893dd16856"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~118 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/lint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5bfcc3a1ed3df7b101a43506143443a13dd44b2f6cb99c51160eb8c476cd97"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~111 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/complexity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec45c3cb77bb8caa47bce842a67240f5090092ba9aabc3e642964ca3b395742c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~99 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/license.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcdc7408ccaa1d60eb9b99f8fdbba8098f2aa93973a50dd67ba029c08dbad8d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~93 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handler.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/watchmen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65d33cb1e7e4c34cc290ee7440ac39b76ed82545512176467abdfdafb3531be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~91 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/security/data-flows.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/owasp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7237a5b30c504ae967894fd97844eeb00e5f85b73f537c8bb6912a06fd380be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~89 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 3 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/security.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/suppressions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a396414701fad8b81f80bde3f54670c7f62e457f8a004b7cff18ec5439f2994"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~80 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/branch.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/branch-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff0cfda9d1d2e1320509fe12b27db7738fb6aef7e0433e369147548fa224b3a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~60 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (src/mcp/server.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ccc42c9540c5adef2a3783686230881dd8f9f8e03e84e52643039b15e712d0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3358885723924060fc30a64188d5068850b976a3566aaaee8d93513694afbb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12fc530eae2871c5114a04779c309ac4ba6202bccaf10caffa3853eb10932dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/mcp/handlers/memory.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/memory/relation-display.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0f27c32f9ca301c6c1f5a7a37d9505d13824969067b476587c1d8c2784e669"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d69193d807f3707cccf9df40d417f5740f88388f31c59b94a9eb1673f76d333"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe14da5508914febbf9a3d0a25cb9a6c09d6542fa0b039ef1d3a9bc7eb65fd6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/patterns/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"915c6afe4d5fe75a46df7986ab493b42e41e189dfd2d3f08ad97824d47cd20d7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb614e9f87a0c25af8260e1aa82151cfa0c62f510d65b3c9107412fe1c60f0a1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (49 application, 7 tooling, 102 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d8988063b69268546fe3f218b6229558d6fd97a3931205af81079d32b71b1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAllLayerDetectors\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/index.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3b84667fe8721ccb4f9ffc597a02cd9358ff83dfb9a0c2699f4352fa8a8b17"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027registerLayerDetector\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/layers/index.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f99ed5164c9b6bebd04bcc749fd38620bb52466b796b3b062fac166bf42555"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getManifestParser\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/index.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5e4a0c71f58d98d18c460ec5e62cc3eb9f6e6a437b2e0e92e3465c9624feea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027registerManifestParser\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/index.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83899d843a783d74f11bab31a320e9aa86ce656bee3941165af8a2f3d41a23b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027detectCommandFamily\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/index.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"70404c9014da29630d7b044a3392b91e7e52c62384d0c0b51cc5c797eff01fff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isSupportedDataFormat\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/index.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"75870349f383e479bfcd924428740b7f2ea4c10d2f992926cd8be732ecde0996"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAvailableExtensions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e09913261525153eb6f20154d29f28bd5c3209364dd8a968717783bf1082ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getUnavailableExtensions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/index.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d932454bd82c205eb7b5ebb4d12e38394d34488c5b657009141e9fff9d4ceeb7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_setPdfInspectorForTesting\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/pdf.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1826f8686b4a9a4d9322193f2d929f9670068b2166c9b6eb87b8f5fc94977062"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_resetPdfInspectorForTesting\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/parsers/pdf.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11b8aff9d5d4ebcda88ae451a954ed9f81567f0102873ab85f70103b4a54610"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JoinCondition\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/types.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"259505974acc0dc04081fd8bbf55f6d638724fdd25ce9045a07a6b207b0aabc7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ParseResult\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/types.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d03ec6bb512515856fcc145be62e305b61a54829352eb1581320f08188b8a78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027liveDbWriters\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/db-lock.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c4d062f79437b44630c6bd017f6899d6e9c83a71597e9862317a34f9affe90"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isGrammarLoaded\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5c44eba0a6c21e96a84b5c35ea791bae60a085e1eee8d86a5924074fa5dddd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadAllGrammars\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/grammars.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"53515e9e435e836d8a9bfd06cfe9bf86e1d7d95559323bead65992a8b6030857"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GRAMMAR_MAP\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/languages.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3193556d97cdaa9c6f8b8890af45260b21a69d85d40fc190e08676bc2785f6f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FACADE_MAPPINGS\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/frameworks/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/frameworks/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/laravel.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0e682bc81fe2456cf1504eed0cf6b8a809decdbac8d4ab9cc98027adc4a65f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027scorePathRelevance\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-utils.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2785536d50ffa4fe56303e501a9dd482855c9d6b10c7591e4ae4de868c72fde4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027kindBonus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/search/query-utils.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ff06fdbdea8614e931393614fbac670452a85d1758498319cc0cf83b54260a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SecurityError\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/security/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/security/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/errors.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b173e93e2455fa81ca64a016d88803081a25f6adadd6fa95566d0334af99cd18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ManifestParseError\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/security/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/security/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/errors.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9617ed060bfd3f6cc43c26981460caf89b5912844e7951f4126f7a30cc1829da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027installEngines\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/engines.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd44ffe9d50cfada5e076ef5f0b938a2478943a95f49897d0ac3dcc43808e757"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027installCommand\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/engines.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d427e97537f3a7a435ab22e136908f36953a518921baf83c8a3ab8ab35d213"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clearGitHeads\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/git-head.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f272ba6b90a5dd9cb4fc2dfd1f51883af5d8cd5b5a697b876a2dd098866d9c59"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseOutput\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watchmen/synthesize.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75eeed376b6815746d4413cc68527cebf1be36b452ebe8f70ca18d1cb8286f8"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027projectRoot\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/tracker.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e18a4e88af26b9d55041f3cef4f819ddb8f97ff35c2c7433a1304f4959caf88"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027resolver\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/context/index.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df20d8b7f74eb19a47d29ef71a8c800318e3f874a6e7b3b18c3cbae803a89e7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027projectRoot\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/lock-manager.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"029e52e090507f9fefe2ba8baeaeca8eebc6332dcaf16c8dbbb707f17972c14d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027generateDatasetId\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data/linker.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1ca89c0a1df3b5dcfb8616bec0c24da941c4813c6372808d7b1547fe822906"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CURRENT_SCHEMA_VERSION\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177d38c0168c52aa1d2292e84c50bebe2a3029c4a0a2131a905cc6084fd81e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OSV_BATCH_MAX_QUERIES\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/vuln/osv-adapter.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe607834adb0712511daa9ca20dcabdb40fde8daea35ff5884fcf07f975326d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027kirographDir\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/lancedb-index.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5586dcdd633d2ef4aeabe07a7c3fa74399d914e2503ddf0a7e38959afa68f52"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027kirographDir\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e38ec62696b7b9a8d618c3c668c78f66cbe0b11756e77d3df7555315718ea1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027kirographDir\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/pglite-index.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fad7386107238813f20f2d204b56a62e57cfe3f554e35b256b21319a6bbb371"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_ownedProcess\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a386073f008cceed7cd8ed08ea3cc2e1f907b77910ea75224eff8c94608959d4"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_ownedProcess\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7242ffe8e9663df8a6b5c738a2659260608f0870d31f2381caa9a09a5f4b4a51"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027kirographDir\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbee4dbefd47d4229ffa7c12d27853bfadb5f96b0532bb0a01fbd5b99a2576b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027openFile\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/patterns/mock/src/server.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c64a4e918eab1770964f31cffd16bf66155d39cea8da5d75eba9223aef7f31"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027figlet\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72450cbc2164fc9ab1ae384ebf82dc97c2ac7e0549cce9a2f25dd8189d5ae38"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027parquetjs-lite\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"994bc799998fa142ffc655a0c9c36e6a555681ae60d44e632c420db8188feeb3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027express\u0027: Declared in test/architecture/mock/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/architecture/mock/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aa63b48596842c61cd880d2d1950c7f15346a6c4feeb2fd604f9e41b1b577a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027lodash\u0027: Declared in test/architecture/mock/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/architecture/mock/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"81249d22ffae326aec4bf1289b5339a421b37947aed1f28169ba1f7a10a5ef05"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027express\u0027: Declared in test/jev/mock/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/jev/mock/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cb5fdfdb9a64a1c9086cc32228f61e3c9622a49162cc1f70ea813fd2d5b412"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027express\u0027: Declared in test/security/mock/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/security/mock/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8475116463409d2f1a6b673e2c349a56f0866e79d6cc4a32ffe22559e35e98a6"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027lodash\u0027: Declared in test/security/mock/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/security/mock/package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6a601d067ba41a65b0f2104bdb2e412b7bf8d75dd3fe59442939b168ce0015"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027express\u0027: Declared in test/strands/mock/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/strands/mock/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6396370d4143c9bb05ef14b3ef55fe643cf355eee76b07d9867e8603c5a4ed"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027commander\u0027 in production deps: Only test files import it (first: test/db/unlock.test.ts:5) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6473cd14ff7c94d1dd11f04c2689801e823f65aaa1d7b434edfd2edf1ee9f6"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/extraction/extractor.ts \u2192 src/extraction/infra.ts \u2192 src/extraction/extractor.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0525bdf273e93fe6d71dfff485747249194279331fdd92e9e93b404d8c121469"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/incremental.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e42e926bc6073e9472834dafde710f68f18bedbee151f0b925380f7c14cc03"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/incremental.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4273ae03829481104ce3d80999823283183d0a0d070d6c177c51bb4639bb9fbe"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/remote.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"235b233c0f768b9d6155729e74c64248e1cc91c8de4519d688067a678a27ae70"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/state.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85d4be9ea9a78e82d2e2141b656ef19b8f478233efee87f487c131ee66f937f"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"187599a81bab4224d7563fc52a0db4156761a0367f9ba88538097551f88b6445"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: native/turbovec-node/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/turbovec-node/package.json"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"29885512beaa9c950b641fa7a81bd5e4090fd3402315e5c798a186a5ca9e1e81"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd699919aa591b262d8f4a07a70eed2e90d52ddb856cc6e42aa98540126b06b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: test/architecture/mock/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/architecture/mock/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"991dd8d4480ad16f4ed24c2c50ca098eaf4518c68967fd726da8e405adfc0993"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: test/jev/mock/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/jev/mock/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bd3297fbb185cd108b0623067d062b7ec6218421da78aead3a4b13d1077083"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: test/routes/mock/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/routes/mock/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae423c10901f38b8afcee902279de105f0c78995c0ce1b1cb508a38edd887e2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: test/strands/mock/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/strands/mock/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1668c84d62ddf818bf2521ed38a2cb1df18ed32a8f4bbdc034e7a269cf8d4fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!f.endsWith(\u0027.kt\u0027) \u0026\u0026 !f.endsWith(\u0027.java\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/bridges/android-rn.ts, src/resolution/bridges/flutter-channel.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ce22549e0e6c0ff4f5a84a924e874f1c6e248a98ae9064e6df5e910f7d3d4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!f.endsWith(\u0027.ts\u0027) \u0026\u0026 !f.endsWith(\u0027.tsx\u0027) \u0026\u0026 !f.endsWith(\u0027.js\u0027) \u0026\u0026 !f.endsWith(\u0027.jsx\u0027)\u0060 appears character-identically in 5 files \u2014 src/resolution/bridges/android-rn.ts, src/resolution/bridges/expo-modules.ts, src/resolution/bridges/native-events.ts, src/resolution/bridges/react-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b042a6bd8ae0e6a57fd828ca4e724dd49e5c929b1b3e8343cddc13fb836b9d78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!f.endsWith(\u0027.tsx\u0027) \u0026\u0026 !f.endsWith(\u0027.jsx\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/bridges/android-rn.ts, src/resolution/bridges/native-views.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd477b42e7562333ebdb8ed48c6dbdec35df1251f19c6d20d26e84ab1a889fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!file.endsWith(\u0027.yaml\u0027) \u0026\u0026 !file.endsWith(\u0027.yml\u0027)\u0060 appears character-identically in 2 files \u2014 src/frameworks/cloudformation.ts, src/frameworks/kubernetes.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/cloudformation.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b409d188454635c217d93c75f5a66338a605a5f8e37018b85450c7beebb7e9c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(n.kind === \u0027class\u0027 || n.kind === \u0027interface\u0027) \u0026\u0026 n.name === name\u0060 appears character-identically in 2 files \u2014 src/frameworks/csharp.ts, src/frameworks/java.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/csharp.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fddb6eb5adc2de9af4fdacc8672273931e585aa7b0652d64439972b4662b2d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(n.kind === \u0027function\u0027 || n.kind === \u0027method\u0027) \u0026\u0026 n.startLine \u003C= lineNum \u0026\u0026 n.endLine \u003E= lineNum\u0060 appears character-identically in 6 files \u2014 src/resolution/bridges/android-rn.ts, src/resolution/bridges/expo-modules.ts, src/resolution/bridges/flutter-channel.ts, src/resolution/bridges/native-events.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e49c642f84f094a3e36d6ad1d526ee7240739bb5febcef139c28e512fe8222b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(n.kind === \u0027method\u0027 || n.kind === \u0027function\u0027) \u0026\u0026 n.startLine \u003C= lineNum \u0026\u0026 n.endLine \u003E= lineNum\u0060 appears character-identically in 2 files \u2014 src/resolution/bridges/native-events.ts, src/resolution/bridges/swift-objc.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f5caff72225d3b00d00d41145ea413d5d9bda7754a0f4fe94c5c3577c3f602"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base === \u0027build.gradle\u0027 || base === \u0027build.gradle.kts\u0027\u0060 appears character-identically in 2 files \u2014 src/architecture/manifest/gradle.ts, src/security/manifest/parser.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/gradle.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c3c5970fa8f1104967053a3c67fecf3c52251e93d2aef4462ab2622fba2e16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060call.moduleName === decl.moduleName \u0026\u0026 call.methodName === decl.methodName\u0060 appears character-identically in 2 files \u2014 src/resolution/bridges/android-rn.ts, src/resolution/bridges/react-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/android-rn.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82584615903bba83b27cd703ed23c813c392b17141dfae68babf12784d1ba60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060calleeName \u0026\u0026 /^[a-zA-Z_$][a-zA-Z0-9_$]*$/.test(calleeName)\u0060 appears character-identically in 2 files \u2014 src/extraction/extractor.ts, src/extraction/notebook.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfd9f7d0c8a2120dec029ff27e83eee8a1fe6cfbf07c1e1d8dc945357152f4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.type === \u0027dotted_name\u0027 || child.type === \u0027relative_import\u0027\u0060 appears character-identically in 2 files \u2014 src/extraction/extractor.ts, src/extraction/notebook.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4447b5adc98d58199a46e9ebe20fec44c85410a7ff37c431279e3e674ba266e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err instanceof Error \u0026\u0026 err.name === \u0027AbortError\u0027\u0060 appears character-identically in 2 files \u2014 src/jev/client.ts, src/jev/strands-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jev/client.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d114ddf7475050d7589627bf7b752fd8269ebdaacfb7763d10dae242e4efaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.endsWith(\u0027.java\u0027) || f.endsWith(\u0027.kt\u0027)\u0060 appears character-identically in 4 files \u2014 src/resolution/bridges/native-events.ts, src/resolution/bridges/native-views.ts, src/resolution/bridges/react-native.ts, src/resolution/bridges/turbomodules.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-events.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4d3ba30129c134c7760d62375a3e428a4337a1a54d63b2848a02a02a71fb8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.endsWith(\u0027.m\u0027) || f.endsWith(\u0027.mm\u0027) || f.endsWith(\u0027.h\u0027)\u0060 appears character-identically in 2 files \u2014 src/resolution/bridges/native-views.ts, src/resolution/bridges/swift-objc.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolution/bridges/native-views.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc22482bc3acf144d37a5c5faf9594fdf93c1407ef0a8fff6349524f5348810"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.endsWith(\u0027.yaml\u0027) || f.endsWith(\u0027.yml\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/build.ts, src/patterns/loader.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d866bfe7e748ae974c963167f1e4a2d617b06f5cb99d9cffed9fa1f9a04fb74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filePath.endsWith(\u0027.ts\u0027) || filePath.endsWith(\u0027.tsx\u0027)\u0060 appears character-identically in 2 files \u2014 src/extraction/routes.ts, src/frameworks/react.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/routes.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a7cd1b87137704a34cbd1def9b98bdd88486e21d52c298ffc35cbe84a4da3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gitChanged.added.length \u003E 0 || gitChanged.modified.length \u003E 0 || gitChanged.removed.length \u003E 0\u0060 appears character-identically in 2 files \u2014 src/core/pipeline.ts, src/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3a5b839c6957a909c8b7e2e87598ae0f4012ecee7c53c1821f62f03acdb62f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind === \u0027function\u0027 || kind === \u0027method\u0027\u0060 appears character-identically in 2 files \u2014 src/extraction/extractor.ts, src/extraction/notebook.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"900c3f7e5c9229797b725251d4eed5a5aa378aeb5e0ea94a6ce27ba711e95f8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kirographDir \u0026\u0026 (config as any).turboquantMemDocs\u0060 appears character-identically in 2 files \u2014 src/docs/vectors.ts, src/memory/vectors.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/vectors.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d4a37895677454aff1fef5e0ce13c7f9bec341833ba02c740c5f6bd7ef6671"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.kind === \u0027class\u0027 \u0026\u0026 n.name === className\u0060 appears character-identically in 2 files \u2014 src/frameworks/laravel.ts, src/resolution/bridges/native-views.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/laravel.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ebba720cad91008c6684ac5b1a3c6f7eafa4728012ce4802e32a0b2269cf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.name === name \u0026\u0026 (kind === null || n.kind === kind)\u0060 appears character-identically in 5 files \u2014 src/frameworks/go.ts, src/frameworks/python.ts, src/frameworks/rust.ts, src/frameworks/scala.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/go.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6ffaecc48cfd359902f0f7761235762b3fcf979bad7ca56db9d041c5f01fdb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.relative(projectRoot, path.dirname(manifestPath)).replace(/\\\\/g, \u0027/\u0027) || \u0027.\u0027\u0060 appears character-identically in 10 files \u2014 src/architecture/manifest/cargo.ts, src/architecture/manifest/csproj.ts, src/architecture/manifest/elm.ts, src/architecture/manifest/go.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/manifest/cargo.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f03da7f604bfb6f7409385e26b930cb1a56eb625d765651b2cbd54c8f58bee9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.referenceName.endsWith(\u0027Service\u0027) || ref.referenceName.endsWith(\u0027Repository\u0027)\u0060 appears character-identically in 2 files \u2014 src/frameworks/rust.ts, src/frameworks/scala.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/rust.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"884c85e3739e9d893d4c7e92a02a6365e65c7679fd5ed7f631223d50782b0556"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.referenceName.includes(\u0027.\u0027) \u0026\u0026 !ref.referenceName.startsWith(\u0027.\u0027)\u0060 appears character-identically in 2 files \u2014 src/frameworks/amplify.ts, src/frameworks/iac.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/amplify.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5cd0ed110f40d8aa2c22affdfbeef92a263e42af8cb59e921a796a6ac93b3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sibling \u0026\u0026 commentTypes.has(sibling.type)\u0060 appears character-identically in 2 files \u2014 src/extraction/extractor.ts, src/extraction/notebook.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"6571dd5b4159f5b5cc938733009f082758fc2af8123dfc8483dff79ee62c813e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stack.length \u003E 0 \u0026\u0026 stack[stack.length - 1].level \u003E= s.level\u0060 appears character-identically in 7 files \u2014 src/docs/formats/asciidoc.ts, src/docs/formats/html.ts, src/docs/formats/markdown.ts, src/docs/formats/org.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/formats/asciidoc.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"648009c566c52f9d5e367e2989c9e192940e3ba8a98cda9cc43680e6362bfa5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text \u0026\u0026 /^[a-zA-Z_$][a-zA-Z0-9_$]*$/.test(text)\u0060 appears character-identically in 2 files \u2014 src/extraction/extractor.ts, src/extraction/notebook.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/extractor.ts"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3927ce4470841722cb9be559b2e13361c82da6a5b5ae30d0be15576df75c47a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.tqIndex?.isAvailable() \u0026\u0026 this._kirographDir\u0060 appears character-identically in 2 files \u2014 src/docs/vectors.ts, src/memory/vectors.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/vectors.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fb73d5e48c944f579ee9d317747893e531e6caa40e04afe787b82cefb5cb76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed === \u0027\u0027 || trimmed.startsWith(\u0027#\u0027)\u0060 appears character-identically in 3 files \u2014 src/security/manifest/plugins/cargo.ts, src/security/manifest/plugins/gradle.ts, src/security/manifest/plugins/rubygems.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b12af9d257a2939b45582f3860430127af2d88bc8f366c5f75ff3de516f4d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof lockData !== \u0027object\u0027 || lockData === null\u0060 appears character-identically in 2 files \u2014 src/security/integrator.ts, src/security/manifest/plugins/npm.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e8507be2e6117a632923f53cb229070c5f899c71d5e06722b33aaace3494eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof nested === \u0027object\u0027 \u0026\u0026 nested !== null\u0060 appears character-identically in 2 files \u2014 src/security/integrator.ts, src/security/manifest/plugins/npm.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"87926a8b3a343c6c7edc1000e0c91a4490df7cb1b0f79b7a4f8526719c6662e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof packages !== \u0027object\u0027 || packages === null\u0060 appears character-identically in 2 files \u2014 src/security/integrator.ts, src/security/manifest/plugins/npm.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"89136cf4cd516bc8d8f64ec06078e2a63a74ef05cb3a3b4e384648a9162e837b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof raw === \u0027string\u0027 \u0026\u0026 raw.trim() !== \u0027\u0027\u0060 appears character-identically in 2 files \u2014 src/security/manifest/plugins/composer.ts, src/security/manifest/plugins/npm.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/composer.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef50fe98a47dce1430f80ba83d157a47e471c4b00513aa0b12362e85e16f1856"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || value === null\u0060 appears character-identically in 2 files \u2014 src/security/integrator.ts, src/security/manifest/plugins/npm.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/integrator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c4aa10a6abb10d0867d1f5a75d5ae00dc1c72302df859d6f82ce092d4151df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060versionMatch \u0026\u0026 versionMatch[1].trim() !== \u0027\u0027\u0060 appears character-identically in 2 files \u2014 src/security/manifest/plugins/cargo.ts, src/security/manifest/plugins/nuget.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/manifest/plugins/cargo.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89630a4401402efeaba74731c583345629e79b6ccc339b10cec5fec2243bcb4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validateAgainstSchema\u0060 is exported and takes \u0060data: unknown\u0060 from its caller, and it calls itself at line 110 (\u0060validateAgainstSchema\u0060) with a piece of \u0060data\u0060 (and at line 116) \u2014 and nowhere in \u0060validateAgainstSchema\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060validateAgainstSchema\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/json-schema.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"488400b39e5e5ae2b7fdb0cbe74ed57dc65c9744744f4e7ca759e0d5476b603f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060handleDocs\u0060 is exported, takes a document from its caller (line 3) and hands it to \u0060renderEntry\u0060, which calls itself at line 26 (\u0060renderEntry\u0060) with a piece of \u0060entry\u0060 \u2014 and nowhere in \u0060renderEntry\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060renderEntry\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/docs.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d4ecf968a3c5823090f37e9475aab9dec42a1ff334921254a49587fb15f961"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060augmentBash\u0060 is exported, takes a document from its caller (line 505) and hands it to \u0060visit\u0060, which calls itself at line 149 (\u0060visit\u0060) with a piece of \u0060n\u0060 \u2014 and nowhere in \u0060visit\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c7692eaba28eaec0f5c519f350834d1b65c4b8e7b1ef41211f8a9c4a01c7da"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060augmentBash\u0060 is exported, takes a document from its caller (line 505) and hands it to \u0060visit\u0060, which calls itself at line 549 (\u0060visit\u0060) with a piece of \u0060n\u0060 \u2014 and nowhere in \u0060visit\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/infra.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"835ccae9bc4dc21fbccf59c99586827191184148c31fd455ca0daec0bbedf421"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060extractRoutes\u0060 is exported, takes a document from its caller (line 68) and hands it to \u0060walk\u0060, which calls itself at line 94 (\u0060walk\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060walk\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extraction/routes.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba54905f0cdc4b41820f283b31733e1edcf3f817a0e9d8654e7a797e41d77901"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 11/12 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: indexAllNow: \u0060indexAllNow\u0060 holds an AbortSignal but calls \u0060indexAll(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060indexAll(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10dbf9af2f0914f2e8cedc55677f363aab2cf447ce388948f88aa00480bef04"}},{"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":"src/config.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e3dd6c05e1a134e1c980f5b6b14a9a277457c8a233735fd0a2ff01a7924445"}},{"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":"src/index.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc471ea71134f04a318bedd4db498ebebc6a4a88cdb2117334174bc29871881"}},{"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":"src/utils.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1109494eeb9c68e27e85c1b0bda2b23206bd25df4e5a33c0c16d0f77084d8dc0"}},{"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":"src/utils.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6aae82f5ce8a764faffaa57e633310f857c8c045635824b55bfa50cccacce8"}},{"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":"src/wiki/rename.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"848195b21b9338d14b1a2359bf5c3d27980954455876e2521eac097964515286"}},{"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":"src/wiki/schema.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1657c0098b2daf988f9068032fc26107b64a0733e6151dfbb97e0fe583ae68bf"}},{"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":"src/wiki/schema.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7253ebf671ff40358c4dc1e4b8e0c0ae6b0ce55b5f8a9561ed0e46e2a123b2d"}},{"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":"src/watchmen/synthesize.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0375e323bcc1ec6fb62e25e8cbcd45a0ae3fefd1953cb3975aea63ce4ede04f2"}},{"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":"src/vectors/index.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"526cd367ce6d785fd20e1cda86cf588d3b0cb4596fdad13cda0141fbf9ae9a1a"}},{"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":"src/vectors/qdrant-index.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4101f930620968c5dbc95999a5271124ae771236702c2c22ef5b8f2786ed551b"}},{"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":"src/vectors/qdrant-index.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dddb22a8aead7e2fc33a49daccbd4baf4bef214867d0d7ed6330991e06a818d"}},{"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":"src/vectors/qdrant-index.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae61c6291a7b86b27d9dab1a661c6e52f5b622696ed3852f5e9b455f21dfd0c"}},{"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":"src/vectors/turboquant-index.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f788b5ab8a540e4848e55f708d968ce4de0cd48e41302b4c10c8953d1a18c2"}},{"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":"src/vectors/turboquant-index.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bac40652ef1a121745365d5345f13f2f0f06c0e46fe3b91d9bd72cb59e9ae1a"}},{"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":"src/vectors/turboquant-index.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5886a6fa2090d75601df13b1eec7040955b7d85e88fca0d50022f8095e84cba5"}},{"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":"src/vectors/turboquant-index.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbffd88d3b83d1d69d05940a2c98ccca30714029b205b2d7a4852dea9a1e51b"}},{"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":"src/vectors/turbovec-index.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9654be26b51bd69bc1a132365a1bce2f61381fde5647e5f8619625d0b43048"}},{"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":"src/vectors/turbovec-index.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0edb31f3e0260e6ff0c59dab1c59f9168c35ac684aad0fa9894f634ecb510e"}},{"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":"src/vectors/typesense-index.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8db8d42b7cbcfd4688d7d0433008cb457a6a9e477e1e7e2573c68e41ee05b4"}},{"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":"src/vectors/typesense-index.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae5469c65714b851c7cba71880c918b22f22c3867d7afd059d80c6bfce4ba89"}},{"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":"src/vectors/typesense-index.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8760b28e9e2c6eabda9de7b1fd454b8f9a66d1e185741d42c140206c80cf532f"}},{"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":"src/vectors/typesense-index.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3a454fca3f3ad72e554a2b6c42d96603471989a4ce49f12b38cac7cf9e7c19"}},{"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":"src/vectors/typesense-index.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9cb2f650cfd65dc747d258334dcf8af72ca547f7d5f0db54373e837d1d8e69"}},{"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":"src/vectors/typesense-index.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0509a21074eaab61bc72b1b0f63916e8ef6c7347b2e906026b680913b1cbbb8"}},{"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":"src/vectors/typesense-index.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6172398dddd31667734e8fd133841bc7814b2efebc2aa52b010cea06327766"}},{"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":"src/vectors/vec-index.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e9a0d45606f5396a148c545013b7b4cbaaf8c8647818f22701d503c3b61600"}},{"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":"src/vectors/vec-index.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d87ff44f9840144ce15d342c75e9d2ddd86c7a27d2ec7e4b89ef02f3b953ed"}},{"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":"src/sync/files.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a58cea3549735e4b5fd413d8de7e2244f527c928cc04ca33881258b27b960e"}},{"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":"src/sync/git-head.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a87b2346dda69fbd508e4ad509afc7ae66728b6a79d7e98f19c60edc8c3670"}},{"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":"src/sync/git-head.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"794492194b824e9069b8b8e847e32e80fd55f3d51c02d9e6cf8838a7b00640f7"}},{"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":"src/sync/index.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7a333da4ca17c4ec3b3e7dcee9734b752f8906d2245b102e5d90d5aa0389c3"}},{"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":"src/sync/index.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ff90da29b8c9c5b15461a947e4ffef220553dc0014ea9c3f9ab35f34ab4be7"}},{"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":"src/sync/index.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc8a52e236f682557298df2f4a376035d41404a0508c231b5b2706a0b5c3bf3"}},{"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":"src/sync/remote.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d0cdb44a0a714184ca17e9a135413349d04917fb4828918a3ead3ed4842c0a"}},{"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":"src/sync/remote.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"df489daa44be32f84cde17b4731c9766eda913b9726ad877a85b656222c837a9"}},{"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":"src/sync/remote.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"951c310b5fcc27803bbf1ebe4102d1f5bcd61467ff3919bb014af8d9e7b9ae9f"}},{"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":"src/sync/state.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"473fedc263fbc84341253123a03e4de66dec50be53562ad4f1f2df9315e2402f"}},{"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":"src/sync/state.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"574fbea850a2efe33a28e5b34cb232bebf1bbbdece07fad5dd6314166e3dbf9a"}},{"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":"src/sync/state.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2cd46eb0639f83f66db61cb3b3d0004c94546c0969de33b3698e461a2453a9"}},{"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":"src/sync/state.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6193337c72f4c7f1696a94a71ff8b871b54dcd82672411ba9aec06707676a6e7"}},{"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":"src/sync/state.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cff98ae4f223576a8b098b69ecf8a70a14c4348ab2edce4934d9ecacaae41a"}},{"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":"src/sync/state.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1377c4beecc2a22c52de2904223f9bb2bbe413999499f88d7ae770a1e068a5ff"}},{"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":"src/shared/engines.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8099932fb9bf0017e30a7c6356957a51dc49bb24c6d4af44e46d00e202dd6a8f"}},{"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":"src/shared/engines.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee193d5e1134786506b25067b5d04eb7af2cf7d98a49b3d9cecd0dbf6a61bf84"}},{"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":"src/security/context-warnings.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"def79c518adc07d5997e985d5f63b0cef1b83e052456f2956eb231d2aa228f96"}},{"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":"src/security/dep-confusion.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5065f48f94c4ac37a4606aeb3481f3f4d67d3ad56043913c491a34cab690bb2"}},{"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":"src/security/incremental.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa54ce36bc3f43c44936850e781be5b943331d32cbbb38c289c48f0825c66c4"}},{"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":"src/security/incremental.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef7a586e6c7a268064a3e9547843ab6f930f647e88bcb0e94c599a88a53215e"}},{"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":"src/security/incremental.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a532ce25f83db50ab2b8236bcc381169b608169bc40cac16076dcfb129c90584"}},{"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":"src/security/integrator.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b3b59590329b6ef8821dc757b25e82d5d4e0af7afd926b8d57bf4dca289b65"}},{"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":"src/security/integrator.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c3889bcf080cbbb76709e63a6b073c6ff159329e7b6edbe29bf7f5f784d4db"}},{"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":"src/security/secrets.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd14e9085df066e72c6506c0bc7b1fdbc61099872e839962f8fdae08b6d00ea9"}},{"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":"src/security/vuln/client.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d845481ef18e532bbc7edaa72a23caa6fd3f7583d2bc02f1ea909dec986c6d3"}},{"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":"src/security/manifest/plugins/maven.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"060320b7648090019b40465a645a1c527eb463b2541b67f2507eab4c94e104ac"}},{"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":"src/security/manifest/plugins/rubygems.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"683dec847a021f6f8b04627cc66074b0da8d073ffccaa5b17542d40d093a9439"}},{"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":"src/security/export/sbom.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"838f9b3b28286f5ac9aefe68f24cf64690b721ca3de3d4ec735d036ca2ec905e"}},{"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":"src/security/export/sbom.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bae42d74651a792ed09d240d06c8dc3bb99ec14a1f21a865355f85b15bddee"}},{"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":"src/security/export/sbom.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0334dd7ad4ff02a0be036b65a7150b65e46837a8cbcb87a3bb2494929cd3abb"}},{"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":"src/security/export/sbom.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e0e9942aa421f533b7ac451f2b08b6fbf210aa8c00aa8c200984f2d0184941"}},{"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":"src/security/export/sbom.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7177aacea18324d8b7aeb42f583b661c34997d13d78d8e2e72d8b1638c92ab8e"}},{"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":"src/search/searcher.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fb0290207d709ea3c612fc1567e040cceff754ee0b3770b0ccfd06191f0e63"}},{"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":"src/resolution/index.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c7aef4d76faa72755218305f50629d98e09b76f6cd0d753f22e312be868859"}},{"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":"src/resolution/bridges/expo-modules.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef43daf6c6bafa1160c7cc2f2dd1f8f74364981e6cc281367f92e333de7025c3"}},{"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":"src/patterns/indexer.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd3587b05d2b5ff6a951c8aa9128aa51a71692e206cc65cc6324e5c47c2d4fc"}},{"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":"src/patterns/runner.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a3fd92ef6bd82fc9cff599bcecf0be5604c4d2ac418969b89ced308c4e79c9"}},{"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":"src/patterns/runner.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7746986404c703624d07498e3445b5471e710e30c784ce85fe5759f6b51d0ce7"}},{"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":"src/memory/database.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d8a12058ddf45a16cdfaeba4267fc9e6400496a0da81731b7e5bb95c1f3118"}},{"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":"src/memory/database.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f5e0abcfd2e3dbf5e2a3748cd0e7f31ed804a3c5a37b642a4667e7a9341195"}},{"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":"src/mcp/handler.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"471702c8cd38418a43a9ddfdae2e9a7fa0b75f0765546aedd6cdc2220af3350f"}},{"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":"src/mcp/handler.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"487ab1e493e455c0aa2b9d147293bd0081f0c4e639a7d10835d350934e24e343"}},{"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":"src/mcp/handler.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c49e12ff09a61bbea72004c0124f22c8827f272eba63edf4c049060e6c79fa6"}},{"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":"src/mcp/handler.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b38a7951ffdab75c57adf73918e81124de455ae1c8e48150b403d5b7855889"}},{"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":"src/mcp/read-modes.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee4462c3d9eb4b38c70f99f90fbed9400d201154c809c73c992ac7f3bb60ef6"}},{"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":"src/mcp/read-modes.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbebb06e5a7a03b31a6a4c8e7046b5ccd142420e05f2b414b08ec85426fac277"}},{"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":"src/mcp/read-modes.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ce348a5ce59ce12ebb3083c6d9e3b17b82f54b3547ce719e051abb85cdf50d"}},{"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":"src/mcp/read-modes.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee1b43f3d6313e5b56717f211a8374834c3837c386f5ad89f1f46647bdb991b"}},{"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":"src/mcp/server.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd49f515a459686b9e10c22df55fdd0291270761424bf969d1836dc66f35624"}},{"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":"src/mcp/handlers/architecture.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c6f586125418b5e1d0362353a73e52c9b5a5d585f236bafc59f472f3f7dcff"}},{"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":"src/mcp/handlers/code-health.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"862a5eac31b735269c766d976c7fb6b4df791bf50f69091a8589b55209b451b3"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0689aa9b7e025141abbd4ab0fdf3641fe14a250fd3d9b2e2d59727872e40e22d"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8b9ba28c187f3a0bc766b392cf49f61ce60032628e255ce8af863cf99529d8"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"29688e991ceb0ec6b47a89551db79ff4eeb40bd4480e5b047393644b21ce8783"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a01aff29b0caf99af847c2fb2828ebf3b38a911890570b0f51093ab4299b7b"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93cfa3e3a090ffc91afad3b48390e5a9568c6e7b249a9f9399cc2962aed774d"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b84378217fffd007cf27e0ba0cd5808a9b3e8383ec6eae9bf4190fc01c65e2"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed36a2cec4603a58574ad0ce17025146b589292b9dfe0c8236e2306efc00e97"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"691da87f3ef93d8004b7f7595bf6ec9a00c2e64bae2e7bd9f5160b641c63d50a"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb19a1342334e72cf77be47dc851b3fcf39928c0446024e2002adacf74429bd"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b5ce613b9eac3275550815658d0ec37e016b26189d5efb45a2bd35d04363e"}},{"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":"src/mcp/handlers/core.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bedcd40c327e9165f6f78a9c3b8f8a5289b6294875d79881ec2d6c708b2ddc2"}},{"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":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8709c99b9bb3d097e94412a996a61dcc0a9e0b038cc98cd3a9ed24435b2eec"}},{"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":"src/mcp/handlers/patterns.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0812bd5e249e8ae8ab3fc59c0e756869827147a3826987cc0f83e64b9fab4a4d"}},{"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":"src/mcp/handlers/patterns.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16c98836862bb4b5cd157771ee1f4668e525d3263cf3048f60f658dfa50d7e0"}},{"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":"src/mcp/handlers/patterns.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd2338de0c65313f42270e1d03b0de0c729bb14fcd8fba4a832510e83cce478"}},{"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":"src/mcp/handlers/security.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeb6a91379fa65e1fe5dc8230a541bd01e6725ba038706dec2fd1e77b7cbdcc"}},{"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":"src/mcp/handlers/utils.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79fa074bec29efc145c782c41c559c7cca820cf34c4a320451cd38fb31e16eb"}},{"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":"src/mcp/handlers/utils.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3609c2a7d4dc8aa299eacf95d6c4561a417226d27b73ea2428538b511594c12"}},{"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":"src/jev/client.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"837063ce1b98aa37a7cb86711c869d5b66a69d1820f809dcc2c461de99c5eb04"}},{"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":"src/jev/strands-client.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1d1ed1a109e45a4d0b2d9651d112a9d9a86b34ff629f519f9663243cd05e20"}},{"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":"src/frameworks/amplify.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5e0407879bd59b95e2d060ee6905937d63a3378dc5e709b0514ff8151c364d"}},{"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":"src/frameworks/angular.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6eb2a4b9267960e00523a3c58b9357800a1b03f3489c1efea7505e80ddbaac"}},{"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":"src/frameworks/express.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a96c2d0b5be639003bec54729c521c057019c68a05a7e73a77bd8441543304"}},{"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":"src/frameworks/iac.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28c100a289a54af4ffae01cf723a99230289be54be06c01df9684beca6a1c8a"}},{"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":"src/frameworks/iac.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"51692d52f28ed9625d9ac570025de285aaba714f434609f29c3b4eb1e7f8ed2a"}},{"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":"src/frameworks/index.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5351e059b66ec87965a3f82461d9ccbb80d6a3004019b9eb0e061e0c12d8bf5"}},{"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":"src/frameworks/index.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"95627e45d4bb395f6ac7ddde8d78da85efd944b0fb1453918579add9292313f3"}},{"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":"src/frameworks/index.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"662851be4f9039350284fdc27892b9e8ee6f16bb77d43e13718279547ff141c8"}},{"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":"src/frameworks/index.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99634361a46472a90e2516060279e4785084c3191d789e3757f26b22f0f127d"}},{"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":"src/frameworks/index.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fb057cdae53e7b84875da5a7e6b9b2b472643459900c9f8e47b7005317283d"}},{"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":"src/frameworks/index.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15acebbb972e48cdffafa140e441dd408a2ddbb676fda995b0cf4db7fd709bb"}},{"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":"src/frameworks/pulumi.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a2e9fcbe1df568706e25cbff93fd80884764a69eda43f1f14ce5073ed789c2"}},{"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":"src/frameworks/react.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d47d700683b71e3d9c7b371a35c18b3f3cfb670865c1dd826042366f7b5347"}},{"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":"src/frameworks/svelte.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7a5fb6816c136bb1a37ae138db404fe1a876600c6ad2706f6080b5062eb82f"}},{"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":"src/frameworks/vue.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3f0000a36eb78f1e696daf54634da9487f3117054793f4b6ef351ed36d1201"}},{"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":"src/frameworks/vue.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3846b8b65588a77f2b12fb3a31863ed371c0702aca14a5d33f8b9d2cba9b5e20"}},{"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":"src/extraction/grammars.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa2b1cbf6f1e3e1bee839d37dae1c2c7cc8b2686cc4682bfaab8df69e91a865"}},{"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":"src/extraction/grammars.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90ee4bad9771c56c010b7a3a3fcacd0d4be5e6eabc12d452ac35e56f72a07e3"}},{"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":"src/extraction/libc-shims.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7502825d292dd8a92984f17c6ca18fe0eb8bf674f2222c00bbe628f9ee45cc"}},{"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":"src/db/database.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44d94cad75496a05acf9fb54fb993497eb2eae2d3c472b8abf53fd5291ad76f"}},{"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":"src/db/database.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4019b31ee56fbd4f0ee285a716f628c8edcc987436ffc20c4e2aa6e3907e8b9"}},{"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":"src/db/database.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4e5d56d99683b4edf48137e20ad59b766d7f7c37d9a463dc0b8263476326d9"}},{"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":"src/db/database.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17a9cac4505844bbf1808f44ec23f5b3bcf339354d2f430e7948f96f764b03a"}},{"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":"src/db/database.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c413423aad39c3d25eb7f6bbc8a48b6542d2191c86c83fddb72672e9c22921"}},{"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":"src/db/database.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e610bbac02039abb9aa0f7e38a91d81c9e98ac217c98ffd9ad08de9404302430"}},{"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":"src/db/database.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb911be18044c5c784e6f6efd4ecca249fd1926e517f7b1c88313d5c619e8b6"}},{"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":"src/db/database.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f531a00e408508b5a3e45b1c5bccf814d440c67ecc98586c37b89a663d5c731"}},{"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":"src/db/database.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b72055b884cfa977f7369c223e443580d6d8b42af93d6d968025c8f2dd53a02"}},{"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":"src/db/database.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2aec5324005ae5894cbe97d49b7f22429b0faee4c3cbea743b8fa079d224e2"}},{"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":"src/db/database.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd302e301c219d9f6d4124cefd47cb7e366520f18b047bd0436a3d7f5898630a"}},{"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":"src/db/db-lock.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f671ec2d01d39fa731925850dcbbae2822fe91faf4ceb323f0f1a4f145e8ec72"}},{"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":"src/db/db-lock.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4886dc8b95d6059832d6669cf2694f0f8bf9f7214f684df178e8bdb6df7f2491"}},{"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":"src/db/db-lock.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9522edbfc0e3f3a78cd98ddc38fd16b5aa3212da67bfee56bbe86de78eddd7"}},{"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":"src/db/db-lock.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80ee01a4a6bdc731c491139eb45bf80b3b052f327254b497b1537a702330c6f"}},{"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":"src/db/journal-recovery.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6708e882170b39ee8e7c449700b2c22e981172e2956026e55aac0a8b01fa58ec"}},{"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":"src/db/journal-recovery.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02166a445353f2bc16397376d362c026aabad8c4fde641086be8e09b883b0bd"}},{"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":"src/data/indexer.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e418e522302cf1a05776bc5156ddf595fc0a785be9b84ed0ec5d0409509b2128"}},{"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":"src/data/linker.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee316a63a4ce1c5a6dc0fd82f279ba6b8568eefb3cf0559197850ba30ffb78e9"}},{"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":"src/data/linker.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bd2e30a221c846842a627e267d3a4ee803e11da060f411125dc732180b0770"}},{"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":"src/data/queries.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c32c0cca243a76a7d5edcd21039c560fa237e92988c6d3650c8f1d91d1b1c9"}},{"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":"src/data/queries.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c6ca1f2aa6041a462696bbda097561524382e2923876c24d96a9663c6eac7a"}},{"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":"src/data/parsers/jsonl.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c82fd6230d432a9b1b70b3de19e3362c6bd39307114cf610a0dcac042741ef"}},{"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":"src/data/parsers/pdf.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24ddbca88512d6ceb15041bb55523119c8cb8e2cc8cda58addffd43ed8d43bc"}},{"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":"src/core/lock-manager.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3430604d053704336ef7d88668293ca61f93e8c155a42df831341788ec1c3ca3"}},{"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":"src/core/lock-manager.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b9d8b2416f5e4aeb0c81ef5f0dd84b121cc743a201156631711cc7418127ab"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b9fe5f1aee02083cb85c9190c0b412fb7c0ec6d88d0d7240873d38e0e75e43"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pipeline.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"538b98c0fa9c3afe8a861b93414be99b7a8416bfef45a6e44cd89a0731d1679b"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baedcdd71271935ccdbe5698e2c3667898c02bcacc4e4b7499f56d7d2befc4d"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2628b756f851825177bdeafd9b62c5071da7b6479f1e999ad8e116bf2599da84"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cdb889f3e2cf277f9b2ce9dfaa790527ea32df89d24882affd23ff8c97f390"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e355cbaeb63c446d839f0ac4021eb1db407a38933c9ef0c8f12fcb13968c11"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f160df4a09dbdba4f427d0a751743a110b44cf4aff4bc1a709a9bbbb424f60ab"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61d3014bb9e2c1156e2b1cfbe6a4ee849f370cedd2ae69562f426de7bc20890"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ada018dfa51336db225028102d48560b477e33cf8185a2e4e8e02c35c9ebe0"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d0d38eaa894346879a973dcbfe8eb5cc7011a9c42c2c71850e7c4f1872f7ae"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f9a4f631d82616becd47e1ae46de4eaf3e6fc35ac0b9b52db35e026cac14c9"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc732126d45d84a1a167b10ad99b72098e831cf6cab727e23d47691a9875ad25"}},{"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":"src/core/pipeline.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8e4fc73972e75ba983809c22763226acfa85dae9e2d88fc2bd0bccddbe3bc8"}},{"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":"src/compression/tracker.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a0e605f4cda89a96b303383582f44156f6f1d2eb1041f3b306ebe8631d9258"}},{"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":"src/compression/tracker.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e976f22e2ce5943382597050f72c50800239af672dc6673b717549ba7315d8f"}},{"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":"src/compression/tracker.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f30638c9865329a591b3bcdc3235e00a9f2f93bbd8c700f7aa1febaa34f17f7"}},{"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":"src/compression/tracker.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7404bec55f8d4a5ce6131c413c9b14c009e448593b41e5a60041270b12cdd6"}},{"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":"src/compression/tracker.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6317468cf41a09a050fdeee646716daa72ba23f05e0c139986e9e9608c8e8fdc"}},{"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":"src/architecture/incremental.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbc7496de204bf24ed0fa7b27cae17f5fd4dbfa057eac1c60bfcc8a133d2fa0"}},{"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":"src/architecture/incremental.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dadbb14a5487490fd03bad698088604321659d30742e4c53b6381fbf6f5321f"}},{"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":"src/architecture/incremental.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bca61b6ed00e485a70dd76216cdaa8081d78b9a7c49c678ef9875eb36d9c7bf"}},{"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":"src/architecture/manifest/index.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c2c73377b2ebe5fa2806c27fb416c0cbf2a518e8964e560b1866466b637616"}},{"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":"src/architecture/manifest/ocaml.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7548668b9a685494f390ec28771d9e021299bc4cc62b289168a40daa3aef3f"}},{"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":"src/architecture/manifest/ocaml.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aec584869fdbb05d8e6095f4d56263637e1509f22f6a7fd1dd543d60944f789"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~4.3 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 251 assertion(s) across the 58671 source line(s) of the 264 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: src/graph/communities.ts (22), src/frameworks/iac.ts (19), src/security/dep-confusion.ts (11). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060repositoryPrefix\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/git-head.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5a206237c126a7882158fe44f9ec499592224926d68542a7fc15fdcd6ba627"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readGitHeads\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/git-head.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ff0361dfa246ab87373d412c37270b670e14f43d5f79b9c3ea21bd75e15489"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060packageVersion\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/architecture/incremental.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a78cf74493ba770fa62dabcfb67076691c010ac6bae9e95f12782f8c65cdb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060liveOtherWriters\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/db-lock.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1096b20c7b8a7e69d4e01d7e02dc7a2d0b4a1efc1e580ee839b6d7dff3cf3f43"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getEmbeddingCount\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/database.ts"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"54efaa1eef3d7d372ae26fb6a986a04160789676a61c61090ca102028d567e87"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getEmbeddedNodeIds\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/vec-index.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c873a1e2c81324c3765c50046f0237a5c939c03f7bf53fd351664a526e25fa8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/vec-index.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4279466b88502c888cde9cf92e60728bdf19341d607936e615bb7a3a94d557"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getEmbeddedNodeIds\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"370ce46afbb872cc805b78460d6591f8355b7d39d171c75c235963344232b310"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/orama-index.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e48c7dc44984e0396cdfbee1a391f38758dd354ecdc13773fd7f554a1f3c12"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getEmbeddedNodeIds\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/pglite-index.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55c1e36d738692b5ecc5b9fa9dba282a41cfb2c04794b4e769080bf9adad97d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/pglite-index.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecfac77b195ebf3c11223c5db64c532ff41dc22fe76d4bd44c07a7ec12e9c47"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getEmbeddedNodeIds\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/lancedb-index.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f3fe6814dabe254a0516cef65db478e0618cae1f7bb037d58012c862d651df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/lancedb-index.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c58d845d01de83c8585ec3c0749a0c96dba923762c0f1521782e73758adca91"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/qdrant-index.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"769d970b044157a899eebbfeb6a7348fa915dc42cce8bc0e21e353b6ed6863a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/typesense-index.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"718d0971a9c75ce29816c0ad9d9eab400e141c8e9074cdf23dec16b4093fbf0c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1ef6d7a32521a5ecb02eeec7bf7c459611b782a8d1ef6b411c148e4464f107"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getEmbeddedIds\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vectors/turbovec-index.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1a05a6fa53ba021e1f56cdfb797d82822f54bde26d1bf2cc568e3b08d729d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060detectFromPackageJson\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/frameworks/index.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b57a9712643e75563a54a18d158a8c7242e4012252b79c2d1f5f62b97d4f9e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060packageVersion\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sync/state.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21335b4f83dafd8012db9de0fd187c8ef8dffcd0c713250f519689655ff8a74"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060list\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/snapshot.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df47ba672f2bf072a99c2425477a189c6420dde9e51b5d2a100e920820a5c43"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getPendingSyncCount\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f67a07d08a129d6210ad0952af8e63365b8c9ee852f67d243a650e022295403"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadRecords\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compression/tracker.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e876199fa67461eefb06403482be6a319e3b23f95e3ef3eb399339e4a819421"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSectionContent\u0060 swallows every exception into \u0060return \u0027(file not found on disk)\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/docs/queries.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f716685b75d8038927e397921b2f62f1890d484fd58e4f055979fd1e4a89c31"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060handleEditPrimitives\u0060 swallows every exception into \u0060return \u0027ast-grep is not installed or not on PATH. Install it (https://ast-grep.github.io/) to use this tool.\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp/handlers/edit-primitives.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a94a5294a409ed52d8487ad63ad3aee03370709a428075c2bd24107918e920"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060load\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security/suppressions.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7c199dbed261350b39888d6b353746fbc59b6aa0628df548a3f6f697c9ffd2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getCurrentGitBranch\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/branch-manager.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77e16547b215d6381f1ae23b057b4a81d24ea9f6a0cd446ba7d5246dfa460ba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getGitBranches\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/branch-manager.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ca11cbb853e6d75be556d5c7a6a494781bf34ea13fbe37d9083a73228de5cf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readJson\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/installer/common.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c0819b7a99af6446093c9550de614565c4f5ee683aa7b0ba616d54c3605600"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060workspaceFromManifests\u0060 swallows every exception into \u0060return \u0027root\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/commands/vulns.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcde7d85aacf8111d55dcff289377aab868bdd185b4fccbbf33257baa08e520a"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-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-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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"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":23,"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."]}]}