{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"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":"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":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"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":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"createReport (cyclomatic 304): createReport has cyclomatic complexity 304 (threshold 15). Of this number, 298 points are the body\u0027s own statements and 6 belong to 11 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":"static/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b59221fd7c3a9ed453309e0ee215711cef674b82a0b666c0da0688334077ba"}},{"ruleId":"D1","level":"warning","message":{"text":"createReport (cyclomatic 304): createReport has cyclomatic complexity 304 (threshold 15). Of this number, 298 points are the body\u0027s own statements and 6 belong to 11 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":"android-app/www/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d3641d3a6c3c78dbdbaadfa5c0ee4c4f8a64c4f26d29e43001c8f610a7221e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.createReport (cyclomatic 297): standalone.createReport has cyclomatic complexity 297 (threshold 15). Of this number, 292 points are the body\u0027s own statements and 5 belong to 4 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"442d8b9d345747c099a58ff5bb4f2322f1836204f2382f3e9954b31878783286"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.createReport (cyclomatic 297): standalone.createReport has cyclomatic complexity 297 (threshold 15). Of this number, 292 points are the body\u0027s own statements and 5 belong to 4 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":"docs/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fcadacf43ac514737462ca8e3b2b4105a5d214841ae7072c43c561b57e743e"}},{"ruleId":"D1","level":"warning","message":{"text":"importNativeReport (cyclomatic 221): importNativeReport has cyclomatic complexity 221 (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":"static/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6602814d6e3bb9e7dc19f4e2b344b51831fe75f8975586a182240b5c6e1faf76"}},{"ruleId":"D1","level":"warning","message":{"text":"importNativeReport (cyclomatic 221): importNativeReport has cyclomatic complexity 221 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c820a0f359249e1770a0afb63e00aa2d53030fce98fcc0ff70c26966e7046ec"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.importNativeReport (cyclomatic 219): standalone.importNativeReport has cyclomatic complexity 219 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"578189a2a700bd8b4466006aeda7b5dd70854bcf5c2bf5b2a94527e914cbc32f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.importNativeReport (cyclomatic 219): standalone.importNativeReport has cyclomatic complexity 219 (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":"docs/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"16295777a13a3a44d347d92132acf8e785e61c60181fa8bbe790d1de35dd6a12"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.handle (cyclomatic 188): standalone.handle has cyclomatic complexity 188 (threshold 15). Of this number, 165 points are the body\u0027s own statements and 23 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b622e50e4d1327d03bcf38781303eef7bbd060d183f1a172436c8ce7743b1bb"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.handle (cyclomatic 188): standalone.handle has cyclomatic complexity 188 (threshold 15). Of this number, 165 points are the body\u0027s own statements and 23 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":"android-app/www/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd370382b9b0d7fa8a3e60aefde268bc46f7313c2c9b30f956a41dd46794eb5d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.handle (cyclomatic 188): standalone.handle has cyclomatic complexity 188 (threshold 15). Of this number, 165 points are the body\u0027s own statements and 23 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":"docs/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa73ed462e86e738d7f6a48428129aeb17dcebeb94f2e54443269f474563b17"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.handle (cyclomatic 188): standalone.handle has cyclomatic complexity 188 (threshold 15). Of this number, 165 points are the body\u0027s own statements and 23 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":"static/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fd424f91899b265b333559f42afc303ac80eaf35f8cfacdb946ff5107554d9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.analyseFootage (cyclomatic 162): index.html.analyseFootage has cyclomatic complexity 162 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 88 belong to 18 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8047cc56dc2fef3aae6cc3a7d1f9122fddac0ac0be13b234cc22c242529c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.analyseFootage (cyclomatic 162): index.html.analyseFootage has cyclomatic complexity 162 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 88 belong to 18 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":"android-app/www/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fb8adb466de8b65b80a1e0af7c0dbc9f7e996405febed1b427414bec6c845"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.analyseFootage (cyclomatic 162): index.html.analyseFootage has cyclomatic complexity 162 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 88 belong to 18 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":"docs/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b682d78c9eccb151e6e6c3fd7e9a9302ed0694dac239b1551c7cb0283d41c63"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.analyseFootage (cyclomatic 162): index.html.analyseFootage has cyclomatic complexity 162 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 88 belong to 18 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":"static/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a39c8dc55410f5d853057f43330d61bc4b06940188be18bef479cf0e8b8f706"}},{"ruleId":"D1","level":"warning","message":{"text":"prepareComplaint (cyclomatic 137): prepareComplaint has cyclomatic complexity 137 (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":"static/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91943ed0e59c9c4dc631eb4eece7ff772f862aeced8387ff507c13f7e1d0e2b"}},{"ruleId":"D1","level":"warning","message":{"text":"prepareComplaint (cyclomatic 137): prepareComplaint has cyclomatic complexity 137 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"771314308af5f5a4e30fbc6656445cfc1958eee0d88fb0f2e75c9b4df39fd2e4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.prepareComplaint (cyclomatic 133): standalone.prepareComplaint has cyclomatic complexity 133 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2351e32e94509985639d4664eb9a46700e6c9e76fd9f752f7b364a437940f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.prepareComplaint (cyclomatic 133): standalone.prepareComplaint has cyclomatic complexity 133 (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":"docs/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"540b8f0245d33161c814bed22b9d4287bc748d53b924f3e5f92e07a1ee0b6a0f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoutingPack (cyclomatic 132): standalone.validateRoutingPack has cyclomatic complexity 132 (threshold 15). Of this number, 129 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"288ddf150a2dc5f062adbc17676a700dce3436699c44c1119dd378fb6f658717"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoutingPack (cyclomatic 132): standalone.validateRoutingPack has cyclomatic complexity 132 (threshold 15). Of this number, 129 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"310a7c0b5a79b440ee51d516e2357d5841a712faf1f857105c1516f5fe2bf772"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoutingPack (cyclomatic 132): standalone.validateRoutingPack has cyclomatic complexity 132 (threshold 15). Of this number, 129 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"676913b941249e3dc1f092cb45629bf5a41d2e968b5fdb712aa037391ec6a3af"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoutingPack (cyclomatic 132): standalone.validateRoutingPack has cyclomatic complexity 132 (threshold 15). Of this number, 129 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea165751ae7f5a1c4324b834d45d32aaa06da207f5b9423efdcc8242c2bae1a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cyclomatic 128): standalone.currentOfficialRouteBinding has cyclomatic complexity 128 (threshold 15). Of this number, 126 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2470ae7db347d30ca7043174cfbf2dcac6f50095743a10a6410ac5aed9590e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cyclomatic 128): standalone.currentOfficialRouteBinding has cyclomatic complexity 128 (threshold 15). Of this number, 126 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c533f3973aeb2336e958b32221bb79d889ecc2783d84dba47a9219dea7a6d974"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cyclomatic 128): standalone.currentOfficialRouteBinding has cyclomatic complexity 128 (threshold 15). Of this number, 126 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac822a52c9828a2a0a8bc424c7dfbe838b9430d16960ddd5da5d95a4405ebbd"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cyclomatic 128): standalone.currentOfficialRouteBinding has cyclomatic complexity 128 (threshold 15). Of this number, 126 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8951e0c890e2071f18679507f8a9f13a3c581d65e898d52357ce50879c52c14"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeOfficer (cyclomatic 127): standalone.routeOfficer has cyclomatic complexity 127 (threshold 15). Of this number, 116 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e804f270317c88ec4dcd8bb54c2677244e9ec265ca8d9dd1eb9e83db076ea0b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeOfficer (cyclomatic 127): standalone.routeOfficer has cyclomatic complexity 127 (threshold 15). Of this number, 116 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f257f495280536e2b5c65c26eb2adbb07ab73367ac917be72a781b0c1aef0b5"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeOfficer (cyclomatic 127): standalone.routeOfficer has cyclomatic complexity 127 (threshold 15). Of this number, 116 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb906b8a4d8480d90e8604a077f54eb23e503f76f1deb618d1959e3e4dbfaf7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeOfficer (cyclomatic 127): standalone.routeOfficer has cyclomatic complexity 127 (threshold 15). Of this number, 116 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a89024b135a5963c9c5ea03d0f47e8251d446bfeeb92bca9a2ae985730db780"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cyclomatic 124): standalone.savedOfficialRouteBinding has cyclomatic complexity 124 (threshold 15). Of this number, 122 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc898fec0c74d625edcb117c0cd0a3aae62d42ca4d16e164bc44a281828ffe9"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cyclomatic 124): standalone.savedOfficialRouteBinding has cyclomatic complexity 124 (threshold 15). Of this number, 122 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"59df2b59ad525c96f5e9fabc5109d4501739fd8924dfbab7c33316b3e5c8d56b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cyclomatic 124): standalone.savedOfficialRouteBinding has cyclomatic complexity 124 (threshold 15). Of this number, 122 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26e7190e4e5a9968dc9b91e325e65df46d964ff342c36130129a03b87d04e66"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cyclomatic 124): standalone.savedOfficialRouteBinding has cyclomatic complexity 124 (threshold 15). Of this number, 122 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c318aff8a04c28d7a55b648a9928b35b59432f999c864859463340035b5640a"}},{"ruleId":"D1","level":"warning","message":{"text":"createAddressModel (cyclomatic 116): createAddressModel has cyclomatic complexity 116 (threshold 15). Of this number, 107 points are the body\u0027s own statements and 9 belong to 9 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"be35418df4313d8b548f8f4472ee847afedfe3dc552d2df9d53e623aca69c572"}},{"ruleId":"D1","level":"warning","message":{"text":"render (cyclomatic 108): render has cyclomatic complexity 108 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 62 belong to 123 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0957c63f0b41a4be2c6ac82c37a3ae6220fa64dac076e110926ecb1648aa0d72"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.sendReport (cyclomatic 98): index.html.sendReport has cyclomatic complexity 98 (threshold 15). Of this number, 95 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"247737d00755f961e4d4b0ec94c3c12be9944479013c11d31fc9f2888269fca6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.sendReport (cyclomatic 98): index.html.sendReport has cyclomatic complexity 98 (threshold 15). Of this number, 95 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcd4b7f9e674897dabc1a8efccbaa113d54695b3f958263f37de02d34c7f18e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.sendReport (cyclomatic 98): index.html.sendReport has cyclomatic complexity 98 (threshold 15). Of this number, 95 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cf1c0007b6bf0d09042f1597e92debc35df130179e3ed94cb94fbf13ec0780"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.sendReport (cyclomatic 98): index.html.sendReport has cyclomatic complexity 98 (threshold 15). Of this number, 95 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b855b5f614b20bedd099fe2ae75e65598b45eb10a680c7df22d1ed694ddf60"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cyclomatic 94): index.html.runNativeVideoAnalysis has cyclomatic complexity 94 (threshold 15). Of this number, 85 points are the body\u0027s own statements and 9 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f82c6c3706358500cd47b17ddfa9ce125bf86e232c87c27461048b43ad3710a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cyclomatic 94): index.html.runNativeVideoAnalysis has cyclomatic complexity 94 (threshold 15). Of this number, 85 points are the body\u0027s own statements and 9 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":"android-app/www/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce2de41ff7d8fbc2ca6ffe69b18d9d1fb89f7659342ee2ca9278d0f02092a27"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cyclomatic 94): index.html.runNativeVideoAnalysis has cyclomatic complexity 94 (threshold 15). Of this number, 85 points are the body\u0027s own statements and 9 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":"docs/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc190fab770d24d3b71680a62f93ff332c86cff138f73ddb5e3ddea5d9cb7fa"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cyclomatic 94): index.html.runNativeVideoAnalysis has cyclomatic complexity 94 (threshold 15). Of this number, 85 points are the body\u0027s own statements and 9 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":"static/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e04d111260e5d72be7ab0d33c1e9ea6a14daea61c53ae9306e11d5513672d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cyclomatic 89): index.html.runImportedVideoAnalysis has cyclomatic complexity 89 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"688f2064995aeec7a110d002138ff17e5dae8f57e49591b5172a45d92d88ec0d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cyclomatic 89): index.html.runImportedVideoAnalysis has cyclomatic complexity 89 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ddbf77a9bf77494416d17f74a9576522e054a1b70e062ad94f1ebcb01c5365"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cyclomatic 89): index.html.runImportedVideoAnalysis has cyclomatic complexity 89 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a4a4378ae050d5a7693f98b223713e0d3e4c9a926ecee0cee3d0ea3f44bdaa"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cyclomatic 89): index.html.runImportedVideoAnalysis has cyclomatic complexity 89 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"2373d8ec3cd2a9c06492856b90f2b9d5db30662f65fe89210824dfd7fded8893"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDetail (cyclomatic 88): index.html.openDetail has cyclomatic complexity 88 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 20 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"60accd662fe2d96a89a76c23cf1ea398249b62c1823682570b28c2a26f84f0a4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDetail (cyclomatic 88): index.html.openDetail has cyclomatic complexity 88 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 20 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a35c516e039c65dd0ae18bf1780898ff2e15f3a2cb8a44bbe97f3ae7b792fa"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDetail (cyclomatic 88): index.html.openDetail has cyclomatic complexity 88 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 20 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f42f6c9823304c47c2fc776cef91832491d72fc6004cfa2ad38028964fadfe0"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDetail (cyclomatic 88): index.html.openDetail has cyclomatic complexity 88 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 20 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a4cc724c409faeac3c1cd9ab815addfe356c35cac949f90e71a6e1afd15e72"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cyclomatic 85): standalone.savedNonMunicipalLocationMatches has cyclomatic complexity 85 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"2581fa80888f653b7da83033bd4f8ec273dcec4600a0df9d47f13f7bebb96600"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cyclomatic 85): standalone.savedNonMunicipalLocationMatches has cyclomatic complexity 85 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeda82ade54c997a96c57575db66308a714640e72f2d05e2273af1de446a224"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cyclomatic 85): standalone.savedNonMunicipalLocationMatches has cyclomatic complexity 85 (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":"docs/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0b82568c25f9643453f6ef8c25940d4e824cae931fce008ab61812e273fafb"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cyclomatic 85): standalone.savedNonMunicipalLocationMatches has cyclomatic complexity 85 (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":"static/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a170d668b3756c8033e2062cb9a8800a8b4d1da45b26c318f0adeb75fd9044e"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveModePlugin.reconcileNativeState (cyclomatic 85): DriveModePlugin.reconcileNativeState has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"36492c8871040e4e41aeef69629f6aeaf5afa1f4f0f438cecaeed6a62cd1451d"}},{"ruleId":"D1","level":"warning","message":{"text":"exhaustive_video_eval.validate_label_manifest (cyclomatic 85): exhaustive_video_eval.validate_label_manifest has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5f07ce884b60a71b8377c84d0cbf19a7783c8bb79d94a61cb0506acda6ba6e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.restoreNativeDrive (cyclomatic 82): index.html.restoreNativeDrive has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82b5d089c672698a4397cf76ebfc2b017d9cec2742a09042968ceef4270cc0f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.restoreNativeDrive (cyclomatic 82): index.html.restoreNativeDrive has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"62caf8c0d664645106ab275381317984021aa45b223fa3adddffd2ad2a84efd2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.restoreNativeDrive (cyclomatic 82): index.html.restoreNativeDrive has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d6a425fe77738011c2b6f395af22af21e91fd50548f17a88bae392f8e8e975"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.restoreNativeDrive (cyclomatic 82): index.html.restoreNativeDrive has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b791d3eecb051b7782187df29ee796e3225778a356e762d51fd8637d4f785c77"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementPack (cyclomatic 81): standalone.validateRoadAgreementPack has cyclomatic complexity 81 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab28d2db26e8acf47bff87c883531f5cfb29ab8e6cbcf7c843f22b7490d6e07"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementPack (cyclomatic 81): standalone.validateRoadAgreementPack has cyclomatic complexity 81 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dd1f978866ea9b8f98d2386153f934062b8270f79ed0f2d6faf42a971c2ddc"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementPack (cyclomatic 81): standalone.validateRoadAgreementPack has cyclomatic complexity 81 (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":"docs/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c456e578968ccd89d9c8bb061950a5924df69fd2cae013e7e117e2bd1bef78b7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementPack (cyclomatic 81): standalone.validateRoadAgreementPack has cyclomatic complexity 81 (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":"static/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b123d800cb6a0076dd44a20192dcf097c28213625e234954e3274b8d39efbf3"}},{"ruleId":"D1","level":"warning","message":{"text":"private_drive_corpus._validate_manifest_for_receipt (cyclomatic 81): private_drive_corpus._validate_manifest_for_receipt has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9008b575f9af18289c5a64cba3ad4286ffc83409711289506e786b5417a3ae"}},{"ruleId":"D1","level":"warning","message":{"text":"createCivicReport (cyclomatic 80): createCivicReport has cyclomatic complexity 80 (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":"static/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cde2c550723c62b80a6cd31eb518a4a19018303b9582983d3b8538133bf1016"}},{"ruleId":"D1","level":"warning","message":{"text":"createCivicReport (cyclomatic 80): createCivicReport has cyclomatic complexity 80 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd3751abc04b2ff7b53b899d6c605dd942bebe4ba90830944e4116dae4d4df0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.createCivicReport (cyclomatic 79): standalone.createCivicReport has cyclomatic complexity 79 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb06fb4efbc7fca1495c8917e8cf96432352a8c921d2731f240bad6302cd809a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.createCivicReport (cyclomatic 79): standalone.createCivicReport has cyclomatic complexity 79 (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":"docs/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e17ad8c45bd9bdf008d6c66e6a10ee433a1dceb5a3e9ae5e84978fa0b68509"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMunicipalCityPayload (cyclomatic 78): standalone.validateMunicipalCityPayload has cyclomatic complexity 78 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e58981553e151c14f962a37802127738dab538559c45996c1cd58f525b67795"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMunicipalCityPayload (cyclomatic 78): standalone.validateMunicipalCityPayload has cyclomatic complexity 78 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dc7924901da575b638d9346fcd35a56a70853bb932183606721d398393d075"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMunicipalCityPayload (cyclomatic 78): standalone.validateMunicipalCityPayload has cyclomatic complexity 78 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22f9c0e678c35f5647527ec4ba2dddee8f82bcd8909e43e58c395ac25f1fe6a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMunicipalCityPayload (cyclomatic 78): standalone.validateMunicipalCityPayload has cyclomatic complexity 78 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7878318ec5c7f4a1d86992f87e1a52f0e643aa0fcf1998956ad02649ad0643d5"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cyclomatic 77): standalone.installRoutingAuthorities has cyclomatic complexity 77 (threshold 15). Of this number, 74 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c788e92ec1ab52d6fcb6c742b958e0d8bc290bcec918aafc8746a0c47196d2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cyclomatic 77): standalone.installRoutingAuthorities has cyclomatic complexity 77 (threshold 15). Of this number, 74 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":"android-app/www/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"888265749562aa08a2567d3911bbcfb4c91feb44205ec28b55bc5138507963b6"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cyclomatic 77): standalone.installRoutingAuthorities has cyclomatic complexity 77 (threshold 15). Of this number, 74 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":"docs/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cc8cfd259dc0ef956800433083e72a2085695d3426c4902f1587aa2c57d6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cyclomatic 77): standalone.installRoutingAuthorities has cyclomatic complexity 77 (threshold 15). Of this number, 74 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":"static/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c278eb9bcfb8d7855f0efcc828f6c30ff7cd81077e443edeb8fcf1ac66ef9cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"openEmailDraft (cyclomatic 76): openEmailDraft has cyclomatic complexity 76 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b224bc681b85e7806d10c138f16ea3c0a8040e9d947ffb01a3172d5147c414e6"}},{"ruleId":"D1","level":"warning","message":{"text":"openEmailDraft (cyclomatic 76): openEmailDraft has cyclomatic complexity 76 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8f36bcc3af5c0229576a7fbb8f9198e7fa2c686e9e01f451d3286ffcb06eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openEmailDraft (cyclomatic 75): standalone.openEmailDraft has cyclomatic complexity 75 (threshold 15). 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e2f446580421c74eac006d50467712e332459c08cc07825909b5e0d7442824"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openEmailDraft (cyclomatic 75): standalone.openEmailDraft has cyclomatic complexity 75 (threshold 15). 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, 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":"docs/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cb620b52a1ffc9853f128c1f562605f03b681d011d6c8889906eedd594f650"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.buildRegion (cyclomatic 75): build-street-index.buildRegion has cyclomatic complexity 75 (threshold 15). Of this number, 68 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"900414f6901ef64616d977d1a7e8444944f8d3305102f043bbd158bbcbef6626"}},{"ruleId":"D1","level":"warning","message":{"text":"common.validate_prepared_dataset (cyclomatic 74): common.validate_prepared_dataset has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/common.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d57b68f5a60044aef2ecbb9e6a3c1a74da8549acb16377bf226d1aafff1fb91"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cyclomatic 72): index.html.updateNativeDriveHud has cyclomatic complexity 72 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b2f6ba359f5f2f9e90103dc2e7779f2f6455db2f047baec02f80a977b051c8"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cyclomatic 72): standalone.buildComplaintOutputs has cyclomatic complexity 72 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 10 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"112e81be61c6e994989021041a4bf782a06d75c970d0746bd080c457d214daa5"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cyclomatic 72): index.html.updateNativeDriveHud has cyclomatic complexity 72 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1c5f66367254294ddb365274768d5a7b4013a11b0fbd58a7bc3bd047498754"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cyclomatic 72): standalone.buildComplaintOutputs has cyclomatic complexity 72 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 10 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":"android-app/www/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"311dd9a260d94182b898bb048ffced40ec1f0bc556d816eae88d6f74dcc8bc57"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cyclomatic 72): index.html.updateNativeDriveHud has cyclomatic complexity 72 (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":"docs/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa048dcfadd804c8141e2bafe62006e368b69b5ff1bf22b798e4f71f6df0af47"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cyclomatic 72): standalone.buildComplaintOutputs has cyclomatic complexity 72 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 10 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":"docs/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1659cbbe61a226ee1458c79c1d4c3b3f7ce8725448756fbc8bdfd516a06306"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cyclomatic 72): index.html.updateNativeDriveHud has cyclomatic complexity 72 (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":"static/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fc5ce4b8e71f519b3e59b2d4a133325e1b798bae6cfa73fe2f10f86634a3da"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cyclomatic 72): standalone.buildComplaintOutputs has cyclomatic complexity 72 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 10 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":"static/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afff8d26b8c6d78841aea3206a5154cdc9bfd3c932dc0c11110b051236e292a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted (cyclomatic 71): index.html.startDriveAdmitted has cyclomatic complexity 71 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted::onPosition) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"294529cf5c6ec2488d8074f57bd45dc8cb8de0c301543a2fbf0bc98e1217105c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.migrateLegacyComplaintRecord (cyclomatic 71): standalone.migrateLegacyComplaintRecord has cyclomatic complexity 71 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4716193b74bb55984fc3333cd2c4bb60172c33bcf6f8218e5af9515d98b77745"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted (cyclomatic 71): index.html.startDriveAdmitted has cyclomatic complexity 71 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted::onPosition) 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":"android-app/www/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22c1c230cbfa4d29a58e2beff9e5768479577e1a0f8398f9c3522909ead99a6"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.migrateLegacyComplaintRecord (cyclomatic 71): standalone.migrateLegacyComplaintRecord has cyclomatic complexity 71 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a53c7667f8e6f12b5b1711b5279089c388c05ce2ecde7adc3dc7abbe308d806"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted (cyclomatic 71): index.html.startDriveAdmitted has cyclomatic complexity 71 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted::onPosition) 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":"docs/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcb1423bb892e7e5f354538e201753378e50df3d0308d00a9ace9d6b9fe9b60"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.migrateLegacyComplaintRecord (cyclomatic 71): standalone.migrateLegacyComplaintRecord has cyclomatic complexity 71 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"518c8988343e3e1b0f9c7ccf52776710c7a5d9564fd558d0fa8ea9b2d0372a94"}},{"ruleId":"D1","level":"warning","message":{"text":"geolocation.createGeolocator.resolve (cyclomatic 71): geolocation.createGeolocator.resolve has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5794be613826b5a64e74a384d923096491e8ffca4e04a5cb763af304e2a9b113"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted (cyclomatic 71): index.html.startDriveAdmitted has cyclomatic complexity 71 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted::onPosition) 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":"static/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef0ae8d6dcea2b3dafffc7d8840f4f6c12bc0843c729ecb702e80ecf335d6b3"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.migrateLegacyComplaintRecord (cyclomatic 71): standalone.migrateLegacyComplaintRecord has cyclomatic complexity 71 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db5e2dcc964d9bca2d40e8689a77a386e196fe3b84cf2445edbce50f8b793e1"}},{"ruleId":"D1","level":"warning","message":{"text":"createGeolocator.resolve (cyclomatic 71): createGeolocator.resolve has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af3017df93ffe5bed79aad845177864379df3047e5417b089678038f93e544f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayManifest (cyclomatic 70): standalone.validateHighwayManifest has cyclomatic complexity 70 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"26addb219d2c9aa3183ea67f435f509c2dc43a16d9c661d398b0c78a3c78774c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayManifest (cyclomatic 70): standalone.validateHighwayManifest has cyclomatic complexity 70 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca825d7cbb8483b90d64f517f3a070fe1348b219fa61a84382178344b8424e8"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayManifest (cyclomatic 70): standalone.validateHighwayManifest has cyclomatic complexity 70 (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":"docs/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"587e36dfc5ce8d251317efad3733052efd6772b8a20d77c7a2bff4545b9839d4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayManifest (cyclomatic 70): standalone.validateHighwayManifest has cyclomatic complexity 70 (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":"static/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c44458cd9ac92a79b7f21de0aef0a59b3d3899c1c6b3a1461cbe06aedd072a7"}},{"ruleId":"D1","level":"warning","message":{"text":"wardMarkersIn (cyclomatic 69): wardMarkersIn has cyclomatic complexity 69 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 6 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bad8f336b789162fec1a2e0bd23eece8c1b7d324af8b21ec9c90ec64b2c86c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.finishNativeDrive (cyclomatic 67): index.html.finishNativeDrive has cyclomatic complexity 67 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"2308fc46396bc8973a01504fa8b4e1480be6d3edbbaecdc493e3c05b0325a63c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.finishNativeDrive (cyclomatic 67): index.html.finishNativeDrive has cyclomatic complexity 67 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"73220e40b76c0c9a051ae83660421ddcc148c695fcc839b9195f46a9740ec806"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.finishNativeDrive (cyclomatic 67): index.html.finishNativeDrive has cyclomatic complexity 67 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92e6bbb0c88a571ecf6606cda2bc8a3d8a2a53d32a91d1dd83cf4ec7fb351fb"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.finishNativeDrive (cyclomatic 67): index.html.finishNativeDrive has cyclomatic complexity 67 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"910ded0a6111d85bc27685d354de59bf1e807f50be4b9b5930606ad244544d59"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticePack (cyclomatic 66): standalone.validateRoadNoticePack has cyclomatic complexity 66 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a27ed1173d5e4dfd38eb2bffdd12f5c238a9baf8d6c5742ce561183cea127a6"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticePack (cyclomatic 66): standalone.validateRoadNoticePack has cyclomatic complexity 66 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"26267c57e1a72e557d8124fb40592cf78c72eda46c2fa038ad40db9146162a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticePack (cyclomatic 66): standalone.validateRoadNoticePack has cyclomatic complexity 66 (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":"docs/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"12844aaeffb10eb02e4f44d614b149c283bbabd92051e85557a2a34635e72164"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticePack (cyclomatic 66): standalone.validateRoadNoticePack has cyclomatic complexity 66 (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":"static/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0c022003abe2ee127cf9a7b289eb7b8a634bb8b0c58d8939573a8424a2e465"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayContractPack (cyclomatic 64): standalone.validateHighwayContractPack has cyclomatic complexity 64 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"994c54afdd076f9db1715097d7b9474009f04acf7cece7c395e82908203fcabc"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cyclomatic 64): standalone.validateRoadAgreementManifest has cyclomatic complexity 64 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f49605a97e16a1e99fe81452d29b9839fd8b8019754dfc830b8d52b7469c66c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayContractPack (cyclomatic 64): standalone.validateHighwayContractPack has cyclomatic complexity 64 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acd37874567cb2712da24d804f9d2c698e6d22d1d57c8ec8dc708901649f75e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cyclomatic 64): standalone.validateRoadAgreementManifest has cyclomatic complexity 64 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e08656c4e51aa5e2cfadca7d7230cd5087a99e67943531a0c59f6439450dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayContractPack (cyclomatic 64): standalone.validateHighwayContractPack has cyclomatic complexity 64 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"363c6ea82dc446d8b881275dc61adb25f63f2af8fda16051511047c3167487be"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cyclomatic 64): standalone.validateRoadAgreementManifest has cyclomatic complexity 64 (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":"docs/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"798fe44d81bbaefe2cf12498b1789a2fad9aeac194b884105757e00fbed505ee"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayContractPack (cyclomatic 64): standalone.validateHighwayContractPack has cyclomatic complexity 64 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"0554b920294c4fbfb1fcb47fc1c0961173b0235aced4c99f68d9e9d86f7665f7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cyclomatic 64): standalone.validateRoadAgreementManifest has cyclomatic complexity 64 (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":"static/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dee584c20eb11cc60010bc2ec93f4036b398adaafd125c4ca4029e75f5ebcf"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.stopDriveSession (cyclomatic 63): DriveForegroundService.stopDriveSession has cyclomatic complexity 63 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"25974a078b5ecd109d75af79413747d99d4a369d02268661f69c6a74551f5394"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleFile (cyclomatic 62): index.html.handleFile has cyclomatic complexity 62 (threshold 15). Of this number, 60 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"24541a32dcfd7e1332c5e42c4a575381ec56140eb24af1017fe8d1681cbbfaac"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleFile (cyclomatic 62): index.html.handleFile has cyclomatic complexity 62 (threshold 15). Of this number, 60 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":"android-app/www/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6022bae6f7a89e9829e9fe63a4fc3650ac3d35bd148255033e5cd7bcd810aee"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleFile (cyclomatic 62): index.html.handleFile has cyclomatic complexity 62 (threshold 15). Of this number, 60 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":"docs/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec245e7747c3404e86b75f04efc37487a45b9f86932c2d0f45cd99d98497ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleFile (cyclomatic 62): index.html.handleFile has cyclomatic complexity 62 (threshold 15). Of this number, 60 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":"static/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c53b8fcb67d11175f048f45f857d2c356dd313323e723fa7c762d9650ae92f8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.resolveJurisdiction (cyclomatic 61): index.resolveJurisdiction has cyclomatic complexity 61 (threshold 15). Of this number, 60 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":"server/src/index.js"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbcfaa89c380565eeb62c0b376dc0f7d3889cb9547e9ab9fb93341976c94c3d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cyclomatic 60): standalone.validateRoadNoticeManifest has cyclomatic complexity 60 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5f66c1b0b520b672ceecd6bbcf1fdee72394d10d4f78740f1a38ab16e35ff7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cyclomatic 60): standalone.validateRoadNoticeManifest has cyclomatic complexity 60 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e573342169da9b88791fc40904254fa37a7bb26f4b4e880c8bcd9c7d8de9f1a4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cyclomatic 60): standalone.validateRoadNoticeManifest has cyclomatic complexity 60 (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":"docs/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8634f4869b7b68966ac3ef65e0fbcca79c73f844dac086b0896244927e9f3cc1"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cyclomatic 60): standalone.validateRoadNoticeManifest has cyclomatic complexity 60 (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":"static/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb06ff285dc02cc618d92af1f1c5a522a25b730e5cbac27150564a4ddcef139"}},{"ruleId":"D1","level":"warning","message":{"text":"createService::report (cyclomatic 59): createService::report has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb633c19181c4dd80db26443eedbcb6f8bc9ff91335c837af359386ec215001"}},{"ruleId":"D1","level":"warning","message":{"text":"ward-tenders.matchWardTenders (cyclomatic 58): ward-tenders.matchWardTenders has cyclomatic complexity 58 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 40 belong to 11 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"300ae62ca04302fcf94fac8b79991c1ad75bee9224f82999360ed7514ed340e0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.normaliseTenderMatch (cyclomatic 57): standalone.normaliseTenderMatch has cyclomatic complexity 57 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b093c53348a606cd78e91460cbefbb66aa0c221289491b2016c0355a603cf"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.draftCivicComplaint (cyclomatic 57): standalone.draftCivicComplaint has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2417447d7913edd92e37309f0c85174ea6f95fb0c53f4bd15b0376d0fb6c4132"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.normaliseTenderMatch (cyclomatic 57): standalone.normaliseTenderMatch has cyclomatic complexity 57 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99719aa9eedc37f2ea7b029a11baf0bacd05584a96f3e9a9847a5106b9c9a0b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.draftCivicComplaint (cyclomatic 57): standalone.draftCivicComplaint has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f65f8b650bc28f62e042d6fc9ef09a9249872cf5d18438a7806e42278b9428"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.normaliseTenderMatch (cyclomatic 57): standalone.normaliseTenderMatch has cyclomatic complexity 57 (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":"docs/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bd5589f834d97296c183a97999f29c4a87cf3e55a1dfb9255d89dc00760471"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.draftCivicComplaint (cyclomatic 57): standalone.draftCivicComplaint has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fc9fe0f15d97f83f08d647d8e6f402ce6fbfe8d979ce34ff6f04d0effaa039"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.normaliseTenderMatch (cyclomatic 57): standalone.normaliseTenderMatch has cyclomatic complexity 57 (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":"static/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"54655c390a9267703a071ebe375715665726e014b27dc99989d1b164dad2721c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.draftCivicComplaint (cyclomatic 57): standalone.draftCivicComplaint has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4cbba090393b22ec853c22a1336793980f5ccc68913b7a342bb67c15dea6c2"}},{"ruleId":"D1","level":"warning","message":{"text":"run_prepared_eval.load_event (cyclomatic 56): run_prepared_eval.load_event has cyclomatic complexity 56 (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":"eval/run_prepared_eval.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96fd1a58f8cb3ab99edf8512139cce8f0b2f2dc052796f56340cc6a9beeb677"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports (cyclomatic 55): index.html.renderReports has cyclomatic complexity 55 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.renderReports::cardHtml) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f0a6864605f1c646f2ecb696a3f1635ea102a74631d7ad79f5c42ce70347fa"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateStatePackManifest (cyclomatic 55): standalone.validateStatePackManifest has cyclomatic complexity 55 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"4446c97e0869b1f94d62d85181dfcf748c7d2bf254ca92fbb66ce6301c9d6cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports (cyclomatic 55): index.html.renderReports has cyclomatic complexity 55 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.renderReports::cardHtml) 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":"android-app/www/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf73fdfefd2733e094382656e9c8f372208a5933f1ad658bac6412e1dbfb7ff"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateStatePackManifest (cyclomatic 55): standalone.validateStatePackManifest has cyclomatic complexity 55 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcd8092125d36407368ae684614d791e59a5893217d1bb5be219b1890fd7b52"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports (cyclomatic 55): index.html.renderReports has cyclomatic complexity 55 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.renderReports::cardHtml) 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":"docs/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec29b1c5a376053655f425737767292599f39fa1ef82207ad0fb6a9b20a9b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateStatePackManifest (cyclomatic 55): standalone.validateStatePackManifest has cyclomatic complexity 55 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"2632f1e9f3192e3aca70e9bae0afafe35fe44fbfb5aa58dc7547eea918c16c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports (cyclomatic 55): index.html.renderReports has cyclomatic complexity 55 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.renderReports::cardHtml) 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":"static/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"367117536552e4b1d179775b6be05562fd5c4573d5b70fd1fb729794d27f40fb"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateStatePackManifest (cyclomatic 55): standalone.validateStatePackManifest has cyclomatic complexity 55 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9b2b81c631db7f4fbc8ecf207f52c263c80ea55d6d5b97b1507bed43ee5e21"}},{"ruleId":"D1","level":"warning","message":{"text":"judgeWindow (cyclomatic 54): judgeWindow has cyclomatic complexity 54 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 10 belong to 15 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":"infra/aws-central/service/health/window.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11ed61474427b1daf9b4c875a2fabe98984eb2334b754b186053a93bf8711ee"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.driveTick (cyclomatic 53): index.html.driveTick has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f767ab7c45e45acd5ee0691e1b14dbc670ae140e4a0dfd236449877be70211bf"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.driveTick (cyclomatic 53): index.html.driveTick has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"51def8b5e03ffdcd5b395d017ad122e3b345d8d9d7f47f510d68900a84f82d52"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.driveTick (cyclomatic 53): index.html.driveTick has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f9784ac4b06e184cb8e0579738960266b1d3569310aa351a9510b5a90acc06"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.driveTick (cyclomatic 53): index.html.driveTick has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"076338f911e8ce19a6bde87cb2ac526033dc7d312aceecf945ee5e1d68cc0f18"}},{"ruleId":"D1","level":"warning","message":{"text":"UploadWorker.doWork (cyclomatic 53): UploadWorker.doWork has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f514b052ad1d57b901bfea56a9e4b14f99ed6cb623e3d75926203791af3aab8"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.createAddressModel.rowsOf (cyclomatic 52): build-street-index.createAddressModel.rowsOf has cyclomatic complexity 52 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d4fff045281acfed0e78524d4964ccfd0daf28d812839a8bc3a2936ab8ab79"}},{"ruleId":"D1","level":"warning","message":{"text":"createAddressModel.rowsOf (cyclomatic 52): createAddressModel.rowsOf has cyclomatic complexity 52 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b4b20266c66f055831401e8fdf76ef1f976c094869c4ac9cf87b4dc2b16b61"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.pruneStatePacks (cyclomatic 51): standalone.pruneStatePacks has cyclomatic complexity 51 (threshold 15). Of this number, 45 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc48d9e680d4c83376c7be1db7c90b6a9914547077530499427680eb672f0d72"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cyclomatic 51): standalone.addReportUnlessDuplicate has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 8786, 8785, 8761, \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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b8e78474414c03cce22bd3ce5aa68d689848083ec8db0f4a407d2821278c67"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.pruneStatePacks (cyclomatic 51): standalone.pruneStatePacks has cyclomatic complexity 51 (threshold 15). Of this number, 45 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":"android-app/www/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ed053f663839c10d77d23ac03764597a5121d435213c80c55b3a12e13b52c3"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cyclomatic 51): standalone.addReportUnlessDuplicate has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 8786, 8785, 8761, \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":"android-app/www/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"39152704eba95e431bfdc47259324d605377dd8c97825379e532d19dc9cea73f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.pruneStatePacks (cyclomatic 51): standalone.pruneStatePacks has cyclomatic complexity 51 (threshold 15). Of this number, 45 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":"docs/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b7548ddd54e850eea62cdf5b0494bdabf9486c3eecfbd0b0be6c54f7acb65c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cyclomatic 51): standalone.addReportUnlessDuplicate has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 8786, 8785, 8761, \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":"docs/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffeeaf37876f1df0b0c45ef1102c0d9c0ec09a9ed5804b7960a89602f2606a1"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.pruneStatePacks (cyclomatic 51): standalone.pruneStatePacks has cyclomatic complexity 51 (threshold 15). Of this number, 45 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":"static/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e028af12db5fb1b18f725d96a4b22f8ecd32c406c1e0ff79728d915da781d0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cyclomatic 51): standalone.addReportUnlessDuplicate has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 8786, 8785, 8761, \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":"static/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"91de38c669a20baa04059c3e446c1ee413ef16eefbe64ff536b8befe18e7242c"}},{"ruleId":"D1","level":"warning","message":{"text":"run_rad_eval._index_to_manifest (cyclomatic 50): run_rad_eval._index_to_manifest has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_rad_eval.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc2d8c038753bca92f7547603a109e1f69e98123f01bd34104533d61b1a1fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"release.build_model_manifest (cyclomatic 50): release.build_model_manifest has cyclomatic complexity 50 (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":"ml/yolo/release.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"328de509a793ef51bde7033cb8020c61023e3a425866c10fc2bb7160d1748dc3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDash (cyclomatic 49): index.html.openDash has cyclomatic complexity 49 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 6 belong to 6 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"352907193421bcf17463780a7fd4e3101e3d2849298570e4711d0593fb2611ab"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDash (cyclomatic 49): index.html.openDash has cyclomatic complexity 49 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 6 belong to 6 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":"android-app/www/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccb208907dac6fd7c5d9d8870d6efeb09ec073d0ffc7f10a1783ace9dd01d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDash (cyclomatic 49): index.html.openDash has cyclomatic complexity 49 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 6 belong to 6 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":"docs/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"476ab7540d728402dd7f203f9edef8bfcded597b6aeea58e10c1bb7896d218f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ward-tenders.titleNameKeys (cyclomatic 49): ward-tenders.titleNameKeys has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a7d799145546582d6b70101f9a7fb7000a8b956a8aeb77023e937d21847f25"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.openDash (cyclomatic 49): index.html.openDash has cyclomatic complexity 49 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 6 belong to 6 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":"static/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"429f2b3c6e8bdb108076a4158b021ad9f92b11c1892bd114ff1f5658bb383895"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cyclomatic 48): index.html.replayNativeKeyframeBatch has cyclomatic complexity 48 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 6 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf260f4f99eeb29763856d242af87b3c075dd5f402c1d91e5479b89e032bfab7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateContractPackManifest (cyclomatic 48): standalone.validateContractPackManifest has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fa220b208a98ce399c7f74bc4e3016812176614aa1641cffa2dc94013d7bd0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.decodeRepairEvidence (cyclomatic 48): standalone.decodeRepairEvidence has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142bcc6b607e16bd97cb61dd85a85c9707ecd8861b1f6a6f045ac2f14a26c98"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cyclomatic 48): index.html.replayNativeKeyframeBatch has cyclomatic complexity 48 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 6 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":"android-app/www/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e118204944a688f33fa5f77bb70815ed64791219e98d542b28c1a90da4ba35"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateContractPackManifest (cyclomatic 48): standalone.validateContractPackManifest has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8e287296ce1f562c4f06decceee4e13d3fcf137dbc0fad0fd7931483b102d9"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.decodeRepairEvidence (cyclomatic 48): standalone.decodeRepairEvidence has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"02504e93a2cd30a85400bc728aed7e0c4fd4315a2efc23b59168f102abc03afe"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cyclomatic 48): index.html.replayNativeKeyframeBatch has cyclomatic complexity 48 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 6 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":"docs/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4231f3d590d4c11a69fbad441bf4ecfefd64022345fb9acc6666c6ffe2a3a6"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateContractPackManifest (cyclomatic 48): standalone.validateContractPackManifest has cyclomatic complexity 48 (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":"docs/standalone.js"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0181e9f069f924a52c1acd081c8274f88f7bae61c251ae69388b420d943c85e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.decodeRepairEvidence (cyclomatic 48): standalone.decodeRepairEvidence has cyclomatic complexity 48 (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":"docs/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb26653cbec93a5dde14b84515f851782318f81b70d44bbef61dd6cfda23ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cyclomatic 48): index.html.replayNativeKeyframeBatch has cyclomatic complexity 48 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 6 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":"static/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe6f4dd22f6c4ce8944e72292b31152825709868617bb759b060a0e101c018d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateContractPackManifest (cyclomatic 48): standalone.validateContractPackManifest has cyclomatic complexity 48 (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":"static/standalone.js"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccab224621ffe33164147403121589f4810a0801316bcecf882213bcc52e8f2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.decodeRepairEvidence (cyclomatic 48): standalone.decodeRepairEvidence has cyclomatic complexity 48 (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":"static/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cb86b9bf4088d66ed2c5e6b1ca064bcef49df134cb15bdaceb339a3c9e7525"}},{"ruleId":"D1","level":"warning","message":{"text":"createService::handleProfiled (cyclomatic 48): createService::handleProfiled has cyclomatic complexity 48 (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":"infra/aws-central/service/core.mjs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3a7d76badf24ab1f7004659c74864c91d17dab62f62acbb7cbe1b29adc9fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drainDriveQueue (cyclomatic 46): index.html.drainDriveQueue has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 14 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5740, 5720). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"939294228f53bbed7ceda2bf665a5a9aa972516cdb74b0158ccad7f7e3c7b05c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMajorCityPayload (cyclomatic 46): standalone.validateMajorCityPayload has cyclomatic complexity 46 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf84b1aa3e05889eb35aa9457b401be3cf150b6bc2389cc552d33ff2e11cabf"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drainDriveQueue (cyclomatic 46): index.html.drainDriveQueue has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 14 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5740, 5720). 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":"android-app/www/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9ee3a4d7f4686374eb52eccbcb4f017edd9f0470757d898fec1f83bbc4562d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMajorCityPayload (cyclomatic 46): standalone.validateMajorCityPayload has cyclomatic complexity 46 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68b127bc97da1a9e5845f6b28935f5c4883489139314b8197753c38e865d45a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drainDriveQueue (cyclomatic 46): index.html.drainDriveQueue has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 14 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5740, 5720). 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":"docs/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bc1257946f5abbd55ad1cfaba1f739f99190dbeeb589e14f63f10f0c7337ee"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMajorCityPayload (cyclomatic 46): standalone.validateMajorCityPayload has cyclomatic complexity 46 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d689f3f6429f82d080b62924a1409776f4c490098a57fb79dd0bcfea305d063b"}},{"ruleId":"D1","level":"warning","message":{"text":"notice-bodies.urbanBodyOf (cyclomatic 46): notice-bodies.urbanBodyOf has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/notice-bodies.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2410bcc7e7976221ceb9b5d8f05f4a5e080934bd274f5194385bb92ab2a3c2dc"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drainDriveQueue (cyclomatic 46): index.html.drainDriveQueue has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 14 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5740, 5720). 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":"static/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30ae2845b63ed0967808c58e3b19d95c0ad9eacdb120cab0a2542ec21e98907"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateMajorCityPayload (cyclomatic 46): standalone.validateMajorCityPayload has cyclomatic complexity 46 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8fd90cae360c6b35f99d64d65df7905004fdbd99e70d39c4ab6e2ba6ae6492"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cyclomatic 45): index.html.scheduleNativeKeyframeReplay has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 7 of the 45 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"735cde3e9c25992dff432f3c1432cf4a37ce87467c89ff58ac547b473848af2d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cyclomatic 45): index.html.scheduleNativeKeyframeReplay has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 7 of the 45 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"android-app/www/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f292ef7f98f83142a4ca6888f91b97cb1f246c7796c142e620135cfaa24708"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cyclomatic 45): index.html.scheduleNativeKeyframeReplay has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 7 of the 45 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"docs/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"224fe2d7303cbaa86f88bd222ea1d45f705069c30d8967ae3fed36ffd6bbca54"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cyclomatic 45): index.html.scheduleNativeKeyframeReplay has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 7 of the 45 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"static/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6829a95228b65ddf22bb63261470fb7f3c2d0a9acd91086fef75909c82192f"}},{"ruleId":"D1","level":"warning","message":{"text":"retryCivicRouting (cyclomatic 45): retryCivicRouting has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f230843dae00e497d61b0568276b7fc732f5b665bb8b71e65453f7c9721d20"}},{"ruleId":"D1","level":"warning","message":{"text":"retryCivicRouting (cyclomatic 45): retryCivicRouting has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"858cda3ecc6e8199ee400906fce1f08aa32350b0ff20f6b45c1a5ab8f6fda203"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadEventMatch (cyclomatic 44): standalone.roadEventMatch has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daed8dae9ac50e6c2f649946a9629b8c900c7f6d76826b6827c70305556a7d5"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadEventMatch (cyclomatic 44): standalone.roadEventMatch has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb374c33cdffd0e264df351e4bc2c802cc8ea2034881da487addc5ca3cf6eb10"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadEventMatch (cyclomatic 44): standalone.roadEventMatch has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c61f99d249f765f079b32b098881aa89fd4ce62a96cc9d5fd38300b5a4563"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadEventMatch (cyclomatic 44): standalone.roadEventMatch has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e301f96da00ebf76a267e9e15bc6848cc088ebe35edf2cf178d30f4ea6cb4b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"run_tender_eval.main (cyclomatic 44): run_tender_eval.main 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":"eval/run_tender_eval.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55c18bb18c377fa236bef25ab8d861c18880ce3810f321c214209323f264590"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_dataset.collect_rad (cyclomatic 44): prepare_dataset.collect_rad 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":"ml/yolo/prepare_dataset.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"203c706ddbf23f5c9eecd9b7866813780a061cb0544cec2cf7ae63d20ebe5c96"}},{"ruleId":"D1","level":"warning","message":{"text":"canary.runCanary (cyclomatic 43): canary.runCanary has cyclomatic complexity 43 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 3 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":"infra/aws-central/service/health/canary.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc728d00f6ac64333b30803efe9b8d69c86b6259d06f8a0d44593c8389ab10d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ward-tender-experiment.main (cyclomatic 43): ward-tender-experiment.main has cyclomatic complexity 43 (threshold 15). Of this number, 34 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":"infra/aws-central/tools/ward-tender-experiment.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff576ee569c4e190c2b57eec4a0203897d0a1161bf6ee8e2e6024f3890f165b"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationHelper.buildNotification (cyclomatic 43): NotificationHelper.buildNotification has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee6d7d9b3ceb265c3883f4bccb9667a8498085e2ad568f8b109193b501c4ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.retryCivicRouting (cyclomatic 42): standalone.retryCivicRouting has cyclomatic complexity 42 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc264cf953e2d5a6bca2ef7018221eb03bc6d54b240fcd95578f1c169b11201b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.retryCivicRouting (cyclomatic 42): standalone.retryCivicRouting has cyclomatic complexity 42 (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":"docs/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1685953d8d6632cffde7d858145707aeb18cf37b605e6da692fc3b0d70aaae"}},{"ruleId":"D1","level":"warning","message":{"text":"private_release_gate.validate_manifest (cyclomatic 42): private_release_gate.validate_manifest has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_release_gate.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30257379dc36002aad52d5ef7bc4bbb7045162711c567210ed7dfc4a68ac287"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cyclomatic 41): index.html.ensureNativeDriveListeners has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 3 of the 41 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6c1bcc8f6fcbb48fd38ee42da3225886c43371858ca86c1652cb19f582ddb6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cyclomatic 41): index.html.ensureNativeDriveListeners has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 3 of the 41 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"android-app/www/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"206832837cd1c1454cf92cbd71d27c27b2b6b1cfc0e2fb1a5ef0a7f93e702503"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cyclomatic 41): index.html.ensureNativeDriveListeners has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 3 of the 41 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"docs/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af955cbff5d4296a00df5fc692a9b9b6a6bc77731d452a92db15a46567927b1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cyclomatic 41): index.html.ensureNativeDriveListeners has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 3 of the 41 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"static/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"e903f4a8c85a5f5d3bd284d9f250f60a5e671463b6062fe28ceda617e3184b14"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.tenderCoversCarriageway (cyclomatic 39): standalone.tenderCoversCarriageway has cyclomatic complexity 39 (threshold 15). Of this number, 36 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"524b48d161a4d723fa508e737a8870d18bcd99bf7446d161b535063162ff0394"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.verifiedContractForComplaint (cyclomatic 39): standalone.verifiedContractForComplaint has cyclomatic complexity 39 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e5c32ee651a74dd43410631f4ea3f8a784cf01954328eb803f5bb2f8cf0621"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.tenderCoversCarriageway (cyclomatic 39): standalone.tenderCoversCarriageway has cyclomatic complexity 39 (threshold 15). Of this number, 36 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":"android-app/www/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30a464d2ec0a4984f89e4678a44fdb1502e793978bd599f8f95b1ea8d336111"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.verifiedContractForComplaint (cyclomatic 39): standalone.verifiedContractForComplaint has cyclomatic complexity 39 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16991e187bc41d30fba0ecc728e3f92fecb872c70f220c132d3872df4a0e535"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.tenderCoversCarriageway (cyclomatic 39): standalone.tenderCoversCarriageway has cyclomatic complexity 39 (threshold 15). Of this number, 36 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":"docs/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7761c70b09729eb5f194d13193a537a44a3133b352b247d2c8e86ec881286a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.verifiedContractForComplaint (cyclomatic 39): standalone.verifiedContractForComplaint has cyclomatic complexity 39 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb71f4160e0acee3a211791e26332063d34047d35ba5ae91e79aeee13acf9be"}},{"ruleId":"D1","level":"warning","message":{"text":"tender-scope.tenderCoversCarriageway (cyclomatic 39): tender-scope.tenderCoversCarriageway has cyclomatic complexity 39 (threshold 15). Of this number, 36 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":"infra/aws-central/service/tender-scope.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a4ae9ecf0db92b196369998e7a704d85a2cec6e59e325787c7a6e458c7c657"}},{"ruleId":"D1","level":"warning","message":{"text":"ward-tenders.wardMarkers (cyclomatic 39): ward-tenders.wardMarkers has cyclomatic complexity 39 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 14 belong to 5 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7cb99b43563378951e227838ea802d9946b1690fe501ad9d6c9e288c61be93"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.tenderCoversCarriageway (cyclomatic 39): standalone.tenderCoversCarriageway has cyclomatic complexity 39 (threshold 15). Of this number, 36 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":"static/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe8a0cbb99a3cffefad6242cdf918da37591bb788009838d4e655b9e633efb5"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.verifiedContractForComplaint (cyclomatic 39): standalone.verifiedContractForComplaint has cyclomatic complexity 39 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f4241316c09f526efdfcf335dc025176c1e2977836cbef4760230c52385b10"}},{"ruleId":"D1","level":"warning","message":{"text":"exhaustive_video_eval.run_paid (cyclomatic 39): exhaustive_video_eval.run_paid has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c2fd5bf489ac167a6ab82392540b0a21acaabf0c761757279af721be445fe"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.binaryAssessment (cyclomatic 38): standalone.binaryAssessment has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfba9ec04a26160437b42d50c068a223f5265f3607f600fb1fe6eca7b08f966"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.binaryAssessment (cyclomatic 38): standalone.binaryAssessment has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"43efdcdbc3d4e36faef311bcb4a86435ba3f999c91d63ab65e0f7b38115191b1"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.binaryAssessment (cyclomatic 38): standalone.binaryAssessment has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f36ed9d5ab8eb36b7e09b12ce6e23394a9d8281894b9376150db01f0f9050c"}},{"ruleId":"D1","level":"warning","message":{"text":"tenders.matchTender (cyclomatic 38): tenders.matchTender has cyclomatic complexity 38 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/tenders.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2111882884cec6cd7e7b7726a815c3e84905bc912132d0f7e54c414da8792897"}},{"ruleId":"D1","level":"warning","message":{"text":"india-ward-coverage.measureSnapshot (cyclomatic 38): india-ward-coverage.measureSnapshot has cyclomatic complexity 38 (threshold 15). Of this number, 36 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":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc464c7b4344d06266c24c682a685fbd7693ec2133726885c36462c72cbd773"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.binaryAssessment (cyclomatic 38): standalone.binaryAssessment has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8bae14eb8c537ee9749e36b1c8d8f8f4a8849b302bd68fca8ce7a4d5c914e1"}},{"ruleId":"D1","level":"warning","message":{"text":"run_rad_eval.validate_manifest (cyclomatic 38): run_rad_eval.validate_manifest has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_rad_eval.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc595a682af11cc03ef68501f069ea6ec2bed314c7e5ab6f5657158557c0e38"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.separateRoadResponsibility (cyclomatic 37): standalone.separateRoadResponsibility has cyclomatic complexity 37 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e0ab3970f990bb6ce27b2bcf183a083ff6003cf96f1bf3894dc45ed168befa"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.separateRoadResponsibility (cyclomatic 37): standalone.separateRoadResponsibility has cyclomatic complexity 37 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a02aca8e4a170391608b564b7e6941add163fa11315b6fe39927e8f4793c89"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.separateRoadResponsibility (cyclomatic 37): standalone.separateRoadResponsibility has cyclomatic complexity 37 (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":"docs/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6837d2885f5beabc51f46c4b8bb9477e3e1d3ee425828471f8ff9dccde4f23d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.separateRoadResponsibility (cyclomatic 37): standalone.separateRoadResponsibility has cyclomatic complexity 37 (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":"static/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7e44645de1e07346885211a9acb2ce870efbcf8729eaec6f8690805b6cb8cd"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDeduplicationEngine.matchRoadEvent (cyclomatic 37): NativeDeduplicationEngine.matchRoadEvent has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f229b12495c75b8ebc96f12ccdc7051428f7459e1593b450bd3665bd3feed9"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.generatedComplaintOutputs (cyclomatic 36): standalone.generatedComplaintOutputs has cyclomatic complexity 36 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"53836dbb9dc0d933d0674734971a78e9cc071353796c0d45fe2e198181ee2e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.generatedComplaintOutputs (cyclomatic 36): standalone.generatedComplaintOutputs has cyclomatic complexity 36 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f30bdf0a987ee680e13e3c0e1eb96675df392d714b454875ece043884edd06"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.generatedComplaintOutputs (cyclomatic 36): standalone.generatedComplaintOutputs has cyclomatic complexity 36 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0377b7cb7aea18d5b1ab38b5c164279e3684d9175d097f12e901637fe0aa239"}},{"ruleId":"D1","level":"warning","message":{"text":"local-address.search (cyclomatic 36): local-address.search has cyclomatic complexity 36 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 14 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b8d00c5ca59383f747b65cff2468c0875f222216dd48973f3807c12883af7d"}},{"ruleId":"D1","level":"warning","message":{"text":"build-india-localities.main (cyclomatic 36): build-india-localities.main has cyclomatic complexity 36 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 6 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":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e420b530ac9f9d082688f7b744c924e9c8c27783e16080f227d07c55dddef5f3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.reportCandidate (cyclomatic 36): index.reportCandidate 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":"server/src/index.js"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0be27eb39cb67b621a404b6c14e7dd84eb190e88684f93bdcf9e718569a88f4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.generatedComplaintOutputs (cyclomatic 36): standalone.generatedComplaintOutputs has cyclomatic complexity 36 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1844eecc158ebbd20da69a3f04f26e5dafc7ff70372c0d3faddaa97f5dd8f2b"}},{"ruleId":"D1","level":"warning","message":{"text":"openOfficialHandoff (cyclomatic 36): openOfficialHandoff 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":"static/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbf564d296bcb9f70170b63023c2f7da4f64dfb8a35aa41f78bc9119d5d398e"}},{"ruleId":"D1","level":"warning","message":{"text":"openOfficialHandoff (cyclomatic 36): openOfficialHandoff 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":"android-app/www/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"2718ef626088ea907ea66a15abefc6ded1ac0c3dd1e9d75e82718be96ae5cb34"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openOfficialHandoff (cyclomatic 35): standalone.openOfficialHandoff 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d31139809db8166a16295d06462dc4e0777145546ff1ba84176199a54aebd0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openOfficialHandoff (cyclomatic 35): standalone.openOfficialHandoff 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":"docs/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a88c1f6ea2962e9455c18e1d1a695203eebb412b769270e3ab2d15be646ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"local-address.indexStreets (cyclomatic 35): local-address.indexStreets has cyclomatic complexity 35 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 12 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e702d03fa0b5a044cebbff19f3fd68a47fe58c0dbbe0a842e6f0fabec7a92"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cyclomatic 34): standalone.validateOfficialHandoffRegistry has cyclomatic complexity 34 (threshold 15). Of this number, 32 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f73b6051bc05f3fd738758fb126425d086dbbfa062e35e9f3bc9610d9cb8eec"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadAgreementCandidates (cyclomatic 34): standalone.roadAgreementCandidates has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 9 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ab165540af5ae005730bdb8e55791c7796d6cac00b57c2f377a36882a4d95e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cyclomatic 34): standalone.validateOfficialHandoffRegistry has cyclomatic complexity 34 (threshold 15). Of this number, 32 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":"android-app/www/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a80f50de54d67ab4deace638a838319d5e5c2968d38120c7fd2c53cd5e9e55"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadAgreementCandidates (cyclomatic 34): standalone.roadAgreementCandidates has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 9 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7899c5949bf7f98ad4cb767f32e480b2b11020c430339332fd19a05654e4ea7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cyclomatic 34): standalone.validateOfficialHandoffRegistry has cyclomatic complexity 34 (threshold 15). Of this number, 32 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":"docs/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53b82bf1103618a46cdcba4ba311b41be99efb42013f7f43b5ec05ceac27deb"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadAgreementCandidates (cyclomatic 34): standalone.roadAgreementCandidates has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 9 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"966d4380358ddca13736d463005c8e04ce16690a5528b4bb7522f7ca32b72292"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-local-address.compare (cyclomatic 34): verify-local-address.compare has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6788e28eab6e7e10a8cbc112b2f8a6460e2545a318f1b5df2c138f8da7e7af0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cyclomatic 34): standalone.validateOfficialHandoffRegistry has cyclomatic complexity 34 (threshold 15). Of this number, 32 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":"static/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"946664890806a87122c5eda228d83486ae3506f16ce284c1d19ef1f384cbf17d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadAgreementCandidates (cyclomatic 34): standalone.roadAgreementCandidates has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 9 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aae982f88dfcc77def4d3a1f721c7c5da3fd320ed89630c10b7100ba75e0ad"}},{"ruleId":"D1","level":"warning","message":{"text":"run_eval.main (cyclomatic 34): run_eval.main 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":"eval/run_eval.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfafa8b4f5ecf82771d6de68484fbc1eb10cd953e4036fb170a90123877639b9"}},{"ruleId":"D1","level":"warning","message":{"text":"detector.load_and_validate_manifest (cyclomatic 34): detector.load_and_validate_manifest has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1ed5bc4b18d7687600a27d2509f89d70e8060144a048d03f1f3909f2d63552"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.repairTargetMatch (cyclomatic 33): standalone.repairTargetMatch has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"108cd21466d39d88891b35abaabdceb08547a88e0dd82faabee35bc407fdff73"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.repairTargetMatch (cyclomatic 33): standalone.repairTargetMatch has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a45634cbba9a8c46bca75c8c61c93157600404d2dc96b2776c8edf690c87229"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.repairTargetMatch (cyclomatic 33): standalone.repairTargetMatch has cyclomatic complexity 33 (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":"docs/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"384677ba40aee77347ba369bdeaf3dbe071df0c803a1108d7ca07f1e4fa27138"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.repairTargetMatch (cyclomatic 33): standalone.repairTargetMatch has cyclomatic complexity 33 (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":"static/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d4e35d08e59eabf561ccba56e85f26add0465da8b3cc694f5b9f1cad0c3082"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayTile (cyclomatic 32): standalone.validateHighwayTile has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 3976). 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3972}}}],"partialFingerprints":{"codehealthFindingId/v1":"78879074d2f015624dbfa1614bfbe7fbc60371d132a06b71fc5ab949a8ddf563"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cyclomatic 32): standalone.municipalCityRouteFromGeocode 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c806a61cfba2c2ed232bf9529a382733f3fd0d9c0596f96fcce79a082dc1323"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadNoticeCandidates (cyclomatic 32): standalone.roadNoticeCandidates has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"0186f96ffef4baaee72d3c7f860f2c86255a09071b1dc7e3c176a9b7eb2b1243"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayTile (cyclomatic 32): standalone.validateHighwayTile has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 3976). 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":"android-app/www/standalone.js"},"region":{"startLine":3972}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b3d640e75da09c5b6ee9e30cfe3970e59273075b51d6191149d6053128d51b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cyclomatic 32): standalone.municipalCityRouteFromGeocode 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":"android-app/www/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"83aaf1c06547d6ffe29a60e6a05a072654849d048e858af4ec83af0e5048e566"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadNoticeCandidates (cyclomatic 32): standalone.roadNoticeCandidates has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e93f55fbe642e65387622c2578438721218dc34870f1878d7b25e323f8b9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayTile (cyclomatic 32): standalone.validateHighwayTile has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 3976). 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":"docs/standalone.js"},"region":{"startLine":3972}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeb94f0ebc930cf01b5732930d18b6c22fc410d27b8b7fe3a8d25a271ac17b2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cyclomatic 32): standalone.municipalCityRouteFromGeocode 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":"docs/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51f514f1b5d274ab33787c494e0359a96ebdc798c5caa6000f6f5132c38b0f7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadNoticeCandidates (cyclomatic 32): standalone.roadNoticeCandidates has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e53560c27e260d5a18c58f46fe192e25bf8853bb4f0837402c8895345cc475"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validateHighwayTile (cyclomatic 32): standalone.validateHighwayTile has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 3976). 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":"static/standalone.js"},"region":{"startLine":3972}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2476dbf034660875a206a4d8fd69c1199caa355c94aa38e1e614a85d64c5bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cyclomatic 32): standalone.municipalCityRouteFromGeocode 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":"static/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4ebba925dc88ecaa45b6ca0930aa4649c17a2dbb8adfe26a34aa22de8658cd"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.roadNoticeCandidates (cyclomatic 32): standalone.roadNoticeCandidates has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"70778c93c44362c07ee79d70093853ecedf911f5512c1fd3f6521777f713cccc"}},{"ruleId":"D1","level":"warning","message":{"text":"exhaustive_video_eval.validate_materialized (cyclomatic 32): exhaustive_video_eval.validate_materialized 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":"eval/exhaustive_video_eval.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"40807f316eed6c3bce4a86524acf20c9a7c944eff34b363678a711cbbcd608dc"}},{"ruleId":"D1","level":"warning","message":{"text":"signedServicePost (cyclomatic 32): signedServicePost has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a085a6ab226543bba11b30a293e4aeb8d2a0e8962a23e90986d2924b5cb27f9"}},{"ruleId":"D1","level":"warning","message":{"text":"validatePinnedStatewidePayload (cyclomatic 32): validatePinnedStatewidePayload has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5f4e6d9650c53f3ccc7302335a795b136b5acd6a6ac354ff93ab4bdd6bb78e"}},{"ruleId":"D1","level":"warning","message":{"text":"signedServicePost (cyclomatic 32): signedServicePost has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d5817520fbee607d1506e749bf6d94e1aafaffa0c34fdbb414d8e3b7c6af2b"}},{"ruleId":"D1","level":"warning","message":{"text":"validatePinnedStatewidePayload (cyclomatic 32): validatePinnedStatewidePayload has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e0e70156db0ff3c74cc99220c32b5bd4ae4f8a05820115237f90889fd150d8"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.signedServicePost (cyclomatic 31): standalone.signedServicePost has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"c043743d359462a94fc3bf5794e78626891907f2cbaa32fa6fa5a0b840478155"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cyclomatic 31): standalone.maharashtraRouteFromGeocode has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6c7102d1f409701c30af2ddbc7df99ad4f4dddc713f40f74da2c8f8f68eec7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.shortlistFor (cyclomatic 31): standalone.shortlistFor has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c15aceb7a7a41512bacf9ba982e8beab23186db707e0af7e416d2e67935634"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cyclomatic 31): standalone.maharashtraRouteFromGeocode has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0695221568f57b2b542de786dd78f56eaaf324bb03c6f2beb081ad5feeaf59"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.shortlistFor (cyclomatic 31): standalone.shortlistFor has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"1260be506660540483d7ca9cd83d81076e15b40a37e3ba5d1d6086792ca7439c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.signedServicePost (cyclomatic 31): standalone.signedServicePost has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00c4e393ef344f1743e376709030501ddbd3f4f5f476ecc4bc24daf7ccedd1f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cyclomatic 31): standalone.maharashtraRouteFromGeocode has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a560a559ea14d1ad2184766416f2eb8804a6fbd246207fe30596069c3c5781d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.shortlistFor (cyclomatic 31): standalone.shortlistFor has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"16edb4fcec68c5b8faa6ba37fbb6eaef15fbb6967118bfa17227e484933f7aba"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-local-address.tenders (cyclomatic 31): verify-local-address.tenders has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (verify-local-address.tenders::outcome) 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f50b8f7fb2d4dc75567e39d62af82abb6386e972ebbe005640722b70b00c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cyclomatic 31): standalone.maharashtraRouteFromGeocode has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e9bb9ba39f28d6b9848bc01008955f1b9a3ecbef8bfb472f9e735f59e8e1b7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.shortlistFor (cyclomatic 31): standalone.shortlistFor has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7908469ab5debbaa0f3fa58d15cb4b7c51e36e0b94f3efe43faf2af37e47d851"}},{"ruleId":"D1","level":"warning","message":{"text":"pruneStoredHistory (cyclomatic 31): pruneStoredHistory has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 8 function items inside it that branch (endOf, a function literal at line 8701, keepsEverything, \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":"static/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c51517128f64b2895e06c3d0e82d11eee1721e089c293b7204f680bb241f977"}},{"ruleId":"D1","level":"warning","message":{"text":"addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess (cyclomatic 31): addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e672c408ea36dd11c9c29a047874425bdea03e3409849b6579214961fe0f20"}},{"ruleId":"D1","level":"warning","message":{"text":"pruneStoredHistory (cyclomatic 31): pruneStoredHistory has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 8 function items inside it that branch (endOf, a function literal at line 8701, keepsEverything, \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":"android-app/www/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e932040a59e87e6dac2cc32c4294c6300127e00273220f8f2f200682b7633e"}},{"ruleId":"D1","level":"warning","message":{"text":"addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess (cyclomatic 31): addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ab3afe4e63dbbf117dc85037531dfc0d0b87ef7f5e1d11752b20b2782fae88"}},{"ruleId":"D1","level":"warning","message":{"text":"buildSnapshot (cyclomatic 31): buildSnapshot has cyclomatic complexity 31 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 9 belong to 15 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf89ba4f128d252b5ae1ac16229f03d0d7507340977e3a2af7a9c81c1b1a117"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startNativePreview (cyclomatic 30): index.html.startNativePreview has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"596e1de1a43fa71b0995179b9cef4e4ed7f2a5ee9abac94762cc4bf5ccadf134"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.analyzeViaService (cyclomatic 30): standalone.analyzeViaService has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"7394276e60d339d59be4402b326f94cbf5b3cc3917fd4bcf0599623ee6b73616"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchHighwayTile (cyclomatic 30): standalone.matchHighwayTile has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fce2d1be4d8578fb10430949aa09c74381e1dbee69c2ed1f2821f1ee3ca1e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startNativePreview (cyclomatic 30): index.html.startNativePreview has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"android-app/www/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c86c9ca9b2ef2354ee0c81bc88fbc8ccbf79579e131c834396288afdc0a25e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.analyzeViaService (cyclomatic 30): standalone.analyzeViaService has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b2fea837a7a614c4778f55c637579054dfe92116f3ad72c25f579e204a1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchHighwayTile (cyclomatic 30): standalone.matchHighwayTile has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc57af2e5558541cf05272db2dbf321d4db610bdaaf55c833e23c7e5cc6b95b7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startNativePreview (cyclomatic 30): index.html.startNativePreview has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"docs/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"076e7c9f2296c3e2f8133db384dbaee0c0465e406c85d4069d4ee5e9204737ae"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.analyzeViaService (cyclomatic 30): standalone.analyzeViaService has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda3cbfb5e78e922d9aee37051586ddc7cb45e8ac31c0fd4d7fe980e493372a6"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchHighwayTile (cyclomatic 30): standalone.matchHighwayTile has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd5ff1bb9495896a55f7f371c952f16adf57907a64ee6467102119f8e329747"}},{"ruleId":"D1","level":"warning","message":{"text":"index.tenderShortlist (cyclomatic 30): index.tenderShortlist has cyclomatic complexity 30 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bb3ad13496204ebcb8c13066079d26e03486c10a2358482f548c7b9a3ce1eb"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startNativePreview (cyclomatic 30): index.html.startNativePreview has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"static/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a287ce91fae78d11f888506be33ecd302bdff8fc840eb82edfd4e1fcc1a91f2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.analyzeViaService (cyclomatic 30): standalone.analyzeViaService has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6186e74b9e24afb169429242dc09e721f98cea7ddd3e846730b32beb8d583b1"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchHighwayTile (cyclomatic 30): standalone.matchHighwayTile has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b79fe48652a32443330fd24f79106091098ff68d17cde00d716aa7ab7706fb"}},{"ruleId":"D1","level":"warning","message":{"text":"run.tasks (cyclomatic 30): run.tasks 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":"tools/harness/run.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6927120f09f94b3dccf798e861a7dd9777e49b115dcaef7c4143ed113cff6f71"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.refreshCaptureInterlock (cyclomatic 30): DriveForegroundService.refreshCaptureInterlock has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88ed4bf301580c82e85cbadd26e7142f3685685674773760f13f76d92641443"}},{"ruleId":"D1","level":"warning","message":{"text":"exhaustive_video_eval.main (cyclomatic 30): exhaustive_video_eval.main has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"365030e8ebe801540d70b03822dfac32c2ae752202096870e4dfdc07b0ee520c"}},{"ruleId":"D1","level":"warning","message":{"text":"validatePunjabPayload (cyclomatic 30): validatePunjabPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d074b909456848e633f7f5f0fa885c21bd4dc06be8316d7055018ad6e1ea0ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"validateTamilNaduPayload (cyclomatic 30): validateTamilNaduPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c592910e2b73e2550b4bf31dbdd744df7165ab67cb72adcd5a5f97ed40f64607"}},{"ruleId":"D1","level":"warning","message":{"text":"validateAndhraPradeshPayload (cyclomatic 30): validateAndhraPradeshPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb03e0dc1a7741ca9faec628bfe545b72a430351414485781fa270c56268d34"}},{"ruleId":"D1","level":"warning","message":{"text":"validateTelanganaPayload (cyclomatic 30): validateTelanganaPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97e02ff2863180483f1aa51004e4e50b26d6b3024560a545ba9dbd75f114a16"}},{"ruleId":"D1","level":"warning","message":{"text":"validatePunjabPayload (cyclomatic 30): validatePunjabPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f4a52b14992d412eb4ca0094b3bbad5513a9561557d56c891ff73359841afe"}},{"ruleId":"D1","level":"warning","message":{"text":"validateTamilNaduPayload (cyclomatic 30): validateTamilNaduPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"05708bb1b97c5948e3d5314dda9ca76d30a25911719907200f936fbc40a618e1"}},{"ruleId":"D1","level":"warning","message":{"text":"validateAndhraPradeshPayload (cyclomatic 30): validateAndhraPradeshPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"91759bca5a2a8261f2ce3175a34cb8ac25885dc132e46f0a6c97cdf34b12fe20"}},{"ruleId":"D1","level":"warning","message":{"text":"validateTelanganaPayload (cyclomatic 30): validateTelanganaPayload has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"91238d6b68c7aa683f45a0620ceeaa2bc81f03cca16f28cde85e78b8a4b0b969"}},{"ruleId":"D1","level":"warning","message":{"text":"kgis-layers.downloadLayer (cyclomatic 29): kgis-layers.downloadLayer 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":"infra/aws-central/tools/kgis-layers.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aab806c3c359bc4906db1304196de0ecca2a8fffc10f901fa3d0fc3f50c1cf"}},{"ruleId":"D1","level":"warning","message":{"text":"exhaustive_video_eval._validate_source_manifest_for_receipt (cyclomatic 29): exhaustive_video_eval._validate_source_manifest_for_receipt 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":"eval/exhaustive_video_eval.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7e658530a76f77775b13a065196e36db313a7f5ec868e00a35f5a7f4f8660b"}},{"ruleId":"D1","level":"warning","message":{"text":"createService::detect (cyclomatic 29): createService::detect has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d10fd46d5acaea411ab4cdefcbe8a4c0da1faa8ea65d542adf3592405444c4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive::finish (cyclomatic 28): index.html.stopDrive::finish 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e57c8e625e97a1bf2a5dd27c5e13fb66af70a82377786d4ddd690ecb8e2a12e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyRepairObservation (cyclomatic 28): standalone.applyRepairObservation has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 11101, 11092, 11165). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11068}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57d966776fcade48bcc3ab3f19b1d77d4e7e635087be1b70c5bf7a0b1ea3640"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.highwayContractCandidates (cyclomatic 28): standalone.highwayContractCandidates has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7db29eeb4ef993196f225264669e489f19983e6a9079112435e6499bbed4def"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive::finish (cyclomatic 28): index.html.stopDrive::finish 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"android-app/www/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1908b4b62867d3ee116fcbfe9d74caf093ffdd37e1d63ef60f77966e45050d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyRepairObservation (cyclomatic 28): standalone.applyRepairObservation has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 11101, 11092, 11165). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11068}}}],"partialFingerprints":{"codehealthFindingId/v1":"371554635f5756964b7d48d446d7285de4caead49ebb118853dec824a50ac142"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.highwayContractCandidates (cyclomatic 28): standalone.highwayContractCandidates has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e32e90b9054df819cf62b983757c996901d63b1c01001e94cb6f879eeaaa472"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive::finish (cyclomatic 28): index.html.stopDrive::finish 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"docs/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b2b9d83f9fd4a3c6e3944f25884f4f5cf42c8c2db456d24147729f0d6662e6"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyRepairObservation (cyclomatic 28): standalone.applyRepairObservation has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 11101, 11092, 11165). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11068}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a79e1e4afc13db6ecaad6f1bdc00e4b414c85ec399565d33eaa86cf2dae3326"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.highwayContractCandidates (cyclomatic 28): standalone.highwayContractCandidates has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c4c938ac448e8f43b7ce4bfa144e0ee278d2e0ba1530543bf69d0c394d2aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"core.createService::dispatch (cyclomatic 28): core.createService::dispatch has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 3 other methods here (core.createService::authenticate, core.createService::feedback, core.createService::beyondKarnataka) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"562794c5cca5e1821eade911dd1d62a7ccbc81ba14c8145d9417dec3ce48e1b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ownership-bundle-writer.createOwnershipWriter.addPolygon (cyclomatic 28): ownership-bundle-writer.createOwnershipWriter.addPolygon has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"001e72625498988113bee29c3bcea99c4717ad1a6d0b7383a84bd372c3c3f089"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive::finish (cyclomatic 28): index.html.stopDrive::finish 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"static/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d7d67f7bb2e8aedab4e2d6cb1170f47caa2b237b2e18698c53aff40635e33"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyRepairObservation (cyclomatic 28): standalone.applyRepairObservation has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 11101, 11092, 11165). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11068}}}],"partialFingerprints":{"codehealthFindingId/v1":"614b7d0bb7446896862ff39f0711e3ccd5193b95b187fb7b726e105b56b36c10"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.highwayContractCandidates (cyclomatic 28): standalone.highwayContractCandidates has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"928ef40669c9ea19ef6f927b8d1ee0808538ea9f1cb0ec844ed089fc1ce3ffa4"}},{"ruleId":"D1","level":"warning","message":{"text":"validateKarnatakaBodies (cyclomatic 28): validateKarnatakaBodies has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 7 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 2070, 2079, 2072). 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":"static/standalone.js"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7866a62240e3ed7aa2ae045fbcf212720a9a3476683c9c786a0692b56a8b5ff"}},{"ruleId":"D1","level":"warning","message":{"text":"validateKarnatakaBodies (cyclomatic 28): validateKarnatakaBodies has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 7 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 2070, 2079, 2072). 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":"android-app/www/standalone.js"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"97666ff06fdb9375ae6d7628d7be95d801a508ee9ec428f04c6ddde035ec665c"}},{"ruleId":"D1","level":"warning","message":{"text":"createOwnershipWriter.addPolygon (cyclomatic 28): createOwnershipWriter.addPolygon has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9512ce4f62eee61035027ce01a7d5eb756c82339b25f9b05c92a27b7f7bb1385"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cyclomatic 27): index.html.updateNativeSourcePresentation has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"029b952312a7bec0c0cd3007b3859e70d7c09d8a3d77e01d2ac7a9990de853f6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cyclomatic 27): index.html.renderNativeVideoImports has cyclomatic complexity 27 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58fdd590d82915e772f639ba4e69c69a2898b3c0489b7b3f826891598533e22"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cyclomatic 27): standalone.reverseGeocodeUncached has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"783c739fa428e9f320b2006b688e28cbc00562fa250a104eeebe3646d1b75f67"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cyclomatic 27): index.html.updateNativeSourcePresentation has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"99612ed4196a51c086dd1b94a26351a2958805d96f83a92d6a8d82ed6ca2ae92"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cyclomatic 27): index.html.renderNativeVideoImports has cyclomatic complexity 27 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59a38185406297cd34dc31954d9603c924c053ced78212e715850317d2aaf7f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cyclomatic 27): standalone.reverseGeocodeUncached has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ece5eea029d5a2dd64a038c41c1250617fbf8486812d2559d705cddfa74fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cyclomatic 27): index.html.updateNativeSourcePresentation has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0524cd399747ea6d6ac531ccb2abbbccba9b07ab3231b4292f70d1771cad3faf"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cyclomatic 27): index.html.renderNativeVideoImports has cyclomatic complexity 27 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d21c05b45f25e29281dc3286437d451cc393a5922e1e10e6bd5d732c6ec3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cyclomatic 27): standalone.reverseGeocodeUncached has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f616bf36d068fd2a4d32edbd0cf2bcd028158719ae2043b122b7b0b1ab59125"}},{"ruleId":"D1","level":"warning","message":{"text":"index.callOpenAI (cyclomatic 27): index.callOpenAI has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6086309f679ee9a31393ce40870bc69c716121c8c8c06a4322bea5025c3a93"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cyclomatic 27): index.html.updateNativeSourcePresentation has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"54af85c70f3ebf80d16f4e6da6558052d1b2749d12cc94010e5a5ab0d872fc2c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cyclomatic 27): index.html.renderNativeVideoImports has cyclomatic complexity 27 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"163c8ecc2e90b542f1e5c54f9bc58c384813fabd3d48a85ee42e8517e1bb2609"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cyclomatic 27): standalone.reverseGeocodeUncached has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ffd0be671884dfa5df5ddbc3edbfb692c470846e384dc6e13409eaaca53665"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveModeService.driveTick (cyclomatic 27): DriveModeService.driveTick has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"00498d1fe6707eb9056dcd0c2a4f864985e8326abcf996880a7b055a1036fc5b"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare.main (cyclomatic 27): prepare.main has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd17d111274d6dd1e7eea78b6b3a8c6a59550504222dbb529e69e4f3bc99655"}},{"ruleId":"D1","level":"warning","message":{"text":"createDetector.yolo (cyclomatic 27): createDetector.yolo has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3a75960e614442a04d36f266286ea7b798b1d28b8f0285c8e932c34fabb295"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.deleteAllAppData (cyclomatic 26): index.html.deleteAllAppData has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda5812785143993c0b69b61bef15b987ef8d8d5cf48a682f85129e3a9d7e45"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadAgreement (cyclomatic 26): standalone.matchRoadAgreement has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1ba83d8e3137f50195ff1f6bf4ab06c8da45a0c38a22d7e730d9f5d43fc0b8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.deleteAllAppData (cyclomatic 26): index.html.deleteAllAppData has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"41964db9c75fbda527c046874fc623d60c2a768f3763df29d801882d293f32c4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadAgreement (cyclomatic 26): standalone.matchRoadAgreement has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e086cfcc45fb5f1280044a91cd4f75116b95b80bfa34a47c272af7e162c53e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.deleteAllAppData (cyclomatic 26): index.html.deleteAllAppData has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c30f496c9f61d9a3504bc05450b42ecca907a95befa237c2d259c31b76660bf"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadAgreement (cyclomatic 26): standalone.matchRoadAgreement has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba427be5b9c45a059be54af94e68895b0f0baf71cf1b6a9a4fd86566a937277"}},{"ruleId":"D1","level":"warning","message":{"text":"detectors.createDetector.yolo (cyclomatic 26): detectors.createDetector.yolo 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":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"268d508ded7cc8b4b98663d6058dbaf4232160159598332f5237455310997c0b"}},{"ruleId":"D1","level":"warning","message":{"text":"local-ownership.polygonsAt (cyclomatic 26): local-ownership.polygonsAt 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":"infra/aws-central/service/local-ownership.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24a3616db157aff6628fe4733043b70c8d6e8f73bff2a81d6b1e11f40de0d7a"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.placeFromFeature (cyclomatic 26): build-street-index.placeFromFeature has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83c1c19f4172667509ccae1de976c5e90ba68eb383330f15374c0f42f9a0cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.deleteAllAppData (cyclomatic 26): index.html.deleteAllAppData has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1a51d776191314b708083787f5ddd6463a3925482f6a255123cc2eaad8977c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadAgreement (cyclomatic 26): standalone.matchRoadAgreement has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ecb4bfcce7e57c1e88256693efe8bf11988511ff5d0513b808b6d6ee6e2fe4"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.consumeInferenceJobs (cyclomatic 26): DriveForegroundService.consumeInferenceJobs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c989d43d4cbe69fe465236fcf6058c48957298e9fd078dfa1094d7d57b9d81"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_dataset.collect_owned (cyclomatic 26): prepare_dataset.collect_owned 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":"ml/yolo/prepare_dataset.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"318cbe4f888d50f33ca199cd4fd7a36f4bd29ab7973373f7997a94c456f1e916"}},{"ruleId":"D1","level":"warning","message":{"text":"release.command_release (cyclomatic 26): release.command_release has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/release.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"948146cdede21f65521199afedb418fcee9a56447cfb7b31af25f4fcef71bcb6"}},{"ruleId":"D1","level":"warning","message":{"text":"tenderFromService (cyclomatic 26): tenderFromService has cyclomatic complexity 26 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ca91fd0fbc22080fe2e2d8647dee1d0ae53ac254badb5c9690f41964b8bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"tenderFromService (cyclomatic 26): tenderFromService has cyclomatic complexity 26 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"d605191e3519c4093b12ce6a62d4cf5adf505cc6f6a088b943c3699a31bfacbd"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.publicMapPin (cyclomatic 25): index.html.publicMapPin 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d73451063a28adeec34fa5851223e539f6c2904c3a52575c72f623cf6bce20"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cyclomatic 25): index.html.$(\u0022setSave\u0022).onclick has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc97a295850866bd67cea6e0cdf49c709182ed19f70948fbc74778d27b97faec"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.westBengalCoverage (cyclomatic 25): standalone.westBengalCoverage has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 4451). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"32be5b514491f258a51b42de09b0bcee1bf79d6cb1d5d484d96a9e94bd946a64"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.tenderFromService (cyclomatic 25): standalone.tenderFromService has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"90810c5ea9236015d8f8b38bd2dab1e4a7f736f151d52cbbc452b25ecef0facc"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.evidenceForReport (cyclomatic 25): standalone.evidenceForReport has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88adff8e8e1928d96cb8b64475a53b83fc1dedd4d40118f6bc32ea67f98ce1f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.publicMapPin (cyclomatic 25): index.html.publicMapPin 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":"android-app/www/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb16d358b3247b5f4926e6f8608a8ff126bb98bd9919ba58916860455c3a257"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cyclomatic 25): index.html.$(\u0022setSave\u0022).onclick has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e10b4037f16a04846f4aae1046ce668620b963fd284d1e4b807f78be62e5f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.westBengalCoverage (cyclomatic 25): standalone.westBengalCoverage has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 4451). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dcb1702ac22b4ae443a0165d4e4cf4d963596e042173f44e440a07d3281d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.evidenceForReport (cyclomatic 25): standalone.evidenceForReport has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f553ed07fcc16e6d415994d8be9b183bdc50bcbfd34cc5474344ddc610431082"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.publicMapPin (cyclomatic 25): index.html.publicMapPin 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":"docs/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0160f55e3e074fddb371cf1d5bde77e6eac38d0bd33064ef546c96610e0cb6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cyclomatic 25): index.html.$(\u0022setSave\u0022).onclick has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eac2c359a84e0f19c4052d8a2215280d6ed3b2252312ce6f472dbe84bf10ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.westBengalCoverage (cyclomatic 25): standalone.westBengalCoverage has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 4451). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"537289e4f3185cea1f6d5f75f5375cd4a4d60a11372dcbf4dd63d589d58c3b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.tenderFromService (cyclomatic 25): standalone.tenderFromService has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"09304bd9c094551737d4ec7949c09c8c6d4826b6c07c33056612c37eb2944eac"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.evidenceForReport (cyclomatic 25): standalone.evidenceForReport has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9395b5263c982190c7d5f966a7496d6e630b467e4620c65ba77088db6084ea"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.encodeTile (cyclomatic 25): build-street-index.encodeTile has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d0a6d1fc33a551ddca76f9596571e55d89db06a5a39b89130cf67cc30032ef"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.averagePostcodes (cyclomatic 25): build-street-index.averagePostcodes has cyclomatic complexity 25 (threshold 15). Of this number, 23 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d51676451e4894cfd01f48266bc24d2fb9c12bd8b78f5fdafe97783df6cfc0"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-local-address.read (cyclomatic 25): verify-local-address.read has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"99040a904e8daefa1073ee833620d18040301604236394f91de20d84d2d83b78"}},{"ruleId":"D1","level":"warning","message":{"text":"service.parseRequest (cyclomatic 25): service.parseRequest has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/service.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3c4c517bcf948d2ac5bbe0cf80ef9b1d76af107cdd32d6a94df4824850bf4b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.publicMapPin (cyclomatic 25): index.html.publicMapPin 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":"static/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e254e1a3701c82b2bd0adc2120c0900f037e04bc233d4c5f67f2bdea63fbea4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cyclomatic 25): index.html.$(\u0022setSave\u0022).onclick has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"856ee385fca4d7580320d141f04f101e0c2dd55ccbd269482fa7464db1cd85ae"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.westBengalCoverage (cyclomatic 25): standalone.westBengalCoverage has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 4451). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45a6231e0e99a153e7e4037142986a79f1f40c77c0101cab7c4ea9f7a2adbb3"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.evidenceForReport (cyclomatic 25): standalone.evidenceForReport has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2f378d1c8c9ed04b8d6cddedf7edcd507644671e7a90cb9627a5e78a105213"}},{"ruleId":"D1","level":"warning","message":{"text":"DuplicateDetector.roadEventMatch (cyclomatic 25): DuplicateDetector.roadEventMatch has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DuplicateDetector.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e87319967a4e39b62db186e13465cfe5f6f528ba4984de6b95083c641464654"}},{"ruleId":"D1","level":"warning","message":{"text":"rad_dataset.build_index (cyclomatic 25): rad_dataset.build_index 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":"eval/rad_dataset.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eb2877563c08c8033c223562b3a15eabfab2259e420c632866e6b0691b2042"}},{"ruleId":"D1","level":"warning","message":{"text":"webview-drive-analyse.main (cyclomatic 25): webview-drive-analyse.main 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":"tools/harness/webview-drive-analyse.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72b10a11716ad818cc9d3b924ef7c1119e9d3d252a4d20bfc80860b87f42935"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cyclomatic 24): index.html.refreshNativeRepairTargetCache has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2ace96ef3ff0119523ab88954f37a917752057fa9532e38921ec706053388c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateHud (cyclomatic 24): index.html.updateHud has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"28793a6ce92ec3369c0051473e32e8b64862bfa78a76a804bb2a63e9257e1f83"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.end (cyclomatic 24): index.html.end has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bb35ec70d6dabeec211c60dec68e3d5627816d3d0a6f4bd3a11ab89c373cc0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.serviceError (cyclomatic 24): standalone.serviceError has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38200c4c3e20bfd8710cf8d2b71eb7b3f2ff20c5f8607ed160a24f4adebd608"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cyclomatic 24): index.html.refreshNativeRepairTargetCache has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bfa6bb7b343e0e2654827476228898c69549effd827cf947c4b54fca978b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateHud (cyclomatic 24): index.html.updateHud has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fef1fd6fb40e8c9ebe0089a65206175d1640df1f370ea66235a456e6748521"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.end (cyclomatic 24): index.html.end has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"8904a999555974621495643f7149c04878739ffa65b6e3d76bcdc1980a549858"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.serviceError (cyclomatic 24): standalone.serviceError has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"217499f7d7dfd0a9371e14e96ac5f5ab6c26c835426af265edbaad532ef110ec"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cyclomatic 24): index.html.refreshNativeRepairTargetCache has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"97887935c406809750500beab56e70a6e8f960cd269d0a300c54cb7b041e10e6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateHud (cyclomatic 24): index.html.updateHud 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":"docs/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0426ef94f5d3889700904f01c714f2235dcc9976a179cd1a642d7da644203149"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.end (cyclomatic 24): index.html.end has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6110529ce897ee54c357be85124918592c0f3f89a9880e6c05ec9203a0cf9467"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.serviceError (cyclomatic 24): standalone.serviceError has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b9be946613fd398b031a60739b168e76d5a47ecbde34c12d66c6e239d8f6e5"}},{"ruleId":"D1","level":"warning","message":{"text":"local-address.createLocalAddress.answer (cyclomatic 24): local-address.createLocalAddress.answer has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8320715706be8a5b43be0f26006f757ba7964c70462d3369ab507d6e386f7f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Area.pointOnSurface (cyclomatic 24): Area.pointOnSurface has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fc67d6a4ae0b52d90c83378f984efd098a200a65bffc81825bb901776fbf7d"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-local-ownership.exactMetresToHighways (cyclomatic 24): verify-local-ownership.exactMetresToHighways has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-ownership.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e5cfd854d679157c5a6d9082a0860b1f8fe91be56db4ad09bf256fb06cd9a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ward-tender-vocabulary.main (cyclomatic 24): ward-tender-vocabulary.main has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ward-tender-vocabulary.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"868647db828615e5ae8d89f911acafe97bc605657a066a57a9292770c60a44ee"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleImpact (cyclomatic 24): index.handleImpact has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3582}}}],"partialFingerprints":{"codehealthFindingId/v1":"665ebcff2425ddedcabfa68283b2d1efec72e336a27e5ee5c55c5351b49b366a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cyclomatic 24): index.html.refreshNativeRepairTargetCache has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5546ce50cfdb3b132a6b8b5e9e73a3148fa9c62da4dfdca644192142d497cc7c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.updateHud (cyclomatic 24): index.html.updateHud 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":"static/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c460344b8316f08ee8564a41ee91cf85d3b922068c751ebff276fb0b19307d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.end (cyclomatic 24): index.html.end has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7279add84a82a220c8588433f92eacf2a0000195ba186a9c5562971472282f96"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.serviceError (cyclomatic 24): standalone.serviceError has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd67e994b64212e27e8f036e895b0fd31d8328bb8ee2cc051326d50fb9c5e4d3"}},{"ruleId":"D1","level":"warning","message":{"text":"run_rad_eval.main (cyclomatic 24): run_rad_eval.main 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":"eval/run_rad_eval.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40dbccccf3b55180560f878dc7999f5f8f8bf44790020c63da698f070414d75"}},{"ruleId":"D1","level":"warning","message":{"text":"handler.parse_request (cyclomatic 24): handler.parse_request has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/handler.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cac47a1753004a2d797246007b2a506acf3ca96e2a900719d1684d55ec8270"}},{"ruleId":"D1","level":"warning","message":{"text":"parity.compare_prediction_sets (cyclomatic 24): parity.compare_prediction_sets has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/parity.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6729f2ed3439725758b14e242492e2b9fec9e84e9f7930f2a8f85c8d8fec2a"}},{"ruleId":"D1","level":"warning","message":{"text":"createDetector.openai (cyclomatic 24): createDetector.openai has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f752a275c850c6e6107865b49a55f1e6ca03ca1d306635ab59670fec17fd7144"}},{"ruleId":"D1","level":"warning","message":{"text":"createLocalAddress.answer (cyclomatic 24): createLocalAddress.answer has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16da02a4634aae2f2f24f689df7e22a01fdb1196224aaae85073417ecae9b4c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cyclomatic 23): index.html.presentNativeStoppingStatus has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d60adaf93ab5e595110b21712a3010072c5d3115ee7347f08d37237b7827222"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive (cyclomatic 23): index.html.stopDrive has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd09a8df136ff16b92d80e52418bb302d4cdbeb5b5f21eaf2aae9278aedc3896"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleAppBack (cyclomatic 23): index.html.handleAppBack has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddf61e3317da99bff4689b0f1ee70b59febbf380e05771325c56ec121a1a4da"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.hasCoverageGeometry (cyclomatic 23): standalone.hasCoverageGeometry has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (validPosition, validRing, validPolygon). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068ce1f62930fe18125b298f9bb826d011b544d8efd0fbf7284640c9c1ef09e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cyclomatic 23): standalone.savedMunicipalLocationMatches has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"596ba3891e4d0f3c8471557e7cadd1ce52a653690de337c46db66890d031364a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cyclomatic 23): index.html.presentNativeStoppingStatus has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e9e5579b52cba6941118b95c4f985a4f42518226d7a010d3c03e8aca869a75"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive (cyclomatic 23): index.html.stopDrive has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"android-app/www/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cccef35d8657c9fe2582baa4ba9fc82931e872f38628b33fa6a3cb9fa8e956"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleAppBack (cyclomatic 23): index.html.handleAppBack has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9104032f24fe972464ff09b4bd1570f21ed79418b61dde5a5c55d0e6525705df"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.hasCoverageGeometry (cyclomatic 23): standalone.hasCoverageGeometry has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (validPosition, validRing, validPolygon). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd995b53d29c3f431f58134e36c76b654e13bfa85ddf9bd5d816d2ac8eacbe08"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cyclomatic 23): standalone.savedMunicipalLocationMatches has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c62217472b41ad25aa36ddc9e0fcc4755e2f9f9bc787a6c19985734c1cd709"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cyclomatic 23): index.html.presentNativeStoppingStatus has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ac54c63e92b3538dc1b9481c6237782f6d361c924a697350c0b8db3d79c404"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive (cyclomatic 23): index.html.stopDrive has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"docs/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b32819e2b935b0b27d5277f67f1f0059341ddbf963c27c25c7c40474872a57"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleAppBack (cyclomatic 23): index.html.handleAppBack has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"569635225bdbeea6a37abff3c360a9d84047322d2165ded5f1663294be1a4172"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.hasCoverageGeometry (cyclomatic 23): standalone.hasCoverageGeometry has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (validPosition, validRing, validPolygon). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5617c28111d2d2ac57f9e2f9371213d4efb0f51c3e8598f2fdb467545d340754"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cyclomatic 23): standalone.savedMunicipalLocationMatches has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e2b1b72fdb2cb0f085aad1faa48253d991f95b6be53147fefa0d5a7b317705"}},{"ruleId":"D1","level":"warning","message":{"text":"detectors.createDetector.openai (cyclomatic 23): detectors.createDetector.openai 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":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1dc575ee8b9193bfbd9b86895899f8eecf41109140390891fb12cfc0652a72"}},{"ruleId":"D1","level":"warning","message":{"text":"index.recordMetrics (cyclomatic 23): index.recordMetrics has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7ef258cb887dd9d00bf934424abc6abb0d9e29fc29db65d1bfdbb5eea6d709"}},{"ruleId":"D1","level":"warning","message":{"text":"index.verifySharedDetectionReceipt (cyclomatic 23): index.verifySharedDetectionReceipt has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"423238971eff8cd223e5a98a6cf67e272ee3a41ab5f41e0e2477cdfd84e50ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.dispatch (cyclomatic 23): index.dispatch has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6a505ddc3fad8436125e942f988bf63d176764a9abd94a50519893562c5c8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cyclomatic 23): index.html.presentNativeStoppingStatus has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb58a8cd67f996ada72b0f7b1e52cdad554006cec3fb1ab71129b36b04d0dab6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.stopDrive (cyclomatic 23): index.html.stopDrive has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"static/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"11006d2b95af2a38bccbfb6237b5682cb304282b4e7a600f507b56ed15187870"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.handleAppBack (cyclomatic 23): index.html.handleAppBack has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca486a27db3a54933697bc05df1c438c6e2c59bbe6bdd94f28a7dae1c91a8be"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.hasCoverageGeometry (cyclomatic 23): standalone.hasCoverageGeometry has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (validPosition, validRing, validPolygon). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"669e5a6074e33d49a3f829fa7fc9828bd91e5505375e7dfa3ceb57180f99bf22"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cyclomatic 23): standalone.savedMunicipalLocationMatches has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"72588477a146fb8848a931551f23bda5b16098e41e8fa7fe3872c9dfc6546a25"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.startScanLoop (cyclomatic 23): DriveForegroundService.startScanLoop has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9cc50933a615aace4f616c4155236373c8bb844e21926cc1bdd08e83cbf537"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.scheduleCriticalCameraRecovery (cyclomatic 23): DriveForegroundService.scheduleCriticalCameraRecovery has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3863400f79580da60ca1274fca489db36948e07e1d21730e324ca33806bcd6"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeRepairCandidateMatcher.selectCandidate (cyclomatic 23): NativeRepairCandidateMatcher.selectCandidate has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRepairStatusEngine.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc631ecc000927d6626536a285da854b90999a056d7e2639fc053a1740ff16b"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeBridgeJpeg.isPlausibleJpeg (cyclomatic 23): NativeBridgeJpeg.isPlausibleJpeg has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/NativeBridgeJpeg.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b585610e4b4bb7f9ac881ca3f395878cb1aa29ce73284ac442d630823a955d7"}},{"ruleId":"D1","level":"warning","message":{"text":"run_rad_eval.validate_result_rows (cyclomatic 23): run_rad_eval.validate_result_rows 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":"eval/run_rad_eval.py"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ba58edab81e2b03e196ed804109a2e116c0e36622e0a76d8a4128f28e4b11f"}},{"ruleId":"D1","level":"warning","message":{"text":"detector.validate_release_bundle (cyclomatic 23): detector.validate_release_bundle has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b977840940f68135962a3040e50a7d6c2d16a8895862dc6bd7a164f62b0ec4"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate.evaluate (cyclomatic 23): evaluate.evaluate has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/evaluate.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fba454de127cabf14ee841e8a620c1766a4e62e3f5889fde01b4a4bc9471a7"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate._score_operating_point (cyclomatic 23): evaluate._score_operating_point 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":"ml/yolo/evaluate.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fde8dc0e21865fae363fc04145bdd4f04a472efb29bee19ee8f9c4c73c5c22"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzeImage (cyclomatic 23): analyzeImage 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f9a0d503a318668ac7b747fbe45990a970cf7ffb9611a1993a03e1763e5b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzeImage (cyclomatic 23): analyzeImage 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65afbbdfc6ff25e826b2c1a6b1365e536d860e5aacadfc062939a47af75985a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.performNativeDataSync (cyclomatic 22): index.html.performNativeDataSync has cyclomatic complexity 22 (threshold 15). Of this number, 21 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ed8ada20f4115d3b5e174c1995608fec6e8fc68f3b6d37c62ddb03c6f80647"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.recoverDriveCamera (cyclomatic 22): index.html.recoverDriveCamera has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ae246a668ec81e5aea96839e237c14ba7fb8264bb91402eb1667d74542751e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drawMap (cyclomatic 22): index.html.drawMap has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 4 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"812b620e6d0c0b8303ff112b61123dd8d064036879b76c3d7a857bc80a5a038e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.analyzeImage (cyclomatic 22): standalone.analyzeImage has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3480e3b2e3fc0bda30c395548dd09ba41868ebaf51941124355aa1833dc37a94"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.authorityRoute (cyclomatic 22): standalone.authorityRoute has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c0755b932fcb95530b0856f1652c08278ee9ae225b04c5bae89845f39c1406"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kgisJurisdiction (cyclomatic 22): standalone.kgisJurisdiction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead0cf08bd5b5dd0434c162f791da072e4b1eff7b0a81a7a1e4959db16d6b88"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.centralPotholeRequest (cyclomatic 22): standalone.centralPotholeRequest has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"d326fd80fe6acdbd91f0b68af0abed65e5078a03dd46de4eed046f4b1c374023"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openBengaluruHandoff (cyclomatic 22): standalone.openBengaluruHandoff has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9808f5cb2f0a07c5531dc840b3d1e6c5e24ca6248858b0f89bbb6a6e82571f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openNationalHighwayHandoff (cyclomatic 22): standalone.openNationalHighwayHandoff has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12277}}}],"partialFingerprints":{"codehealthFindingId/v1":"66197fb9ba25ecacaa082fa54696002a640c562d42dfbf669cb1bf7ab68249ca"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.performNativeDataSync (cyclomatic 22): index.html.performNativeDataSync has cyclomatic complexity 22 (threshold 15). Of this number, 21 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":"android-app/www/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca619f99875dfb2bef872b17d8345fb8cf7b965be4576c20bfec4fcd8667cd75"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.recoverDriveCamera (cyclomatic 22): index.html.recoverDriveCamera has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"174ce7dd1fe2d650ab470b05da3a712448e9d82dcc5a1e8b6cc5d9d79a6074c8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drawMap (cyclomatic 22): index.html.drawMap has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 4 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":"android-app/www/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ac5373fd47b6e78897d6a5ab53ba91ecbc3ae291843532912774fae02e43fd"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.authorityRoute (cyclomatic 22): standalone.authorityRoute has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"626dad3f9305bb0b08615701cee739a49766ce8a146640e75ac547bed2705e33"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kgisJurisdiction (cyclomatic 22): standalone.kgisJurisdiction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6760f86c949c729ca62e2ff710588e8eb7112b55c72b8eb43655dc1dcb1e4c11"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.centralPotholeRequest (cyclomatic 22): standalone.centralPotholeRequest has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"18be8ebad4a36a3ea5e7f0d16cc08e7e0fc8161f45004b6bf28777a3cddaf9a4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openBengaluruHandoff (cyclomatic 22): standalone.openBengaluruHandoff has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12228}}}],"partialFingerprints":{"codehealthFindingId/v1":"69df20269eb78af37904df3c1590146bb11c56eb10242acaaf05dea1429c9a68"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openNationalHighwayHandoff (cyclomatic 22): standalone.openNationalHighwayHandoff has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0da4b6a5dc4ad1cff8af543ac9821a567891bf45f212010b4243f66e4b8be3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.performNativeDataSync (cyclomatic 22): index.html.performNativeDataSync has cyclomatic complexity 22 (threshold 15). Of this number, 21 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":"docs/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"136937a2096cb0cc054ad827df32d821bb1c25b72c20caf1f13edc2c875f5582"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.recoverDriveCamera (cyclomatic 22): index.html.recoverDriveCamera has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f9aed975f22fbc6c707dc4047209a6114fab366098edeec56c48bfb326cb04"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drawMap (cyclomatic 22): index.html.drawMap has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 4 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":"docs/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"0198dc4bb8c42cae9b6164ab2a34cfa4821d8523210f859e9e3757c373825aba"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.analyzeImage (cyclomatic 22): standalone.analyzeImage has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"90497f9041d18a6a32fcf59982e232a646b6b130fcaf36226cbf456a99b3ddfa"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.authorityRoute (cyclomatic 22): standalone.authorityRoute has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1a53acc65ea0771b0ff3d370a9934bc67413faee7a2ffd43821b41c039dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kgisJurisdiction (cyclomatic 22): standalone.kgisJurisdiction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"45919b31c7d96fbf36c67cc4863c8fe704f0539aa18374bf7a751be81f88fc4f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.centralPotholeRequest (cyclomatic 22): standalone.centralPotholeRequest has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaa57594b5d71cf662e9c86b0123e319116b3626f8cb363a78c95b99bcf8f89"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openBengaluruHandoff (cyclomatic 22): standalone.openBengaluruHandoff has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12228}}}],"partialFingerprints":{"codehealthFindingId/v1":"76279582de864582c4fe4ae44fed17c5ec75651d2189a5f65c884c5ab01957b1"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openNationalHighwayHandoff (cyclomatic 22): standalone.openNationalHighwayHandoff has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12277}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacfdadd9e12936ecca1c19c2cb2a1ce6a06e465f546905dadba511e54a3ba84"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.prepare (cyclomatic 22): build-street-index.prepare 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b57bc8776b715a7846cae179ea8c3cc42253de438be095d009239bb9a217132"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-local-address.sample (cyclomatic 22): verify-local-address.sample has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cab71ba5551bf76df6d95cbb601d2a4f2fddc346ae4be62db2a27da5e65547"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.performNativeDataSync (cyclomatic 22): index.html.performNativeDataSync has cyclomatic complexity 22 (threshold 15). Of this number, 21 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":"static/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ece8486f13433d1c83efd2c0fdf4ea3cefb9e4f64c2c63870895614b7a046be"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.recoverDriveCamera (cyclomatic 22): index.html.recoverDriveCamera has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e241da09f7f14d2c15be4eaf4105f74d1e3b0c9ac919696d6c54f3d7ee61a4ab"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.drawMap (cyclomatic 22): index.html.drawMap has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 4 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":"static/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc37b850d80ff8ffa549680b673ddf7e59be480203eb4d9e7ad4701f1a3868d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.authorityRoute (cyclomatic 22): standalone.authorityRoute has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d2dfbad021940631c26276b97f0a68e207d82210d12e2f72dcb70b35b5b527"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kgisJurisdiction (cyclomatic 22): standalone.kgisJurisdiction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04efb02a34ea26ccd00486aa20ddc35ab474510555dc82d6750293cc068463"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.centralPotholeRequest (cyclomatic 22): standalone.centralPotholeRequest has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1134eba874104429e887be9573cdb4023f8f33d1533125faad60400101e6d18"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openBengaluruHandoff (cyclomatic 22): standalone.openBengaluruHandoff has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12228}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb74536c7b3cc90f167cbf1bfcc56fc36737424dad80da11b8541b91256f0f5"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.openNationalHighwayHandoff (cyclomatic 22): standalone.openNationalHighwayHandoff has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8f18e55b28fe971a2a40f710339c483af055592c2cdfa23461ada00a8740c9"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.startDriveSession (cyclomatic 22): DriveForegroundService.startDriveSession has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"835dec942c5d0355483f849728946389c788e1bbb82a118fcb6569aecb6bcb15"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDriveCameraManager.finalizeVideoSegment (cyclomatic 22): NativeDriveCameraManager.finalizeVideoSegment has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"10863f3cfad373f9fd5a40b74259aa41191ec1b2a4cec51f41e9dc83ea894663"}},{"ruleId":"D1","level":"warning","message":{"text":"rad_dataset.list_remote_inventory (cyclomatic 22): rad_dataset.list_remote_inventory 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":"eval/rad_dataset.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0653d4e0798eddaef82c8252a20ded3bc6fdfd0a2af31809aade98ab6d9915"}},{"ruleId":"D1","level":"warning","message":{"text":"run_eval.native_decision (cyclomatic 22): run_eval.native_decision has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adb0f19736be18fc8440ba4b93a8d2a1c185f01a9a5a92416cc10a3027eec74"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cyclomatic 21): index.html.renderReports::cardHtml 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. This shape REPEATS in the file: one other method here (index.html.renderReports) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5ca0f10f760ab86d6a2b8a33ac25fc70cc4e2ace2752c04325fe3af116c5c9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cyclomatic 21): index.html.renderReports::cardHtml 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. This shape REPEATS in the file: one other method here (index.html.renderReports) 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":"android-app/www/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa1c3ffec70499fe5a35f6b5b82fffb2fb2151d27793b434af9b4baa31c0351"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cyclomatic 21): index.html.renderReports::cardHtml 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. This shape REPEATS in the file: one other method here (index.html.renderReports) 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":"docs/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ca0c45cddb30fd518e7b293e3bfaccfc8a4e304df5338751dd288f7201c3ac"}},{"ruleId":"D1","level":"warning","message":{"text":"india-ward-tenders.matchIndiaWardTenders (cyclomatic 21): india-ward-tenders.matchIndiaWardTenders has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"940235b94c206ce8f748d533aa12eca8c36b9f123215f502a212e941cc1583ad"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cyclomatic 21): index.html.renderReports::cardHtml 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. This shape REPEATS in the file: one other method here (index.html.renderReports) 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":"static/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5e16881905d920645ae5bda7a72f4eb63caddd674245349b488a867970ea9b"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDriveCameraManager.processImageProxy (cyclomatic 21): NativeDriveCameraManager.processImageProxy has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"704a6f1df52b7d1a6b70e0acdc5c7f00d6cd201b774f40c87be0e94dd9e27620"}},{"ruleId":"D1","level":"warning","message":{"text":"exhaustive_video_eval.validate_results_receipt (cyclomatic 21): exhaustive_video_eval.validate_results_receipt 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":"eval/exhaustive_video_eval.py"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7e93a793aeac12d985dd7d4350fe8db27f8f6cc8ce8ac27f70a58d713d5e31"}},{"ruleId":"D1","level":"warning","message":{"text":"rad_dataset._download_one (cyclomatic 21): rad_dataset._download_one 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":"eval/rad_dataset.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3778558765ae1e6fd6e7b3bf01837e68b252413210206a704aa019a496dd56"}},{"ruleId":"D1","level":"warning","message":{"text":"run_rad_eval._verify_frame (cyclomatic 21): run_rad_eval._verify_frame 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":"eval/run_rad_eval.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7894e34a3d91dc4b42ae15b63449c9271a4dffa3be4b4ada39eec706ae530112"}},{"ruleId":"D1","level":"warning","message":{"text":"build_manifest.main (cyclomatic 21): build_manifest.main has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/build_manifest.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daedd4e4fdac157119cb4109b4ce367f53df396997df2ba43e5850bb9239c17"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare.rdd2022 (cyclomatic 21): prepare.rdd2022 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":"ml/detector/prepare.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e59eb585ac42c8ef62bd82be5d0b18243d9d221b33af1a797d7172ca9c09fa"}},{"ruleId":"D1","level":"warning","message":{"text":"validateTenderPack (cyclomatic 21): validateTenderPack has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"61212b725c29ff3906fb20ec0cd66b02393d968fcaf45ae30c6e8757c129c24d"}},{"ruleId":"D1","level":"warning","message":{"text":"validateTenderPack (cyclomatic 21): validateTenderPack has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77e2afc5e70214a3bc2b16c2ac3eb60afd4bd05ead641ec6388f75a6a235451"}},{"ruleId":"D1","level":"warning","message":{"text":"parseTile (cyclomatic 21): parseTile has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d31d60a3cf6b50e4816b54e5bb626044362d860d245bcd1f9abb11c30f8bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"junctionsOf (cyclomatic 21): junctionsOf has cyclomatic complexity 21 (threshold 15). Of this number, 18 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"346380b0176232d2cfdab5ce8bcdcfb1b19439b17176e7ffbb531b5a04aceb26"}},{"ruleId":"D1","level":"warning","message":{"text":"createHandler::handle (cyclomatic 21): createHandler::handle 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":"ml/classifier/lambda/service.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23ee31d03e64d6a39ef01ca3ea8f4147ebbbf5eb2cee13f06bbcd2e98c6df00"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedHelp (cyclomatic 20): index.html.unroutedHelp has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a3df9a8d7f6d3fb0fe0b7bf0016c1de06f07114b7fef3030898b7c6952f0c0"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cyclomatic 20): index.html.renderNativeDriveStatus has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb31df15a269809db8f86888a23034fa7627c3dd39cbdd19f925ec8a0980d7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cycleClip (cyclomatic 20): index.html.cycleClip has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4493c6d0038f29812b091d41913a95aad23482e463a31f694097a494a01b2f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyCentralPothole (cyclomatic 20): standalone.applyCentralPothole 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2272581061724aa75f07759a145a63ac8790620fe50f8aab97c4e0bf66a8c53"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedHelp (cyclomatic 20): index.html.unroutedHelp has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f9a962743c0f358b5422306e0fe11c65899d9b37d295e861290e34aa161b1f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cyclomatic 20): index.html.renderNativeDriveStatus has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"897fb738f79feb872207f59d65d7af4b2b8159e6f37a3ef860400c1438008788"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cycleClip (cyclomatic 20): index.html.cycleClip has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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":"android-app/www/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"942ec9a7b94ce8a8afd03dbd7c411d77a244ad5f5a2736028de2949346922f2c"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyCentralPothole (cyclomatic 20): standalone.applyCentralPothole 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2e05751bf1c1e7e80980c6c5dd192f34f54784bf0c5aeb40708ebbe3aceb16"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedHelp (cyclomatic 20): index.html.unroutedHelp has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8481dc0e31179abb2b1dd78d6ddee12b5aadd6ae01ce404179b4e19334087f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cyclomatic 20): index.html.renderNativeDriveStatus 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":"docs/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3209bb91c4fce1eaa75115a8a5b029234deef9e9e830c072b0127c4b96b185ee"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cycleClip (cyclomatic 20): index.html.cycleClip has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"971b4a13ebe05c9eed3a006046155e0eefea4fef0be7a0d5b392d5ca4e9a2a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyCentralPothole (cyclomatic 20): standalone.applyCentralPothole 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcdb30b44123fbc9332f98f6bdfe8113dac4a4d12cd67eb4d0d605c84d089cb"}},{"ruleId":"D1","level":"warning","message":{"text":"local-ownership.openOwnershipBundle (cyclomatic 20): local-ownership.openOwnershipBundle 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":"infra/aws-central/service/local-ownership.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1a1789724c1a625406c385d811386c5e29074b75fc09a99662a3780b8d44d6"}},{"ruleId":"D1","level":"warning","message":{"text":"service.createHandler.handle (cyclomatic 20): service.createHandler.handle has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/service.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"114702dc1fc040145be117007cb078b9e7cc951d0e5f9071d52a9133d3541456"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedHelp (cyclomatic 20): index.html.unroutedHelp has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe469e386fc6ed7efe98ee499feed90c1db55ee3493e58b973f9ecf6ac2304a4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cyclomatic 20): index.html.renderNativeDriveStatus 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":"static/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f21bc5605e52902acbe70e87a68e16d012bf263e02e24f415c65ee6980071b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cycleClip (cyclomatic 20): index.html.cycleClip has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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":"static/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"59be25f0f2a6673afb83a013ec26e4da43b98925e9323528ca67f8c2608d3ec0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.applyCentralPothole (cyclomatic 20): standalone.applyCentralPothole 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ac6b84d2aa8002133e0beb3180c6a91999af4f06aeac2c73641cee3bcab35a"}},{"ruleId":"D1","level":"warning","message":{"text":"CentralServiceClient.resolveTender (cyclomatic 20): CentralServiceClient.resolveTender has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/CentralServiceClient.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9df0855160a32fb0b3369812f5c9bb9cd87d099b26f0cf5a744ceb64f698a"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDeduplicationEngine.checkAndCommitReport (cyclomatic 20): NativeDeduplicationEngine.checkAndCommitReport has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ff6481a15939024600a4919dd75474ecc8a46ed62ab03630aeebd989c0eb5f"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeRtspFrameSource.onImageAvailable (cyclomatic 20): NativeRtspFrameSource.onImageAvailable has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00fe07305b19e63be94d4ec80440aa721ce62993cf9d041b6cf4b9630b751e2"}},{"ruleId":"D1","level":"warning","message":{"text":"materialize_private_eval.validate_ground_truth_manifest (cyclomatic 20): materialize_private_eval.validate_ground_truth_manifest 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":"eval/materialize_private_eval.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ecfb9a831305a1c1504b896b3a11e2625f7b9ffff53bb9f4e562a462286fda"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate._average_precision_at_iou (cyclomatic 20): evaluate._average_precision_at_iou 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":"ml/yolo/evaluate.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2cab68f39bba6f2a948b282a44a3b83fb6c66bf8a97b8344d4cbc2d11a420e"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_dataset._parse_audit (cyclomatic 20): prepare_dataset._parse_audit 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":"ml/yolo/prepare_dataset.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a9eac80a04f5bc4fef658c8c5011b4116c8b675070a2e9d16475c751db9287"}},{"ruleId":"D1","level":"warning","message":{"text":"loadInstallationIdentity (cyclomatic 20): loadInstallationIdentity 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"26491179c75791f0c5df6b3a73a733935bb23e80485dd8d15b7d48e0e99c79b8"}},{"ruleId":"D1","level":"warning","message":{"text":"loadInstallationIdentity (cyclomatic 20): loadInstallationIdentity 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b149af2d58846aa71e4b8a91f97875c59f012b2c3461851f66a3b94f73ad4815"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cyclomatic 19): index.html.validateDashcamRtspUrl has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acafda945acc1fe79479d0d914734a09f8467a6c71349322955fdc0efd09530"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.fetchWithTimeout (cyclomatic 19): standalone.fetchWithTimeout has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c73ed3f401fa11e6074bc3d415cfc20153ef453d37eaf5e968cdeb3a17f1c7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validMmrAuthorityBoundaries (cyclomatic 19): standalone.validMmrAuthorityBoundaries has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1692, sameIds, a function literal at line 1698). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d04fe018ceb27e19e9b94a20be4e42cc9485c3c897979fd01e53a3dd4cf504"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeForIssue (cyclomatic 19): standalone.routeForIssue has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd4dcc6faf2bfe8c513f88fc90f88cc6f08080a36bb39fd2097cf32793b60e9"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchesEverySameDriveSighting (cyclomatic 19): standalone.matchesEverySameDriveSighting 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 2 function literals inside it that branch (lines 6173, 6174). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"518b48cb9ccbbf667e97c749f10596cf5f549c6e7a4e3c2aed0f8544ae9a1af7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchTender (cyclomatic 19): standalone.matchTender has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06678be6745453cae40423af891a973615615adf7e9a3a67830eab546227599"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.pruneStoredHistory (cyclomatic 19): standalone.pruneStoredHistory has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22b69ec28aac97fbddece5087d9fe1b6d2f594e0e58c187cf8dd3aab1a0acd9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cyclomatic 19): index.html.validateDashcamRtspUrl has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3bb19755a43ace4d3a9d0c69c54faeff309cd3957273c66166829bc88cb2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.fetchWithTimeout (cyclomatic 19): standalone.fetchWithTimeout has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00ef3dfab071da2a8b59c459ab875368b985acbfb0db9d96e2f9279a6215ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validMmrAuthorityBoundaries (cyclomatic 19): standalone.validMmrAuthorityBoundaries has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1692, sameIds, a function literal at line 1698). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"22db977a5d014176f1653f4ddbfeae86d2cf75d2d18969f6f833a41b056bfd7d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeForIssue (cyclomatic 19): standalone.routeForIssue has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bf279f5e3ba9a605d5cc6db9f8d6a25506f35eb482c119459da4a2ec74e847"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchesEverySameDriveSighting (cyclomatic 19): standalone.matchesEverySameDriveSighting 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 2 function literals inside it that branch (lines 6173, 6174). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0c94a1b6079f8916b0fbd6a7ca6b416053f3429bb966d158287fc038434802"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchTender (cyclomatic 19): standalone.matchTender has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc953c033582b6f18b65867663baa6d58ac34312a70959266fd7a1214e97ee6"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cyclomatic 19): index.html.validateDashcamRtspUrl has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a51691178bf782da12afea06644097d1744f5d54aa615060810c3f8f04d608e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.fetchWithTimeout (cyclomatic 19): standalone.fetchWithTimeout has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f75bc337932a1154128980cd8a8da574e8e5c95c6b20a522327481ccbdbe068"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validMmrAuthorityBoundaries (cyclomatic 19): standalone.validMmrAuthorityBoundaries has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1692, sameIds, a function literal at line 1698). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"1989f8abf8e7143c14a829e6ad225844e5a48a16db9bb2d6fc67a22505d53847"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeForIssue (cyclomatic 19): standalone.routeForIssue has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0d289c2f43236d460450382576befcf45244506aa0f9a8484deb3c0512e845"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchesEverySameDriveSighting (cyclomatic 19): standalone.matchesEverySameDriveSighting 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 2 function literals inside it that branch (lines 6173, 6174). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fc5c0275c9e3198b35db186edbc81849342c47dc07fe35d48bbbb43a62c755"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchTender (cyclomatic 19): standalone.matchTender has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a73b4a883eff478ac37b180cb0097bc327fbf5ceda239650f8b0813194dff8"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.pruneStoredHistory (cyclomatic 19): standalone.pruneStoredHistory has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ebe11004746fad6a06dc31728739414424008095accd868c97ab76231a1962"}},{"ruleId":"D1","level":"warning","message":{"text":"india-ward-tenders.noticesOfBody (cyclomatic 19): india-ward-tenders.noticesOfBody 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2461247c8416ca87ef8259c96cda0613565e969c24e1c9d3f37be9dfb24bf115"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.createAddressModel.readBack (cyclomatic 19): build-street-index.createAddressModel.readBack has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf2be60c74693d06c05f912c069380b3c9c7c1c101ba1821c6c804f591b9a3f"}},{"ruleId":"D1","level":"warning","message":{"text":"india-ward-coverage-report.packGeometry (cyclomatic 19): india-ward-coverage-report.packGeometry has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (walk, a function literal at line 127). 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d40d447755fcfa2b6991723358baaa7f7d44e278283f1a705b0f7fe44167386"}},{"ruleId":"D1","level":"warning","message":{"text":"india-ward-coverage.positionCheck (cyclomatic 19): india-ward-coverage.positionCheck has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc4b8cbcaa6618ba2cda0e7b28006cd749f8976a7102dc575c053c4c60f2101"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleMap (cyclomatic 19): index.handleMap has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f3e68c746dc366713d10ae1316707d7c24bf86905144901e933bb40778a8e4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cyclomatic 19): index.html.validateDashcamRtspUrl has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4506318ce2963d81078eca5bda40d404f6fb3c5d1d7e4f006d99d18c910f4b09"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.fetchWithTimeout (cyclomatic 19): standalone.fetchWithTimeout has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734b00764c4bb9753f028ba719118ad5a686c40ee54ddd630575814af8b964a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.validMmrAuthorityBoundaries (cyclomatic 19): standalone.validMmrAuthorityBoundaries has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1692, sameIds, a function literal at line 1698). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61217072a5edf170cf64ea1564e300d50a94094d4dfd033e65a0208a9415f9e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.routeForIssue (cyclomatic 19): standalone.routeForIssue has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6acdfcf554964d2fef7a2f236bfe9702d4e775ba6ff4e3d5dc7b5655daca3b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchesEverySameDriveSighting (cyclomatic 19): standalone.matchesEverySameDriveSighting 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 2 function literals inside it that branch (lines 6173, 6174). 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a9fe3f24883152187528d65b4a8e09093d0e3700064c153f71de8db7a82679"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchTender (cyclomatic 19): standalone.matchTender has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"7893e723f8b82f522f3253ca4b56d057ee54eb60d4e4b29f12c7f47356626d0e"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.persistSelectedBurst (cyclomatic 19): DriveForegroundService.persistSelectedBurst has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d72f19f36fbef7383bf7e32155a2bb5d8058829e455fffa413c146f4fa9fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveForegroundService.dispatchStatus (cyclomatic 19): DriveForegroundService.dispatchStatus has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9909c866d7fb5506adf70f3ae306ceaee7b8e9dd2d93b4c7ad5622500dda74"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveModePlugin.startDrive (cyclomatic 19): DriveModePlugin.startDrive has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d11889db38494f3c38e665a96205d7ec8c239e99c7dcc1222d4d8c1ff68e11"}},{"ruleId":"D1","level":"warning","message":{"text":"materialize_private_eval.validate_dataset (cyclomatic 19): materialize_private_eval.validate_dataset has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc06f06c41565d4d45b0aa29271a5c90639bfba3fb956ac211bc26ec612a85ca"}},{"ruleId":"D1","level":"warning","message":{"text":"parity.validate_runtime_verdict (cyclomatic 19): parity.validate_runtime_verdict has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/parity.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e0a4e1ecbf5bd2fd7e1716c64941f4bda770d22608c43ec77584435b28af7b"}},{"ruleId":"D1","level":"warning","message":{"text":"completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess (cyclomatic 19): completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69cf2318d566a609611d7d32386862ce3bfcebef160e2c53ab4ace96bbb2a76"}},{"ruleId":"D1","level":"warning","message":{"text":"retryCentralOutbox (cyclomatic 19): retryCentralOutbox has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 9227, 9229, 9259). 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbef7262f2ae430ffd484450e20b46974a21a511fc86db4ff7853a474ffa669"}},{"ruleId":"D1","level":"warning","message":{"text":"completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess (cyclomatic 19): completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9246363dbc27da0033792c63a0df4568db8c8038a557db02d214071614ccdbe"}},{"ruleId":"D1","level":"warning","message":{"text":"retryCentralOutbox (cyclomatic 19): retryCentralOutbox has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 9227, 9229, 9259). 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5446af2b11b6cac3d30890a07ab3e7cffbb7fe5f3b78619f5ddab54e8300978"}},{"ruleId":"D1","level":"warning","message":{"text":"createAddressModel.readBack (cyclomatic 19): createAddressModel.readBack has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59821fb6078e1252fc4bd43825fb14eeedb8d8a4eebc8e754d03b0662ddf0cf"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.syncNativeRepairData (cyclomatic 18): index.html.syncNativeRepairData has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"56edb1476d122ef701b9613b9af066096067fa5d66de87f72f568e7cf3e81577"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveLocation (cyclomatic 18): index.html.startDriveLocation has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"98619122991f2f1d81151548008ae115532addcc0be5fa0dc39474775dc37c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadInstallationIdentity (cyclomatic 18): standalone.loadInstallationIdentity has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"1073d5ff35f9e3348ee5316d12e9ec53aa877d144d82e343fd04e2909ee0eb95"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.planUnreportedReminder (cyclomatic 18): standalone.planUnreportedReminder has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d5392c979fbc38308d72b58fb01d4e92109e35be9ca73f4c862bf85ad3440b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cyclomatic 18): standalone.detectionEnhancementPlan has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d45d753ae0487cbf73700e89ab4fc592fe928eff6d2625b7eb96acc580ca64"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadNotice (cyclomatic 18): standalone.matchRoadNotice has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd387d9349b8a2847617119aed2bd26ee0a28c7847bbd4895ef1b341ea729d4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.syncNativeRepairData (cyclomatic 18): index.html.syncNativeRepairData has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b632ae21cd6ab6bbed2692f1cec48de3e00c659718ae346ba5b5a91d98626c3d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveLocation (cyclomatic 18): index.html.startDriveLocation has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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":"android-app/www/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"626d89ecc03016c67338e2dece918f3ef88c26d8d61d18d024254d0c2a8440d7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.planUnreportedReminder (cyclomatic 18): standalone.planUnreportedReminder has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eea9841f24db402c46b77f1ffdbb1c1d34591e15174baac09c0ed91a33098a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cyclomatic 18): standalone.detectionEnhancementPlan has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b787b2a462f933460419a10279b38b05b40740a0b67c0158bbaae9e83b0da8d2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadNotice (cyclomatic 18): standalone.matchRoadNotice has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"277d66a3c6b5feebf4a08d678ad52f16d926138b7ed5380b4a66348b9cdb454d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.syncNativeRepairData (cyclomatic 18): index.html.syncNativeRepairData 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":"docs/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc99a2a8532f4d2369b81feee3e882ff1c84e3b570560a79c8951c29800755c4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveLocation (cyclomatic 18): index.html.startDriveLocation has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1700ce9678dccf3528b529f14f080524ef7bb5d88e7d5903dd142434343ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadInstallationIdentity (cyclomatic 18): standalone.loadInstallationIdentity has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c504bca007fab9cf70ac88fbc99c89d1805580c9a7f7cb1458fa36304e8c0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.planUnreportedReminder (cyclomatic 18): standalone.planUnreportedReminder has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe19ac505d792672b5cb12f4fc6379882cc023299d4e977e11e74d7b1741e0e5"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cyclomatic 18): standalone.detectionEnhancementPlan has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"136841d0749aed46884662c9fd2d10a34c766c153cb74df33d7721519ceac7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadNotice (cyclomatic 18): standalone.matchRoadNotice has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4c747548dab525124cfed9e7e7121c1e6966353d38b790cb7871981e477e05"}},{"ruleId":"D1","level":"warning","message":{"text":"core.validateVerdict (cyclomatic 18): core.validateVerdict has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"645fc70cb0ab457daf91461dfa0324752d594731c523c42fb8efe291c191e3ed"}},{"ruleId":"D1","level":"warning","message":{"text":"rules.judgeIndiaWardCanary (cyclomatic 18): rules.judgeIndiaWardCanary has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a78257364d472444a823620b1407ebe704397252462b8319b4b7e1b754e9815"}},{"ruleId":"D1","level":"warning","message":{"text":"build-karnataka-geometry.ownershipBundle (cyclomatic 18): build-karnataka-geometry.ownershipBundle has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e348468bb1c0666661b3811642da1a795063a87647ed472464869ea91e50f3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.captureProvenance (cyclomatic 18): index.captureProvenance has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fdcea8e1abce4bac1d2ec02d75133b662cbd957516a08a2b0d0148fa5f55a9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.validateDetectionVerdict (cyclomatic 18): index.validateDetectionVerdict has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2f8163efe4b8e859418f8e418c8f505026aad54b1afb3091a5535f004f8373"}},{"ruleId":"D1","level":"warning","message":{"text":"index.prepareSharedDetection (cyclomatic 18): index.prepareSharedDetection has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"602416040ef6613064a875d2ffe7ae63ec79c74daec517e65fa78146686f7bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.syncNativeRepairData (cyclomatic 18): index.html.syncNativeRepairData 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":"static/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d75f91986a36bd63d17a6517b1516878645cbd66f1dd8bd8185ac78f2852ba"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveLocation (cyclomatic 18): index.html.startDriveLocation has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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":"static/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d01e1b217037e69b57fe1a933d12391951b0de9eca54ec119df25eaf2b602d"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.planUnreportedReminder (cyclomatic 18): standalone.planUnreportedReminder has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7b1fc55b89fd1eb8dafe14312ff58318b27374ad9771cfadfa3a144ba26656"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cyclomatic 18): standalone.detectionEnhancementPlan has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc2327b5fc3f8e2fa7e01fa9e4626074ae4dcac4faebbfdc9a9ee748152a1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.matchRoadNotice (cyclomatic 18): standalone.matchRoadNotice has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ee03199c68a960daa69226e23e044d3946c7747dff71b5abbd4a9fd44483f8"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDuplicateReportOwnership.merge (cyclomatic 18): NativeDuplicateReportOwnership.merge has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"105e19dc742300a3e9e1ef64616520ee5f98f1b9529d7cdb59893dfd3745eee6"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDriveLocationProvider.replaceRegistration (cyclomatic 18): NativeDriveLocationProvider.replaceRegistration has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveLocationProvider.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ab8aa94a1363ed39ce44897419891620241b4f24a4b79ee35549275b1cac44"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate.markdown (cyclomatic 18): evaluate.markdown has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/evaluate.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c29e34aa18e611971d380f3a48bd1f1a088b17e266e8cc49e793b78eeb3415"}},{"ruleId":"D1","level":"warning","message":{"text":"parity.run_production_onnx (cyclomatic 18): parity.run_production_onnx 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":"ml/yolo/parity.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c76d42f47194a3021abde0a6c5b9b525f74724afa8b403b48e70cef157278b"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_dataset.build_dataset (cyclomatic 18): prepare_dataset.build_dataset 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":"ml/yolo/prepare_dataset.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cff797323e822f2f9da97d0fdc6e4422496c54dc9f1b27c2852935d40937bd"}},{"ruleId":"D1","level":"warning","message":{"text":"createCachedGeolocator.resolve (cyclomatic 18): createCachedGeolocator.resolve 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":"infra/aws-central/service/geo-cache.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f279b7a818387ef973ebddd2be22c1185bca4007434ce419b38e21bf920c8fa"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshotWards (cyclomatic 18): snapshotWards 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 3 function literals inside it that branch (lines 200, 223, 207). 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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cc4c534e573e0c0b8e7b7073e552e15538bb9ff041ba454a4e29939be5574b"}},{"ruleId":"D1","level":"warning","message":{"text":"returnedPairs (cyclomatic 18): returnedPairs has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 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":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b42bf0e3d68ce1ceb3b632a72bbacb5e36e61137b67b3b2d9dd3570ca77586"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedTitle (cyclomatic 17): index.html.unroutedTitle has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"593bb1c811d67476f5b51a1c0b20655f7a072da7c97daa8333d65160861d892e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted::onPosition (cyclomatic 17): index.html.startDriveAdmitted::onPosition 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. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5448}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbcaebbfe9e53dd6c4ca86e487927382db6e5c5f685fafe4616e0460b35e744"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022feedbackSend\u0022).onclick (cyclomatic 17): index.html.$(\u0022feedbackSend\u0022).onclick has cyclomatic complexity 17 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c1cd531df454c9ef6d1b6f203d080033d741b566067d31275476e8493237fc"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.compatibleDraftRoute (cyclomatic 17): standalone.compatibleDraftRoute 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"1597475134da3f8ae55fdff4619eecce6ee34507d7a15c69d205ffdfc94fd158"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedTitle (cyclomatic 17): index.html.unroutedTitle has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53c8739ec4bb3a608ba711b5a9b85056bb79ae383bb99eb43903b7fc84546e7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted::onPosition (cyclomatic 17): index.html.startDriveAdmitted::onPosition 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. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted) 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":"android-app/www/index.html"},"region":{"startLine":5448}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7edc864f54db3b98d30a19f540e8fc370d981aa6ee4d2270afb7cbabcd6da2a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022feedbackSend\u0022).onclick (cyclomatic 17): index.html.$(\u0022feedbackSend\u0022).onclick has cyclomatic complexity 17 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03be71e913a94153a747b8c668635ea45f3c16eec301643e16cc4cd20940207"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.compatibleDraftRoute (cyclomatic 17): standalone.compatibleDraftRoute 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51a6ab9a143ae4ef9ea1f8e756543e59282db821bddfd4f5362daa456290731"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedTitle (cyclomatic 17): index.html.unroutedTitle has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fba946f293dadcd78e63ebade011f76c21d55ba1dee9e4058cba5bbd55f0d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted::onPosition (cyclomatic 17): index.html.startDriveAdmitted::onPosition 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. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted) 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":"docs/index.html"},"region":{"startLine":5448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0150963bb5f787ab07ec0520434a6dce2e5f86c3314af6734a2a8c83b2a6d53f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022feedbackSend\u0022).onclick (cyclomatic 17): index.html.$(\u0022feedbackSend\u0022).onclick has cyclomatic complexity 17 (threshold 15). 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: 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":"docs/index.html"},"region":{"startLine":9507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35a8378c5c344b835b60bbacbf6213275654a2e7afbc76067e7a7d441c3d92b"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.compatibleDraftRoute (cyclomatic 17): standalone.compatibleDraftRoute 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"9649922527109aa640bd4b8a541f28576fb66f1efc58b50b8374dff794fc7c13"}},{"ruleId":"D1","level":"warning","message":{"text":"core.createService::authenticate (cyclomatic 17): core.createService::authenticate has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 3 other methods here (core.createService::feedback, core.createService::beyondKarnataka, core.createService::dispatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a22611ff656a62f50993b0a16b31e6cb74677bcf8ef13e88103407315f89f8b"}},{"ruleId":"D1","level":"warning","message":{"text":"india-wards.createIndiaWards.locate (cyclomatic 17): india-wards.createIndiaWards.locate has cyclomatic complexity 17 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/india-wards.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf60e6f0e372c641a0c36fb53ce443ee00938d7d84df5d54449a22412376693"}},{"ruleId":"D1","level":"warning","message":{"text":"local-address.measure (cyclomatic 17): local-address.measure 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9e805d9856e2f7938d13626082a684cb2dfe7809e33409990cb84a8dfb02ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Area.constructor (cyclomatic 17): Area.constructor has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8074e05eb3f8ecaa05563860675865e916fad7476e2813d13e96a363c5c2782"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.streetFromFeature (cyclomatic 17): build-street-index.streetFromFeature 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6e96a192d184284d850a4619d6cdc06a29e14f5e47f92041a3ea500fc7c8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.callHttpYolo (cyclomatic 17): index.callHttpYolo has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2d6132cc4ed5076bc3065a76c0c766b6433d7655b4160f921f128ec17a482"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.unroutedTitle (cyclomatic 17): index.html.unroutedTitle has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0b8bb7f9b556196013fc62263424583912ee2843e0dbd4564f83d472225b99"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.startDriveAdmitted::onPosition (cyclomatic 17): index.html.startDriveAdmitted::onPosition 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. This shape REPEATS in the file: one other method here (index.html.startDriveAdmitted) 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":"static/index.html"},"region":{"startLine":5448}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba25ef95cbbda27c7a823d9bed9ac0e4c51c34ffa22cd9291d2fe4cd9a02210"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022feedbackSend\u0022).onclick (cyclomatic 17): index.html.$(\u0022feedbackSend\u0022).onclick has cyclomatic complexity 17 (threshold 15). 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: 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":"static/index.html"},"region":{"startLine":9507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d44c08bb709dc4447fa4c89896d6aa7a44fd86dbab056974bcfeda27e59fda"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.compatibleDraftRoute (cyclomatic 17): standalone.compatibleDraftRoute 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"be50a3a43bdecac3993be8123c6244c4db90ce0656bdc4cf84e644373a4833a8"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameQualityEvaluator.bitmapToBoundedJpegBytes (cyclomatic 17): FrameQualityEvaluator.bitmapToBoundedJpegBytes has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/FrameQualityEvaluator.kt"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1415fd6d837755c311672299a1354a6cd1248ad83e3eb42d9f1a4b17393c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"exhaustive_video_eval.require_private_artifact_root (cyclomatic 17): exhaustive_video_eval.require_private_artifact_root has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9059323fee316ca862b67d2fa537fd79ac7a3ee8f7911672a11fc0a1e29d17c4"}},{"ruleId":"D1","level":"warning","message":{"text":"finetune.main (cyclomatic 17): finetune.main 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":"ml/classifier/finetune.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b468ce0134a7d2816165308817279a5758a86ff5d09341ddbdba3ce76ee01c"}},{"ruleId":"D1","level":"warning","message":{"text":"release.verify_prediction_split_coverage (cyclomatic 17): release.verify_prediction_split_coverage 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":"ml/yolo/release.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"870c32550902642fe26139132e66e198b3c2761425fd4ce584f1301663961c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"274d1882989ae682339df2c3c4490ecf76e82851331ce3f8d7b7fe0196026856"}},{"ruleId":"D1","level":"warning","message":{"text":"openIdb (cyclomatic 17): openIdb 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 7 function items inside it that branch ((anonymous)::onupgradeneeded, (anonymous)::onupgradeneeded::onsuccess, a function literal at line 8199, \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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":8198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f599e67966071ce8c89ee43f0c12822c4d5ee66e9872970f845c752df7a24fea"}},{"ruleId":"D1","level":"warning","message":{"text":"resumePendingDetections (cyclomatic 17): resumePendingDetections has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 9556, 9557, 9565, \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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9554}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c92165ae2b6e452cddfd8cd9b859a07f9918a3670eff0a3bfa402837cd1f6e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"638b5422c55ec4b5fe5b3f5571aff58a590100b953b449e3946c45da452758e7"}},{"ruleId":"D1","level":"warning","message":{"text":"openIdb (cyclomatic 17): openIdb 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 7 function items inside it that branch ((anonymous)::onupgradeneeded, (anonymous)::onupgradeneeded::onsuccess, a function literal at line 8199, \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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce02a270a67d1e0862495c571e944f7887e36d9bcdaefc6c8e17916632be8747"}},{"ruleId":"D1","level":"warning","message":{"text":"resumePendingDetections (cyclomatic 17): resumePendingDetections has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 9556, 9557, 9565, \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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9554}}}],"partialFingerprints":{"codehealthFindingId/v1":"757dbf75bc46e6f07970098e6532945201c0694c4846c4c75693cb2e02ed3737"}},{"ruleId":"D1","level":"warning","message":{"text":"partsFromGeocoder (cyclomatic 17): partsFromGeocoder has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d9c9ae303e416ba7b6232b3c17d0ae5629348de1b94b17c5ae301cdc4ec21a"}},{"ruleId":"D1","level":"warning","message":{"text":"createIndiaWards.locate (cyclomatic 17): createIndiaWards.locate has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/india-wards.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb4f3ec4d261c2540296e62613f0c9a9310542f0a778ba1a8b9d2ae85776e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 17): main has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/seed-tenders.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f81abdcd827225c86002390a765e3a8d4766ff29e45ca8249159ee3a6ae552e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.watchForFix (cyclomatic 16): index.html.watchForFix has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 4 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ae0a69dddbf0699b5894eccfd8c56f324f840dced1f2fd03cc2a4e27010cad"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cameraShotFile (cyclomatic 16): index.html.cameraShotFile has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bbf196d688d8e2d3f2cdad6e4a4970b3ee8bc86e6032a28f3aa7a81005d79d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.listenForRestoredCameraPhoto (cyclomatic 16): index.html.listenForRestoredCameraPhoto has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3167). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"74753792657aa02dcaf689886be53e41f43ea9e589cbdaaa69b9341749bb8c62"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022wipeBtn\u0022).onclick (cyclomatic 16): index.html.$(\u0022wipeBtn\u0022).onclick has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9738}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae6597b2d28f4677682bbfcfd289abf5842e44cec593e2cb2932d4e1e1609c8"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.drainSSE (cyclomatic 16): standalone.drainSSE has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7b1aa1a8a6c6a36d95ecdfe57458734a2eb85dfd2a5fc8af904f8efbd0b52e"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cyclomatic 16): standalone.loadHighwayContractPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fcd0a00e869c03d390ddfcb215a2ee54872299ccab0df6a4d6eecee3126206"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cyclomatic 16): standalone.loadRoadNoticePack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaed9d07ef69f932b967c097c1d809e563a64eed12a66e79a44711dff48a1a71"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cyclomatic 16): standalone.loadRoadAgreementPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f445dd4e4d4e2b943f6fd283ed351ea2c76ebe8c534310ad19e4e26ad1c933"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cyclomatic 16): standalone.kolkataRouteFromGeocode has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a9e69112ce58e644c8731cb68934b05192a4318e397bc380350c9a7c233823"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.getRepairTargetBatch (cyclomatic 16): standalone.getRepairTargetBatch has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11775}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af59dae7c4bcd6bae81ee0ea42d5b1321eb63607e6fa98404f96433d19646ac"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.watchForFix (cyclomatic 16): index.html.watchForFix has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 4 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":"android-app/www/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c92a846f2161402351826a640212858518d4fc87c27ffddcd1e7ffbc8ae8142"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cameraShotFile (cyclomatic 16): index.html.cameraShotFile has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f59efb82a620a51a5d5b3a56a696e8d9452cabb5716898f5feda6dcc8c5c7b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.listenForRestoredCameraPhoto (cyclomatic 16): index.html.listenForRestoredCameraPhoto has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3167). 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":"android-app/www/index.html"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc90ab2d136af517451ea121b5784b4a73c30015fa6b9aa33266e92ccb2677"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022wipeBtn\u0022).onclick (cyclomatic 16): index.html.$(\u0022wipeBtn\u0022).onclick has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9738}}}],"partialFingerprints":{"codehealthFindingId/v1":"432e5b5e4b6ee908c62c1ba84b165cf1b0e77429ff8d5b664be2ae5b43da01a7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.drainSSE (cyclomatic 16): standalone.drainSSE has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f53dab830b40fef7a80c6bdcaf79066d86aa173b61d35d0aead7605ba054f0"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cyclomatic 16): standalone.loadHighwayContractPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2577aa58f22e27d69736bc07951337b0b1b2c245a7d9fcb385a9f72fa3af7931"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cyclomatic 16): standalone.loadRoadNoticePack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed99e8d666308e1f7297403ee221004ecce02bd50d4c77fcd85a598d3b6c73c9"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cyclomatic 16): standalone.loadRoadAgreementPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fde6b0f5c8c2bb5e7de94929d1a7c99f04048c34f01997302dde752ba22392"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cyclomatic 16): standalone.kolkataRouteFromGeocode has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a2a617160936b98c03ee6c33e4c2209ae64a62bbfe9db71f9abf305f2ba287"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.getRepairTargetBatch (cyclomatic 16): standalone.getRepairTargetBatch has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11775}}}],"partialFingerprints":{"codehealthFindingId/v1":"721cf88cc6321aaafde2b75b8945044c7ed4f426090d4324152d06ffdaf986d4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.watchForFix (cyclomatic 16): index.html.watchForFix has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 4 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":"docs/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"884a844fa9dea46dcc1c9e46e21301c140bcb0860f9dc085e1710b0dec79b865"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cameraShotFile (cyclomatic 16): index.html.cameraShotFile has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"694dc165fd4fa38b11bf617df577f385c0e9c3a8177a772d438f15abef57ffdd"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.listenForRestoredCameraPhoto (cyclomatic 16): index.html.listenForRestoredCameraPhoto has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3167). 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":"docs/index.html"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3c21bd4b0b2370fa7709eb9d42385d1037c5160455dc3b872670438b4aa172"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022wipeBtn\u0022).onclick (cyclomatic 16): index.html.$(\u0022wipeBtn\u0022).onclick has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9738}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0672b417d41c904f3c5d6abcce83ebf9811f49e0f761f468a6ad92019afec3"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.drainSSE (cyclomatic 16): standalone.drainSSE has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9ad3acc8278b80dd7f34a71456e938cde14876c75664b6374528f053e81024"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cyclomatic 16): standalone.loadHighwayContractPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a58d1471c6f47429558c5aa5cd4b74e414ec5233dfb9f6bd1f69f69e05ba219"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cyclomatic 16): standalone.loadRoadNoticePack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5abda729ee40ba3db0ab89a9eab638dd15dc9701f22d9caa708f66e200ae74a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cyclomatic 16): standalone.loadRoadAgreementPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a986f6cd75bff39f7ceb7a4838cb8d369de22074d8be794174fdef7fca93d9"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cyclomatic 16): standalone.kolkataRouteFromGeocode has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79be6b470598605fd6922536503f6249f7ece878d3dc30e956afcdd63e13f03"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.getRepairTargetBatch (cyclomatic 16): standalone.getRepairTargetBatch has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11775}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eef7ea8e322489c22b8abfc1ca7bd85d68c4220ac6e80284d27d093ab9feb93"}},{"ruleId":"D1","level":"warning","message":{"text":"core.createService::feedback (cyclomatic 16): core.createService::feedback has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: 3 other methods here (core.createService::authenticate, core.createService::beyondKarnataka, core.createService::dispatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1d646e50830c9427bb50d1cf2324dfab1fb50f660c9f6606c1d74f48691b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"core.createService::beyondKarnataka (cyclomatic 16): core.createService::beyondKarnataka has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: 3 other methods here (core.createService::authenticate, core.createService::feedback, core.createService::dispatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d08a5f2aa75e1ef5fd3ff4276ab72cfd7323d4888218e1f38bcbdcd2a1e8b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"geo-cache.createCachedGeolocator.resolve (cyclomatic 16): geo-cache.createCachedGeolocator.resolve 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":"infra/aws-central/service/geo-cache.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3105e3eeb2f5c52a9808ec0a13e129455c77ea0e57efcb89108b59e6c6a2f5f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ownership-bundle-writer.createOwnershipWriter.finish (cyclomatic 16): ownership-bundle-writer.createOwnershipWriter.finish has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcd4fe8a3c9dc583421f71e4e7db24c10149d5d63bf5c9eeba4a8377c56648c"}},{"ruleId":"D1","level":"warning","message":{"text":"build-street-index.createAddressModel.nearestPostcode (cyclomatic 16): build-street-index.createAddressModel.nearestPostcode 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"9069dfc91f57bab4bd3bca5b37169d5c88658ed3ef07ad0cd93905d51e706cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-local-address.tenders::outcome (cyclomatic 16): verify-local-address.tenders::outcome has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (verify-local-address.tenders) 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528123ca629c11e53afb6dadcb14df5d771f08379f93776d04c7cecdfc5e4c3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.watchForFix (cyclomatic 16): index.html.watchForFix has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 4 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":"static/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"3229f2c2c629640ca40f3e755eb15b62f561e9f5157ba0be55e9847d263cff07"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.cameraShotFile (cyclomatic 16): index.html.cameraShotFile has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b714c457e4d5bc48538be33d4fd8dd92add164220fb06eaeb5df5d1551bcff7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.listenForRestoredCameraPhoto (cyclomatic 16): index.html.listenForRestoredCameraPhoto has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3167). 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":"static/index.html"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"304a50661c7ff8d025022fbc85805535ed96bd51aeafd9de25ffa1274d8733d7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022wipeBtn\u0022).onclick (cyclomatic 16): index.html.$(\u0022wipeBtn\u0022).onclick has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9738}}}],"partialFingerprints":{"codehealthFindingId/v1":"810d4ecd0c5c2e5ef54e8020a19ffd8895aa5a97a577747b43cadfb999e0d4d7"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.drainSSE (cyclomatic 16): standalone.drainSSE has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"25856772622f87687c4f9553f72e5b775f818908a50d81581748040f1d53dffe"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cyclomatic 16): standalone.loadHighwayContractPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4748d1b7fa697e88a950a68bc4dc72201365ed947b16f8993bebf8cda87c10a"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cyclomatic 16): standalone.loadRoadNoticePack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3955256e1828615d6cfec5726c78573ca18d1cd947b19ce47b3a98bafb551075"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cyclomatic 16): standalone.loadRoadAgreementPack has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"491bd8b4d813d2a7b7fafe0ce0b544feb0e5c03c28403a211dc76830bf15a3c2"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cyclomatic 16): standalone.kolkataRouteFromGeocode has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c668c6b6881eaad586ee93bde7684d6bf1d4c71e1e71eaddd731224e45a5f76"}},{"ruleId":"D1","level":"warning","message":{"text":"standalone.getRepairTargetBatch (cyclomatic 16): standalone.getRepairTargetBatch has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: standalone.validatePinnedStatewidePayload (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11775}}}],"partialFingerprints":{"codehealthFindingId/v1":"be608119b61bba47f11f650dc1ea33eeecb27952a4140644772e1aea3d051ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoImportPlugin.extractFrame (cyclomatic 16): VideoImportPlugin.extractFrame has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportPlugin.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb7917e78e8a193429f7c91350d3b4b4181b2157a8cc8622e9901ef7b6a9dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoImportStore.import (cyclomatic 16): VideoImportStore.import has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportStore.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f5d4a0131024815c40dbd2bf78b7e024d9cca778275a00e16b3be70347ffbe"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeReportEvidenceStorage.saveJpegAtomically (cyclomatic 16): NativeReportEvidenceStorage.saveJpegAtomically has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeReportEvidenceStorage.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1425dead112e9420e43d66f2891412acb305ab305d42ac42ad023a3d2740a425"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveModePlugin.monitorPendingStart (cyclomatic 16): DriveModePlugin.monitorPendingStart has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"815043c1ad2f45e754f1615dccad6480cc3ff7e853435bc6ef756ff41cb46258"}},{"ruleId":"D1","level":"warning","message":{"text":"DriveModePlugin.deleteFootage (cyclomatic 16): DriveModePlugin.deleteFootage has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"362922bad0d15f94ff49589c5fbf6a2d53296eadac36d16297cbd11f7075998a"}},{"ruleId":"D1","level":"warning","message":{"text":"private_drive_corpus.validate_phase (cyclomatic 16): private_drive_corpus.validate_phase 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":"eval/private_drive_corpus.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcd7cf8b952c2bbf34f3278dc18dad3f32d983b42628661052c1b22e7da2c1e"}},{"ruleId":"D1","level":"warning","message":{"text":"run_rad_eval._validate_args (cyclomatic 16): run_rad_eval._validate_args has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_rad_eval.py"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ce1accc8f1e321f97db7d1403fded11fb63503035eff5a408a58ab5fb378f"}},{"ruleId":"D1","level":"warning","message":{"text":"YoloOnnxDetector._postprocess (cyclomatic 16): YoloOnnxDetector._postprocess 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":"infra/aws-yolo/service/detector.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a8bc6260e60d19d84b54e86e202efe35300e1c11d6aa611a2f555d2f20910"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate._load_predictions (cyclomatic 16): evaluate._load_predictions has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/evaluate.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f8a9e05cb39df65ea2c35914c2aa07bedfb5d3b905d9f98506aeac73f799f8"}},{"ruleId":"D1","level":"warning","message":{"text":"delhiCoverage (cyclomatic 16): delhiCoverage has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 4394). 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d336750b5cedc8bba1f83f5cf2a7e3104e416828fedd1f9f787dafeec6a2c0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"delhiCoverage (cyclomatic 16): delhiCoverage has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 4394). 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. This is NOT this file\u0027s highest cyclomatic complexity: migrateLegacyAndhraPradeshHandoff (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4391}}}],"partialFingerprints":{"codehealthFindingId/v1":"141753cdac31c973a638b19fc43c58dfa4548b52d875eb4c733981838bf84a37"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot (cyclomatic 16): snapshot 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 3 function literals inside it that branch (lines 155, 177, 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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e5cbdd451f9b107ba48b854bfefce04705c264003f6a602a386808bb94deb"}},{"ruleId":"D1","level":"warning","message":{"text":"createAddressModel.nearestPostcode (cyclomatic 16): createAddressModel.nearestPostcode 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c63f9e45ae972cc8f1b226b2cd982f7a12d1b030913b1a284d00341e1ab5a40"}},{"ruleId":"D1","level":"warning","message":{"text":"createOwnershipWriter.finish (cyclomatic 16): createOwnershipWriter.finish has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f2027d7d240ad383d8793fee9129e147746d9b6fe398b8b311e111d842b27c"}},{"ruleId":"D2","level":"warning","message":{"text":"createReport (cognitive 348): createReport has cognitive complexity 348 (threshold 15). Drivers by points: ternaries 138 (157 pts), boolean chains 106, if/else 39 (61 pts), error handling 11 (24 pts) (nesting depth added 54). Of this number, 337 points are the body\u0027s own statements and 11 belong to 11 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3756727b74b4dc2715f3cb34d88d0b81ecddfed0228230ab07d1a8ca3abe354b"}},{"ruleId":"D2","level":"warning","message":{"text":"createReport (cognitive 348): createReport has cognitive complexity 348 (threshold 15). Drivers by points: ternaries 138 (157 pts), boolean chains 106, if/else 39 (61 pts), error handling 11 (24 pts) (nesting depth added 54). Of this number, 337 points are the body\u0027s own statements and 11 belong to 11 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a783d9f50f713bbeeda21ab93da07286385543b0d855b09f729846b76fe2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.createReport (cognitive 319): standalone.createReport has cognitive complexity 319 (threshold 15). Drivers by points: ternaries 122 (146 pts), boolean chains 106, if/else 39 (61 pts), error handling 4 (6 pts) (nesting depth added 48). Of this number, 313 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dba2f57dda0deac7c8620ef29ce297f245d19befd07e8b0ec55d593fea4740f"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.createReport (cognitive 319): standalone.createReport has cognitive complexity 319 (threshold 15). Drivers by points: ternaries 122 (146 pts), boolean chains 106, if/else 39 (61 pts), error handling 4 (6 pts) (nesting depth added 48). Of this number, 313 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"331d1106a940f0f7c0d0c32ed32ed8e75869e2ba6b79a35be3d94f82341b25e3"}},{"ruleId":"D2","level":"warning","message":{"text":"handle (cognitive 242): handle has cognitive complexity 242 (threshold 15). Drivers by points: if/else 70 (110 pts), boolean chains 85, ternaries 19 (38 pts), error handling 4 (9 pts) (nesting depth added 64). Of this number, 207 points are the body\u0027s own statements and 35 belong to 15 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":"static/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d0a735e301d912e30583d696f8eb8c5967018dda182e9789ee029ebbc0d7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"handle (cognitive 242): handle has cognitive complexity 242 (threshold 15). Drivers by points: if/else 70 (110 pts), boolean chains 85, ternaries 19 (38 pts), error handling 4 (9 pts) (nesting depth added 64). Of this number, 207 points are the body\u0027s own statements and 35 belong to 15 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":"android-app/www/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abd1d5a22488fefc8c8c8ea9a3ecbb1c63b4301075536ec6e739fbaa221d31c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.handle (cognitive 238): standalone.handle has cognitive complexity 238 (threshold 15). Drivers by points: if/else 69 (107 pts), boolean chains 86, ternaries 18 (36 pts), error handling 4 (9 pts) (nesting depth added 61). Of this number, 207 points are the body\u0027s own statements and 31 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f58975b33013e90ed3a14a5d59a2b885c9d082b70121c57f7d430fd2e6cbfbd"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.handle (cognitive 238): standalone.handle has cognitive complexity 238 (threshold 15). Drivers by points: if/else 69 (107 pts), boolean chains 86, ternaries 18 (36 pts), error handling 4 (9 pts) (nesting depth added 61). Of this number, 207 points are the body\u0027s own statements and 31 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":"docs/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"022d1dfde3103d8988638aabffb2fe214ac23a248b9b15a95e19e68518240811"}},{"ruleId":"D2","level":"warning","message":{"text":"importNativeReport (cognitive 208): importNativeReport has cognitive complexity 208 (threshold 15). Drivers by points: ternaries 116, boolean chains 85, if/else 5, error handling 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96902b4152ea2d4e542c0b6dc231a6840e4f553a3c31e1d8b24c2ab4ecc40ff"}},{"ruleId":"D2","level":"warning","message":{"text":"importNativeReport (cognitive 208): importNativeReport has cognitive complexity 208 (threshold 15). Drivers by points: ternaries 116, boolean chains 85, if/else 5, error handling 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"961858b5a896c7b142cc32e08d9d04a9553e06099b077313b72f09be098544a3"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.importNativeReport (cognitive 201): standalone.importNativeReport has cognitive complexity 201 (threshold 15). Drivers by points: ternaries 116 (118 pts), boolean chains 78, if/else 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc641e8634da190d4179bbab559bd16ecb1b62c5180c486cef9715449e66fd13"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.importNativeReport (cognitive 201): standalone.importNativeReport has cognitive complexity 201 (threshold 15). Drivers by points: ternaries 116 (118 pts), boolean chains 78, if/else 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3e17cdf87f99a3f06633ee0ee33c5368f89255fd4277588b8bae90403c313f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.analyseFootage (cognitive 196): index.html.analyseFootage has cognitive complexity 196 (threshold 15). Drivers by points: if/else 45 (81 pts), boolean chains 57, ternaries 14 (26 pts), loops 11 (17 pts), error handling 9 (15 pts) (nesting depth added 60). Of this number, 98 points are the body\u0027s own statements and 98 belong to 18 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b83791c0daa779b9a3d0ec6d908e0ea74400d9d65cce0a3ac3f64e3d765cfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.analyseFootage (cognitive 196): index.html.analyseFootage has cognitive complexity 196 (threshold 15). Drivers by points: if/else 45 (81 pts), boolean chains 57, ternaries 14 (26 pts), loops 11 (17 pts), error handling 9 (15 pts) (nesting depth added 60). Of this number, 98 points are the body\u0027s own statements and 98 belong to 18 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":"android-app/www/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcacb99fd39d64abfb3e93f4b67f89d73c976ab8bc7f67a19ce3e6fd6de602a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.analyseFootage (cognitive 196): index.html.analyseFootage has cognitive complexity 196 (threshold 15). Drivers by points: if/else 45 (81 pts), boolean chains 57, ternaries 14 (26 pts), loops 11 (17 pts), error handling 9 (15 pts) (nesting depth added 60). Of this number, 98 points are the body\u0027s own statements and 98 belong to 18 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":"docs/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d951d9fb1ea013697eecb3425f12be454a3a1ecab513a1d297c2997955df49a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.analyseFootage (cognitive 196): index.html.analyseFootage has cognitive complexity 196 (threshold 15). Drivers by points: if/else 45 (81 pts), boolean chains 57, ternaries 14 (26 pts), loops 11 (17 pts), error handling 9 (15 pts) (nesting depth added 60). Of this number, 98 points are the body\u0027s own statements and 98 belong to 18 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":"static/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"084af2192d658974b0fa9f1c991083ff1c1bfaaa7d9093064b98f2eb9fcd849b"}},{"ruleId":"D2","level":"warning","message":{"text":"routeOfficer (cognitive 174): routeOfficer has cognitive complexity 174 (threshold 15). Drivers by points: if/else 80 (131 pts), boolean chains 30, ternaries 8 (10 pts), loops 2, error handling 1 (nesting depth added 53). Of this number, 167 points are the body\u0027s own statements and 7 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":"static/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8b04cdc9eb62ff197e0ab7ea59f820ca29626ba36d02119112c11158cca125"}},{"ruleId":"D2","level":"warning","message":{"text":"routeOfficer (cognitive 174): routeOfficer has cognitive complexity 174 (threshold 15). Drivers by points: if/else 80 (131 pts), boolean chains 30, ternaries 8 (10 pts), loops 2, error handling 1 (nesting depth added 53). Of this number, 167 points are the body\u0027s own statements and 7 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":"android-app/www/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac747e8be486ff3870af13b27f4adcf0b7007bd85ab48dd9c2f9d939eaf76a5"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.routeOfficer (cognitive 172): standalone.routeOfficer has cognitive complexity 172 (threshold 15). Drivers by points: if/else 80 (131 pts), boolean chains 31, ternaries 6 (7 pts), loops 2, error handling 1 (nesting depth added 52). Of this number, 165 points are the body\u0027s own statements and 7 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c265a1bebe84d26041ecc0f3e67cdf90c121574316dfd8a98ca2925b61cf916"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.routeOfficer (cognitive 172): standalone.routeOfficer has cognitive complexity 172 (threshold 15). Drivers by points: if/else 80 (131 pts), boolean chains 31, ternaries 6 (7 pts), loops 2, error handling 1 (nesting depth added 52). Of this number, 165 points are the body\u0027s own statements and 7 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":"docs/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8504e4caf9e42b41b7db5a7dd96cd2bb23c061f6e66145e1f90a0dda11e44d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"createAddressModel (cognitive 167): createAddressModel has cognitive complexity 167 (threshold 15). Drivers by points: if/else 36 (94 pts), boolean chains 37, loops 15 (27 pts), ternaries 4 (9 pts) (nesting depth added 75). Of this number, 158 points are the body\u0027s own statements and 9 belong to 9 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc71666d449322a8f018fe566518f4ac1661f673751f0fcdf93c9eb5c68f176a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cognitive 150): index.html.runNativeVideoAnalysis has cognitive complexity 150 (threshold 15). Drivers by points: if/else 40 (85 pts), boolean chains 30, ternaries 10 (16 pts), error handling 6 (15 pts), loops 3 (4 pts) (nesting depth added 61). Of this number, 144 points are the body\u0027s own statements and 6 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d275908e1a9f575d53b37c070425a3e1987d4038c688802e01d1450f7994cb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cognitive 150): index.html.runNativeVideoAnalysis has cognitive complexity 150 (threshold 15). Drivers by points: if/else 40 (85 pts), boolean chains 30, ternaries 10 (16 pts), error handling 6 (15 pts), loops 3 (4 pts) (nesting depth added 61). Of this number, 144 points are the body\u0027s own statements and 6 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":"android-app/www/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3064dc732eaaf6244bc5acf7c2a46b6d91ab11d5a7a6a9c3c0886f1e4da68d06"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cognitive 150): index.html.runNativeVideoAnalysis has cognitive complexity 150 (threshold 15). Drivers by points: if/else 40 (85 pts), boolean chains 30, ternaries 10 (16 pts), error handling 6 (15 pts), loops 3 (4 pts) (nesting depth added 61). Of this number, 144 points are the body\u0027s own statements and 6 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":"docs/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33d1a6a3d30e602b47bc34974ed90f52363186cfefc4f1b52f7ab7bfaadb76b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runNativeVideoAnalysis (cognitive 150): index.html.runNativeVideoAnalysis has cognitive complexity 150 (threshold 15). Drivers by points: if/else 40 (85 pts), boolean chains 30, ternaries 10 (16 pts), error handling 6 (15 pts), loops 3 (4 pts) (nesting depth added 61). Of this number, 144 points are the body\u0027s own statements and 6 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":"static/index.html"},"region":{"startLine":7949}}}],"partialFingerprints":{"codehealthFindingId/v1":"072ee6af154ce21ebf9bd5154625c90f079bcdc4662a19f71aa2ffca4774ee44"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 148): render has cognitive complexity 148 (threshold 15). Drivers by points: ternaries 29 (58 pts), boolean chains 47, if/else 13 (23 pts), loops 12 (18 pts), other 2 (nesting depth added 45). Of this number, 79 points are the body\u0027s own statements and 69 belong to 123 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca325fb065b2701d6ac65bb1fe72351f8b86d41c0a3f547cf25c2b69ee2a94fd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cognitive 144): index.html.runImportedVideoAnalysis has cognitive complexity 144 (threshold 15). Drivers by points: if/else 41 (83 pts), ternaries 13 (27 pts), boolean chains 21, error handling 4 (8 pts), loops 4 (5 pts) (nesting depth added 61). Of this number, 141 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5fb029d63dbfe54af4948be82f496ad5159467be2ab9ddc3f954dd7b626e88"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cognitive 144): index.html.runImportedVideoAnalysis has cognitive complexity 144 (threshold 15). Drivers by points: if/else 41 (83 pts), ternaries 13 (27 pts), boolean chains 21, error handling 4 (8 pts), loops 4 (5 pts) (nesting depth added 61). Of this number, 141 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a0ad0736b748c44b528f783f5865988e0880c0a4582bb1060438175cbced3b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cognitive 144): index.html.runImportedVideoAnalysis has cognitive complexity 144 (threshold 15). Drivers by points: if/else 41 (83 pts), ternaries 13 (27 pts), boolean chains 21, error handling 4 (8 pts), loops 4 (5 pts) (nesting depth added 61). Of this number, 141 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c6f9cd5f1cc5ab36d482f993cc84ad9cb5b6048d452897af9adb1ea252410d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.runImportedVideoAnalysis (cognitive 144): index.html.runImportedVideoAnalysis has cognitive complexity 144 (threshold 15). Drivers by points: if/else 41 (83 pts), ternaries 13 (27 pts), boolean chains 21, error handling 4 (8 pts), loops 4 (5 pts) (nesting depth added 61). Of this number, 141 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":7562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b6cadf6affdaff98a3dffff25ecdef9d30743a4b614af953d1f09feda2ddd6"}},{"ruleId":"D2","level":"warning","message":{"text":"prepareComplaint (cognitive 142): prepareComplaint has cognitive complexity 142 (threshold 15). Drivers by points: boolean chains 94, ternaries 15 (24 pts), if/else 12 (14 pts), error handling 4 (10 pts) (nesting depth added 17). 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":"static/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c1b8d6823f58c72413789b6d72a6444e5d50725ebd77b78da65fede96adbed"}},{"ruleId":"D2","level":"warning","message":{"text":"prepareComplaint (cognitive 142): prepareComplaint has cognitive complexity 142 (threshold 15). Drivers by points: boolean chains 94, ternaries 15 (24 pts), if/else 12 (14 pts), error handling 4 (10 pts) (nesting depth added 17). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a1a5243d1fbb9bbb51699b6c123ea8c8693bd3809c58fca05bc7db6503cf25"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval.validate_label_manifest (cognitive 137): exhaustive_video_eval.validate_label_manifest has cognitive complexity 137 (threshold 15). Drivers by points: if/else 38 (81 pts), boolean chains 34, loops 8 (13 pts), ternaries 3 (8 pts), error handling 1 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea23fdfa2f2410f9e0a254a753378380aa29f0e8e96bd6b9366c4840d8be365"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.buildRegion (cognitive 131): build-street-index.buildRegion has cognitive complexity 131 (threshold 15). Drivers by points: if/else 26 (73 pts), loops 22 (42 pts), boolean chains 14, ternaries 2 (nesting depth added 67). Of this number, 129 points are the body\u0027s own statements and 2 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bae80fe58df11fc8f8ba4d7b90f5ecd87bac4a32296bf9310508f4d6e20b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveModePlugin.reconcileNativeState (cognitive 129): DriveModePlugin.reconcileNativeState has cognitive complexity 129 (threshold 15). Drivers by points: if/else 58 (92 pts), boolean chains 28, loops 7 (8 pts), match/switch 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46503db340f5faed7c5771269a085c945e9e9c57a7608d850c94d17c62f79df"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.draftCivicComplaint (cognitive 126): standalone.draftCivicComplaint has cognitive complexity 126 (threshold 15). Drivers by points: ternaries 38 (108 pts), boolean chains 17, if/else 1 (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ded596bde43d70e6ad2a9d643c8f7c0cd229f3af65170e69f07a799b3be6964"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.draftCivicComplaint (cognitive 126): standalone.draftCivicComplaint has cognitive complexity 126 (threshold 15). Drivers by points: ternaries 38 (108 pts), boolean chains 17, if/else 1 (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eea559ffc9a7e1840212a1bcb1e67d9f17ba2a60013a81ee8df8dd6f5171c48"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.draftCivicComplaint (cognitive 126): standalone.draftCivicComplaint has cognitive complexity 126 (threshold 15). Drivers by points: ternaries 38 (108 pts), boolean chains 17, if/else 1 (nesting depth added 70). 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":"docs/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"74265426c8733f3bfaad260460c0626b1c8edc1713ecc000800d0a7d0918693b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.draftCivicComplaint (cognitive 126): standalone.draftCivicComplaint has cognitive complexity 126 (threshold 15). Drivers by points: ternaries 38 (108 pts), boolean chains 17, if/else 1 (nesting depth added 70). 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":"static/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc70842fc89f3f6c9f27b9810e82136d1a835a3ca21d9444ff9a2d6d21afca2"}},{"ruleId":"D2","level":"warning","message":{"text":"UploadWorker.doWork (cognitive 123): UploadWorker.doWork has cognitive complexity 123 (threshold 15). Drivers by points: if/else 50 (100 pts), error handling 5 (11 pts), boolean chains 10, loops 2 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"05001b0abc96b9bc0c58c6017d9b853d76f61ad5a9e009168a2d98271e53a896"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.prepareComplaint (cognitive 119): standalone.prepareComplaint has cognitive complexity 119 (threshold 15). Drivers by points: boolean chains 87, ternaries 11 (18 pts), if/else 12 (14 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c095f19a4994d529d43d0f7d9a8a4ac0e67b5cb66f98c3448a8725f1b6e260f"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.prepareComplaint (cognitive 119): standalone.prepareComplaint has cognitive complexity 119 (threshold 15). Drivers by points: boolean chains 87, ternaries 11 (18 pts), if/else 12 (14 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae901d21a2221a1e4cc8a7607946aae7639788fe5b4d4aa24a9c6ed84284963"}},{"ruleId":"D2","level":"warning","message":{"text":"private_drive_corpus._validate_manifest_for_receipt (cognitive 116): private_drive_corpus._validate_manifest_for_receipt has cognitive complexity 116 (threshold 15). Drivers by points: if/else 42 (77 pts), boolean chains 35, loops 3 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"50786bd141a1aaf26127cb2781db9ffd45fe394f16c6f9f7e89ac0982de11bce"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cognitive 113): standalone.currentOfficialRouteBinding has cognitive complexity 113 (threshold 15). Drivers by points: if/else 38 (54 pts), boolean chains 53, ternaries 3 (6 pts) (nesting depth added 19). Of this number, 111 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84198289abc455a07ef92b2c6452112805d3685aa442f92e01dc754e78f59d4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cognitive 113): standalone.currentOfficialRouteBinding has cognitive complexity 113 (threshold 15). Drivers by points: if/else 38 (54 pts), boolean chains 53, ternaries 3 (6 pts) (nesting depth added 19). Of this number, 111 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":"android-app/www/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3792736f9732eddda599ae03c40435c3947c42b260b2b17a7dba0851b21374a4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cognitive 113): standalone.currentOfficialRouteBinding has cognitive complexity 113 (threshold 15). Drivers by points: if/else 38 (54 pts), boolean chains 53, ternaries 3 (6 pts) (nesting depth added 19). Of this number, 111 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":"docs/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70bf40d814830d276e05907a4d9395fe30e88caf9ed3b68359369276aa8b9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.currentOfficialRouteBinding (cognitive 113): standalone.currentOfficialRouteBinding has cognitive complexity 113 (threshold 15). Drivers by points: if/else 38 (54 pts), boolean chains 53, ternaries 3 (6 pts) (nesting depth added 19). Of this number, 111 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":"static/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d68c85f7a98686b1c2110718b1c901615161b5cd1f03ab1af2e5d5e785e5d9"}},{"ruleId":"D2","level":"warning","message":{"text":"common.validate_prepared_dataset (cognitive 111): common.validate_prepared_dataset has cognitive complexity 111 (threshold 15). Drivers by points: if/else 43 (73 pts), boolean chains 17, loops 7 (10 pts), ternaries 3 (6 pts), error handling 3 (5 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/common.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36444f7e846a5fb8cbd1c598de807d7037045b076edd707a87f19167f50659c"}},{"ruleId":"D2","level":"warning","message":{"text":"titleNameKeys (cognitive 106): titleNameKeys has cognitive complexity 106 (threshold 15). Drivers by points: if/else 14 (56 pts), boolean chains 18, ternaries 4 (18 pts), loops 5 (14 pts) (nesting depth added 65). Of this number, 103 points are the body\u0027s own statements and 3 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d361791e5f2e0c7979ba664d2a6e0483a446dd329b2ef2f1979dfc5fda5b766e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.restoreNativeDrive (cognitive 105): index.html.restoreNativeDrive has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 39, ternaries 3 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d521f3a24e9295904d8e3f38d9182fbf71615807535000a32c24e33f231c6c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.restoreNativeDrive (cognitive 105): index.html.restoreNativeDrive has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 39, ternaries 3 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fddf943892f89af22e14e090d3383e81a760dd718dbd648fb63247bfb350437"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.restoreNativeDrive (cognitive 105): index.html.restoreNativeDrive has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 39, ternaries 3 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b6642d74ff971d79b48de56c48966a61db80f3a91c3a265d3e81c230233435"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.restoreNativeDrive (cognitive 105): index.html.restoreNativeDrive has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 39, ternaries 3 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7919e1c132e6b6860ca4daab8949d2a4e86f1c8ad566c80ead22fbc18837400"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.sendReport (cognitive 100): index.html.sendReport has cognitive complexity 100 (threshold 15). Drivers by points: boolean chains 60, if/else 13 (24 pts), ternaries 7 (15 pts), error handling 1 (nesting depth added 19). Of this number, 97 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3708b0faf152e6dfd9090be2cc6ed65adeb142d25969d6e7fac0106947fb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.sendReport (cognitive 100): index.html.sendReport has cognitive complexity 100 (threshold 15). Drivers by points: boolean chains 60, if/else 13 (24 pts), ternaries 7 (15 pts), error handling 1 (nesting depth added 19). Of this number, 97 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"e046715078d65f50b5bd0ef7e731e9e3393f9214bf590933ca020f3e618a9c57"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.sendReport (cognitive 100): index.html.sendReport has cognitive complexity 100 (threshold 15). Drivers by points: boolean chains 60, if/else 13 (24 pts), ternaries 7 (15 pts), error handling 1 (nesting depth added 19). Of this number, 97 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"806e82080a3f0dccbafa1068aaf3e79b516bc31a6cdd182ccb29f00e268f9e57"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.sendReport (cognitive 100): index.html.sendReport has cognitive complexity 100 (threshold 15). Drivers by points: boolean chains 60, if/else 13 (24 pts), ternaries 7 (15 pts), error handling 1 (nesting depth added 19). Of this number, 97 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3be3332594957e4a078c57824c30ba839b3157e806f08f2ec0833d66915a4d8"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoutingPack (cognitive 99): standalone.validateRoutingPack has cognitive complexity 99 (threshold 15). Drivers by points: if/else 42 (62 pts), boolean chains 29, ternaries 4 (8 pts) (nesting depth added 24). Of this number, 98 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2444c7a1674ebc0d193269746a7bf054f8bdef38d69a279b35026e1ddca34d7"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoutingPack (cognitive 99): standalone.validateRoutingPack has cognitive complexity 99 (threshold 15). Drivers by points: if/else 42 (62 pts), boolean chains 29, ternaries 4 (8 pts) (nesting depth added 24). Of this number, 98 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":"android-app/www/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f60353c794e426effd276103a63b704300a26a90e690542217ff079f3974313"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoutingPack (cognitive 99): standalone.validateRoutingPack has cognitive complexity 99 (threshold 15). Drivers by points: if/else 42 (62 pts), boolean chains 29, ternaries 4 (8 pts) (nesting depth added 24). Of this number, 98 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":"docs/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93f59ee43f8175d6cc1a3c374f18561577f05db6fa9f1353a2f9662aba2b4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoutingPack (cognitive 99): standalone.validateRoutingPack has cognitive complexity 99 (threshold 15). Drivers by points: if/else 42 (62 pts), boolean chains 29, ternaries 4 (8 pts) (nesting depth added 24). Of this number, 98 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":"static/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b960e0be5e145baeff2046aa9548375400989a30298a875a0f67543bc50cdfc6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cognitive 97): standalone.installRoutingAuthorities has cognitive complexity 97 (threshold 15). Drivers by points: if/else 43 (66 pts), boolean chains 22, loops 5 (9 pts) (nesting depth added 27). Of this number, 96 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf74a5d33cfbbaf51db7b938249dba13dcbc50d9142bdfa072541e33e842e663"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cognitive 97): standalone.installRoutingAuthorities has cognitive complexity 97 (threshold 15). Drivers by points: if/else 43 (66 pts), boolean chains 22, loops 5 (9 pts) (nesting depth added 27). Of this number, 96 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":"android-app/www/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6f2bedf3138c6d2a2e905738494e457d4a299b51dc511be676d621bf9604d1"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cognitive 97): standalone.installRoutingAuthorities has cognitive complexity 97 (threshold 15). Drivers by points: if/else 43 (66 pts), boolean chains 22, loops 5 (9 pts) (nesting depth added 27). Of this number, 96 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":"docs/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ddd0bb65b8c1bd7b54e82efd472d446ca73334653170d9f39c5c0cefadbe6a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.installRoutingAuthorities (cognitive 97): standalone.installRoutingAuthorities has cognitive complexity 97 (threshold 15). Drivers by points: if/else 43 (66 pts), boolean chains 22, loops 5 (9 pts) (nesting depth added 27). Of this number, 96 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":"static/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"80204dd599d4c5a501dc78d4a1ad45f6d2111ef8afb451444720ca494d053498"}},{"ruleId":"D2","level":"warning","message":{"text":"measureSnapshot (cognitive 97): measureSnapshot has cognitive complexity 97 (threshold 15). Drivers by points: if/else 19 (62 pts), loops 7 (19 pts), ternaries 3 (10 pts), boolean chains 6 (nesting depth added 62). Of this number, 94 points are the body\u0027s own statements and 3 belong to 11 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5139596b9b743ebc1908fa7e990106fb0bf690c32ce1b13747d6648ad212e43"}},{"ruleId":"D2","level":"warning","message":{"text":"createGeolocator.resolve (cognitive 95): createGeolocator.resolve has cognitive complexity 95 (threshold 15). Drivers by points: ternaries 32 (46 pts), if/else 16 (23 pts), boolean chains 20, error handling 2 (4 pts), loops 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":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11776ea4c9dddb386ec3f23ee28c9ed82558b6a4386e5f26c4c383e5f307e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveAdmitted (cognitive 93): index.html.startDriveAdmitted has cognitive complexity 93 (threshold 15). Drivers by points: boolean chains 42, if/else 29 (35 pts), error handling 5 (8 pts), ternaries 5 (8 pts) (nesting depth added 12). Of this number, 79 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"87782af14c78e418d9c3181e629aecb707dbf98433ab2fa34340e45850056d05"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveAdmitted (cognitive 93): index.html.startDriveAdmitted has cognitive complexity 93 (threshold 15). Drivers by points: boolean chains 42, if/else 29 (35 pts), error handling 5 (8 pts), ternaries 5 (8 pts) (nesting depth added 12). Of this number, 79 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"089c22861c46748bbd7318102d72523236b1bd2dab702c54c6ac4c5f6c7263e0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveAdmitted (cognitive 93): index.html.startDriveAdmitted has cognitive complexity 93 (threshold 15). Drivers by points: boolean chains 42, if/else 29 (35 pts), error handling 5 (8 pts), ternaries 5 (8 pts) (nesting depth added 12). Of this number, 79 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"643ce7d74ffbe2f18f8c4d253eef150125510f54a31b8ff7104ba4451c892106"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveAdmitted (cognitive 93): index.html.startDriveAdmitted has cognitive complexity 93 (threshold 15). Drivers by points: boolean chains 42, if/else 29 (35 pts), error handling 5 (8 pts), ternaries 5 (8 pts) (nesting depth added 12). Of this number, 79 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6782b112cb042b694289f0256b6581e0bffd3cb244dd442bebeaf34d5832f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"migrateLegacyComplaintRecord (cognitive 91): migrateLegacyComplaintRecord has cognitive complexity 91 (threshold 15). Drivers by points: boolean chains 32, if/else 24 (32 pts), ternaries 11 (23 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 22). Of this number, 86 points are the body\u0027s own statements and 5 belong to 14 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":"static/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc4c35b27ba6a0dbc3d8f20e0a671b9da09fd98fd101e4e3e0a8bc9aac9e83"}},{"ruleId":"D2","level":"warning","message":{"text":"migrateLegacyComplaintRecord (cognitive 91): migrateLegacyComplaintRecord has cognitive complexity 91 (threshold 15). Drivers by points: boolean chains 32, if/else 24 (32 pts), ternaries 11 (23 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 22). Of this number, 86 points are the body\u0027s own statements and 5 belong to 14 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":"android-app/www/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"402f94070a5c8ef431e5bc179c5976c01be6d93e15e892e738ca3fd6e0553493"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.migrateLegacyComplaintRecord (cognitive 89): standalone.migrateLegacyComplaintRecord has cognitive complexity 89 (threshold 15). Drivers by points: boolean chains 31, if/else 23 (31 pts), ternaries 11 (23 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 22). Of this number, 86 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"db647296c6863756cf523d6f73810100e8447a6e9b661c426564d077fb5df943"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.migrateLegacyComplaintRecord (cognitive 89): standalone.migrateLegacyComplaintRecord has cognitive complexity 89 (threshold 15). Drivers by points: boolean chains 31, if/else 23 (31 pts), ternaries 11 (23 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 22). Of this number, 86 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f663e31922f883d30c44b4adf670b696c7500f68e6d4e96beebfbd18db88ef"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cognitive 88): standalone.savedOfficialRouteBinding has cognitive complexity 88 (threshold 15). Drivers by points: boolean chains 52, if/else 33 (36 pts) (nesting depth added 3). Of this number, 87 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9016cced991ffc028478b05e03e72fb60184f357ee6e97f0de44f6ed9e842d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cognitive 88): standalone.savedOfficialRouteBinding has cognitive complexity 88 (threshold 15). Drivers by points: boolean chains 52, if/else 33 (36 pts) (nesting depth added 3). Of this number, 87 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d06d00257f4e7891bc7985d5fd8b8a6b6d06965d2532123fd18b45242f003b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cognitive 88): standalone.savedOfficialRouteBinding has cognitive complexity 88 (threshold 15). Drivers by points: boolean chains 52, if/else 33 (36 pts) (nesting depth added 3). Of this number, 87 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f57cbc13510d4125ea144e6ca7b3ceaed988d81414865b4651132ba6f2cd43"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedOfficialRouteBinding (cognitive 88): standalone.savedOfficialRouteBinding has cognitive complexity 88 (threshold 15). Drivers by points: boolean chains 52, if/else 33 (36 pts) (nesting depth added 3). Of this number, 87 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"78579f5175435b3fb46ef0e9654a853b9d0323330bb7982f9dd6960d7dbf47df"}},{"ruleId":"D2","level":"warning","message":{"text":"geolocation.createGeolocator.resolve (cognitive 85): geolocation.createGeolocator.resolve has cognitive complexity 85 (threshold 15). Drivers by points: ternaries 24 (37 pts), if/else 16 (23 pts), boolean chains 19, error handling 2 (4 pts), loops 1 (2 pts) (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":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"0331055f858120816c968bb72a7a4f8766e6a28d5b55dbd936bf802d57e98254"}},{"ruleId":"D2","level":"warning","message":{"text":"wardMarkersIn (cognitive 82): wardMarkersIn has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (44 pts), boolean chains 24, loops 5 (10 pts), ternaries 1 (3 pts), other 1 (nesting depth added 33). Of this number, 81 points are the body\u0027s own statements and 1 belongs 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70c5bad107cafd116a08cad4a7f71bb16f68331854a52a3602e51c7af8ac9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.createCivicReport (cognitive 81): standalone.createCivicReport has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 40 (43 pts), boolean chains 36, if/else 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eb316db6f00b799b832083765292ad2cce103543e953a3a3c49d3e57bb3c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.createCivicReport (cognitive 81): standalone.createCivicReport has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 40 (43 pts), boolean chains 36, if/else 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11afba8a76d28c0da641680db314414be9810f4d1a03b63e20fcb67c8948200"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.createCivicReport (cognitive 81): standalone.createCivicReport has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 40 (43 pts), boolean chains 36, if/else 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24f0a6788fc4dc57d759afffb9e31f7c1d6e7fa35e0e485fd499d5ad4bf0651"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.createCivicReport (cognitive 81): standalone.createCivicReport has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 40 (43 pts), boolean chains 36, if/else 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"519ebee3e4909ea6ca2e2c750f07cd39362edd34f6b2ff5a8071fb3a89d40f88"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cognitive 77): standalone.buildComplaintOutputs has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 27 (39 pts), boolean chains 37, if/else 1 (nesting depth added 12). Of this number, 68 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"02592cb2564a2c16c7447421a8a4f2a55faed74aa59f96a6ca644f53c55d853e"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cognitive 77): standalone.buildComplaintOutputs has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 27 (39 pts), boolean chains 37, if/else 1 (nesting depth added 12). Of this number, 68 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc233e2afa455ff5df466c9fe25d442a2779df85337c9a46a314bbf61f0ac85d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cognitive 77): standalone.buildComplaintOutputs has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 27 (39 pts), boolean chains 37, if/else 1 (nesting depth added 12). Of this number, 68 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f96a04d74116a091800b2cfda9181ab41054a971d15138cdc811143784e7423"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.buildComplaintOutputs (cognitive 77): standalone.buildComplaintOutputs has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 27 (39 pts), boolean chains 37, if/else 1 (nesting depth added 12). Of this number, 68 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7bddd47d8e1abca21b55ec437f683d8e2a3b46e4da817fc5a206b020a16a70"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cognitive 75): standalone.savedNonMunicipalLocationMatches has cognitive complexity 75 (threshold 15). Drivers by points: boolean chains 41, if/else 27 (34 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"648f1aba03be6cfa6187d28b6b29fb348f41e5b7cff6b98de9d1078ef1b67ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cognitive 75): standalone.savedNonMunicipalLocationMatches has cognitive complexity 75 (threshold 15). Drivers by points: boolean chains 41, if/else 27 (34 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b10cdb9e035a6d645a7143cdcece07658b5a2fb4636fae51b32dec0ad55931"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cognitive 75): standalone.savedNonMunicipalLocationMatches has cognitive complexity 75 (threshold 15). Drivers by points: boolean chains 41, if/else 27 (34 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71a3713cb5944fd888129340a21014fe2a1458db9abe611708a29dcb09e16b4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedNonMunicipalLocationMatches (cognitive 75): standalone.savedNonMunicipalLocationMatches has cognitive complexity 75 (threshold 15). Drivers by points: boolean chains 41, if/else 27 (34 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3519eeff4af86e75471af1972f886d7eba8ccb515e3679606393b467aaf21e2"}},{"ruleId":"D2","level":"warning","message":{"text":"run_rad_eval._index_to_manifest (cognitive 75): run_rad_eval._index_to_manifest has cognitive complexity 75 (threshold 15). Drivers by points: if/else 28 (50 pts), boolean chains 15, loops 4 (6 pts), error handling 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_rad_eval.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"df666756c8a0adfd8578233a5b9d1aa38d3d30489b45611cdd84e27a31a9ce4e"}},{"ruleId":"D2","level":"warning","message":{"text":"openEmailDraft (cognitive 75): openEmailDraft has cognitive complexity 75 (threshold 15). Drivers by points: boolean chains 37, if/else 14 (19 pts), ternaries 8 (11 pts), error handling 3 (4 pts), loops 2 (4 pts) (nesting depth added 11). Of this number, 74 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2f23f4a5805164cb398c44333c33f69a2995f907f408bcd0c77d64de1fc375"}},{"ruleId":"D2","level":"warning","message":{"text":"openEmailDraft (cognitive 75): openEmailDraft has cognitive complexity 75 (threshold 15). Drivers by points: boolean chains 37, if/else 14 (19 pts), ternaries 8 (11 pts), error handling 3 (4 pts), loops 2 (4 pts) (nesting depth added 11). Of this number, 74 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1719cab7ad6c437321976dcdf8cf6165f971a2a0b1f6c415193607c90d72564c"}},{"ruleId":"D2","level":"warning","message":{"text":"createAddressModel.rowsOf (cognitive 75): createAddressModel.rowsOf has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (41 pts), ternaries 12 (20 pts), boolean chains 10, loops 4 (nesting depth added 31). Of this number, 69 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61183e42b13865f6af5b91f41bdc9238b35d005112fc61fb2245a2e103d5e71"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveJurisdiction (cognitive 74): resolveJurisdiction has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 24 (36 pts), boolean chains 27, if/else 7 (11 pts) (nesting depth added 16). Of this number, 73 points are the body\u0027s own statements and 1 belongs 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":"server/src/index.js"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc89d5c1b4410613c8edcee8eb64de913c13b4fc807f235a672e6bfdf2d2133"}},{"ruleId":"D2","level":"warning","message":{"text":"tenders (cognitive 74): tenders has cognitive complexity 74 (threshold 15). Drivers by points: if/else 13 (33 pts), ternaries 12 (19 pts), boolean chains 16, loops 5 (6 pts) (nesting depth added 28). Of this number, 57 points are the body\u0027s own statements and 17 belong to 7 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcb3ea6c25a471a9a1823176e881332df167f103987a3a03425fd1d4645cb57"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-local-ownership.exactMetresToHighways (cognitive 72): verify-local-ownership.exactMetresToHighways has cognitive complexity 72 (threshold 15). Drivers by points: if/else 8 (35 pts), loops 8 (24 pts), ternaries 2 (10 pts), boolean chains 3 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-ownership.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7311c5557299aa52b4cfe4ec9411d0006d15ae5eb87dd8beb5184ec118d04abf"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleFile (cognitive 70): index.html.handleFile has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (31 pts), ternaries 12 (21 pts), boolean chains 17, error handling 1 (nesting depth added 16). Of this number, 68 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b52490b9498d2609171ada7b6b4e263b7f649ab79a8b0ded41366344207044"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.openEmailDraft (cognitive 70): standalone.openEmailDraft has cognitive complexity 70 (threshold 15). Drivers by points: boolean chains 37, if/else 14 (19 pts), ternaries 5 (7 pts), loops 2 (4 pts), error handling 2 (3 pts) (nesting depth added 10). Of this number, 68 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a53fc1f220ad1ead9ce2c0c0df2b2af7e0fe6596ec53e69e55f340284baa3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleFile (cognitive 70): index.html.handleFile has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (31 pts), ternaries 12 (21 pts), boolean chains 17, error handling 1 (nesting depth added 16). Of this number, 68 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee933a7ba94602961c527096eabf4ac540ef695fb245fb917e16291313f4b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleFile (cognitive 70): index.html.handleFile has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (31 pts), ternaries 12 (21 pts), boolean chains 17, error handling 1 (nesting depth added 16). Of this number, 68 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f261749526658f44a8fc953d588d8159a9001df161e1e8dbdb42c4f5b814d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.openEmailDraft (cognitive 70): standalone.openEmailDraft has cognitive complexity 70 (threshold 15). Drivers by points: boolean chains 37, if/else 14 (19 pts), ternaries 5 (7 pts), loops 2 (4 pts), error handling 2 (3 pts) (nesting depth added 10). Of this number, 68 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03f8e175604d399a52546eb02ed430b24cc68ccf50367a151ef007af07ac4b1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleFile (cognitive 70): index.html.handleFile has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (31 pts), ternaries 12 (21 pts), boolean chains 17, error handling 1 (nesting depth added 16). Of this number, 68 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5baf9c6d3b7a996432dbe1c5087263cf1fb356f0ce3011e2731f72e3143d2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"private_release_gate.validate_manifest (cognitive 70): private_release_gate.validate_manifest has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (51 pts), boolean chains 12, loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_release_gate.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8108e19c1948b48ed24dd4dc102f59404904089783c9434c60ba3598490aa509"}},{"ruleId":"D2","level":"warning","message":{"text":"matchWardTenders (cognitive 69): matchWardTenders has cognitive complexity 69 (threshold 15). Drivers by points: boolean chains 26, if/else 12 (24 pts), ternaries 6 (11 pts), loops 5 (8 pts) (nesting depth added 20). Of this number, 29 points are the body\u0027s own statements and 40 belong to 23 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c766aa8bed97fac52dfb56a61a49379bac90e7fe213d8f87361d4d8e4e0854c9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cognitive 68): index.html.scheduleNativeKeyframeReplay has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 15, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 26). Most of this is not in the body itself: 6 of the 68 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e90e7847e3f3306eecd172266e5519b3df9179a4ade70b7c2d0120514613df2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cognitive 68): index.html.scheduleNativeKeyframeReplay has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 15, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 26). Most of this is not in the body itself: 6 of the 68 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"android-app/www/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b1e5dcc714d8fc15789967511a533549ca17766a23f7bfd4af6132232d8089"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cognitive 68): index.html.scheduleNativeKeyframeReplay has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 15, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 26). Most of this is not in the body itself: 6 of the 68 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"docs/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e4c87800ac5c4aa259066bb674f6f33bf724969e85fbd8e26798a652c226a4"}},{"ruleId":"D2","level":"warning","message":{"text":"ownership-bundle-writer.createOwnershipWriter.addPolygon (cognitive 68): ownership-bundle-writer.createOwnershipWriter.addPolygon has cognitive complexity 68 (threshold 15). Drivers by points: loops 11 (34 pts), if/else 9 (29 pts), boolean chains 4, ternaries 1 (nesting depth added 43). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a0e23ed629580245f0c0e77c6927e9fee5dfd90e247d59c0f1480b2da92a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.scheduleNativeKeyframeReplay (cognitive 68): index.html.scheduleNativeKeyframeReplay has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 15, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 26). Most of this is not in the body itself: 6 of the 68 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 7022, 7034, 7111). 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":"static/index.html"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab935cda3e11f3a5aab39e002efdb10619935f06ead02e034876f54bc2f419"}},{"ruleId":"D2","level":"warning","message":{"text":"createOwnershipWriter.addPolygon (cognitive 68): createOwnershipWriter.addPolygon has cognitive complexity 68 (threshold 15). Drivers by points: loops 11 (34 pts), if/else 9 (29 pts), boolean chains 4, ternaries 1 (nesting depth added 43). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5e3c00a7240f4bf0dad378b9251b196e3f787b3387d0c5d28125fdd6721e95"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.stopDriveSession (cognitive 67): DriveForegroundService.stopDriveSession has cognitive complexity 67 (threshold 15). Drivers by points: if/else 41 (47 pts), error handling 13 (14 pts), boolean chains 5, match/switch 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b551fd020934f510f8ed5407cf49fa710925b5606de400355b8c67fcacc4a9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"run_prepared_eval.load_event (cognitive 67): run_prepared_eval.load_event has cognitive complexity 67 (threshold 15). Drivers by points: if/else 37 (47 pts), boolean chains 14, error handling 2 (4 pts), loops 2 (nesting depth added 12). 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":"eval/run_prepared_eval.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418af0f3340b343b3e909270b34f63cb89717b9540c8e782752815726a7ab05"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_dataset.collect_rad (cognitive 67): prepare_dataset.collect_rad has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 13, loops 4 (7 pts), ternaries 4 (7 pts) (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":"ml/yolo/prepare_dataset.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c3a5c9dcdc9f37f873f814becaf31162f18282f01f1e0fb4bca8e3c29fd709"}},{"ruleId":"D2","level":"warning","message":{"text":"polygonsAt (cognitive 64): polygonsAt has cognitive complexity 64 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 7 (16 pts), ternaries 3 (15 pts), boolean chains 3 (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":"infra/aws-central/service/local-ownership.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"95db805d2d8e724dfddfc30c4d6cfdb0870ef038b834d4dec0256f13b2630355"}},{"ruleId":"D2","level":"warning","message":{"text":"judgeWindow (cognitive 64): judgeWindow has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 21 (28 pts), boolean chains 16, if/else 13 (15 pts), loops 4, error handling 1 (nesting depth added 9). Of this number, 54 points are the body\u0027s own statements and 10 belong to 15 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/window.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c95e74113ce32cb29407a8add14c69f4d4038896dea7179bc7a5a69708bf07"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.createAddressModel.rowsOf (cognitive 63): build-street-index.createAddressModel.rowsOf has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 10, ternaries 4 (8 pts), loops 4 (nesting depth added 27). Of this number, 62 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf498d752a2bfbc9aee941fbb44153b93706ef7f4df33a2c53fde38b7e15fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cognitive 62): index.html.replayNativeKeyframeBatch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 11, ternaries 5 (8 pts), error handling 1 (2 pts), loops 1 (nesting depth added 19). Of this number, 58 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2af497b7461e3ad222858fd56ce5912dabfc6f5901533272684fe3337a076a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.pruneStatePacks (cognitive 62): standalone.pruneStatePacks has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 10 (25 pts), boolean chains 22, if/else 5 (9 pts), error handling 2 (3 pts), loops 3 (nesting depth added 20). Of this number, 58 points are the body\u0027s own statements and 4 belong to 2 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac86cfd57f09fdabd28714b16e3066fb7c1b743b1eb4569dbac4e0ddab0c0b3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cognitive 62): index.html.replayNativeKeyframeBatch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 11, ternaries 5 (8 pts), error handling 1 (2 pts), loops 1 (nesting depth added 19). Of this number, 58 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"788099eac44dd0d7f94e8db35ed2b077524f67822fade1ba97c481c1ffe6e4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.pruneStatePacks (cognitive 62): standalone.pruneStatePacks has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 10 (25 pts), boolean chains 22, if/else 5 (9 pts), error handling 2 (3 pts), loops 3 (nesting depth added 20). Of this number, 58 points are the body\u0027s own statements and 4 belong to 2 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":"android-app/www/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"31303259d0b63a33298ab91d053513b9bf8c81fc14ccdcc698d5031239689e08"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cognitive 62): index.html.replayNativeKeyframeBatch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 11, ternaries 5 (8 pts), error handling 1 (2 pts), loops 1 (nesting depth added 19). Of this number, 58 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79a704353c89d1805cca7b6d2e3178e4f9a53bc51fc52375e3e693ea5e607ee"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.pruneStatePacks (cognitive 62): standalone.pruneStatePacks has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 10 (25 pts), boolean chains 22, if/else 5 (9 pts), error handling 2 (3 pts), loops 3 (nesting depth added 20). Of this number, 58 points are the body\u0027s own statements and 4 belong to 2 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":"docs/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97badbb907148a262882557d97105a1283ed33a379f5c515c8013da060e6761"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-local-address.compare (cognitive 62): verify-local-address.compare has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 7 (14 pts), boolean chains 7, ternaries 1 (nesting depth added 33). Of this number, 60 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837d2faf53740cd6a8733d23fe4db39dea23565232a5d851925f423ba7af818"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.replayNativeKeyframeBatch (cognitive 62): index.html.replayNativeKeyframeBatch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 11, ternaries 5 (8 pts), error handling 1 (2 pts), loops 1 (nesting depth added 19). Of this number, 58 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":6847}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85f4de5eb4b37a7879f65a294df6f54fbb13feba4502f940458839816bcf0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.pruneStatePacks (cognitive 62): standalone.pruneStatePacks has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 10 (25 pts), boolean chains 22, if/else 5 (9 pts), error handling 2 (3 pts), loops 3 (nesting depth added 20). Of this number, 58 points are the body\u0027s own statements and 4 belong to 2 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":"static/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"f040fbb85b1fb8818751ed6cf61af25150f8b8fccab6bbec5519a58971da6c75"}},{"ruleId":"D2","level":"warning","message":{"text":"wardMarkers (cognitive 61): wardMarkers has cognitive complexity 61 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 9 (17 pts), boolean chains 15, ternaries 2 (4 pts) (nesting depth added 25). Of this number, 49 points are the body\u0027s own statements and 12 belong to 7 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e349d8c7f45e060e08d716d9747fff2a48bb82fbd5a2f0cbbb8fe9f4afedb11e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drainDriveQueue (cognitive 60): index.html.drainDriveQueue has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 19, loops 1, ternaries 1 (nesting depth added 19). Of this number, 16 points are the body\u0027s own statements and 44 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"095707ccdd181bc01c7adb3ba9266175841214cd34a8be19245f25627d87b620"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drainDriveQueue (cognitive 60): index.html.drainDriveQueue has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 19, loops 1, ternaries 1 (nesting depth added 19). Of this number, 16 points are the body\u0027s own statements and 44 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":"android-app/www/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dce9ff2a7538669d29531123bbbdf6f1219d2c4c6a9293b5ae377e85bca7f64"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drainDriveQueue (cognitive 60): index.html.drainDriveQueue has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 19, loops 1, ternaries 1 (nesting depth added 19). Of this number, 16 points are the body\u0027s own statements and 44 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":"docs/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"808154c95b2b5c81c012404cea2bfd1fbe969cf7b2b56f543ed0c7ee4b91cd4d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drainDriveQueue (cognitive 60): index.html.drainDriveQueue has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 19, loops 1, ternaries 1 (nesting depth added 19). Of this number, 16 points are the body\u0027s own statements and 44 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":"static/index.html"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"476836c7b61daab02f919b85799e8467571439f1f742d0e7dd34e2359cd8f615"}},{"ruleId":"D2","level":"warning","message":{"text":"run_tender_eval.main (cognitive 60): run_tender_eval.main has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 10 (14 pts), boolean chains 7, ternaries 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_tender_eval.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a71486b50e25790e3d79eba5351f33849f7f89fe79a57c7b66aa8eb102c6862"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cognitive 58): index.html.updateNativeDriveHud has cognitive complexity 58 (threshold 15). Drivers by points: boolean chains 28, if/else 25 (27 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeb50a12357736d0703e0090d02f79681df0998f07df4c690f76858ace05abc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cognitive 58): index.html.updateNativeDriveHud has cognitive complexity 58 (threshold 15). Drivers by points: boolean chains 28, if/else 25 (27 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdcff2b03e29586b9917033253552b8b9ffba1ccca3cff9be7eb76012972c06"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cognitive 58): index.html.updateNativeDriveHud has cognitive complexity 58 (threshold 15). Drivers by points: boolean chains 28, if/else 25 (27 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"4521dd4c81db171711589ad598bc43c6b32512c200c86a1482487c043ae0261b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeDriveHud (cognitive 58): index.html.updateNativeDriveHud has cognitive complexity 58 (threshold 15). Drivers by points: boolean chains 28, if/else 25 (27 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30c073dc628c8b123a26977924452712f6070b8966af31981d08d2cdc44c7f2"}},{"ruleId":"D2","level":"warning","message":{"text":"urbanBodyOf (cognitive 58): urbanBodyOf has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 21, 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":"infra/aws-central/service/notice-bodies.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca71ff3c0e3105e896ebf6c2f4781b1853e9c531f9d18e836c4fd5dfb8ee8e0"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 58): main has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 6 (11 pts), boolean chains 10, ternaries 4 (8 pts) (nesting depth added 22). Of this number, 50 points are the body\u0027s own statements and 8 belong to 16 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":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f84726e2ba075d71a70080f90a82a5f4cf79e9a4038211ae1c0881e54857201"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 58): main has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 11 (18 pts), if/else 10 (17 pts), loops 9 (13 pts), boolean chains 10 (nesting depth added 18). Of this number, 45 points are the body\u0027s own statements and 13 belong to 22 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":"infra/aws-central/tools/ward-tender-experiment.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e92848350f8d932dfc8e3d41563cea762e6f2fc0f55c714474f5800a4784ce"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports (cognitive 56): index.html.renderReports has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 48, ternaries 20 (30 pts), if/else 11 (18 pts), loops 13, error handling 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. This shape REPEATS in the file: 2 other methods here (index.html.renderReports::cardHtml, index.html.renderReports::footageRowHtml) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08cb792ad52ed566757f373290bdb1d94c78b94de6af4fb14e619877d8a2cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports (cognitive 56): index.html.renderReports has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 48, ternaries 20 (30 pts), if/else 11 (18 pts), loops 13, error handling 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. This shape REPEATS in the file: 2 other methods here (index.html.renderReports::cardHtml, index.html.renderReports::footageRowHtml) 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":"android-app/www/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dceaeda9ff40f503cedb19f8b73046cc69120d346f2ee6d47c14e737e6433e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports (cognitive 56): index.html.renderReports has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 48, ternaries 20 (30 pts), if/else 11 (18 pts), loops 13, error handling 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. This shape REPEATS in the file: 2 other methods here (index.html.renderReports::cardHtml, index.html.renderReports::footageRowHtml) 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":"docs/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efe548e5e4833e7bc71d1a4ddf62e168887a6f9e8488e4c4ac25e983b62ac3b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports (cognitive 56): index.html.renderReports has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 48, ternaries 20 (30 pts), if/else 11 (18 pts), loops 13, error handling 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. This shape REPEATS in the file: 2 other methods here (index.html.renderReports::cardHtml, index.html.renderReports::footageRowHtml) 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":"static/index.html"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c8ee39a672ee0ffaf786e8171418a2be251bd0df23522b60d2474e97d61862"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.driveTick (cognitive 55): index.html.driveTick has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 18, ternaries 7 (15 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a20522210ffd6d88489d497266c7a2fa57e8feb193190fcd1d213f3ee9b1db6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.driveTick (cognitive 55): index.html.driveTick has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 18, ternaries 7 (15 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f4ecbf82bf2354cd8fb2b3c9e8266e745de97b1e1cf51fcaa07e8e35dee40e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.driveTick (cognitive 55): index.html.driveTick has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 18, ternaries 7 (15 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"77862dc9ed01b207e3efb3622bea80d59be655fb481cfcb18d98dc51cce6d39a"}},{"ruleId":"D2","level":"warning","message":{"text":"canary.runCanary (cognitive 55): canary.runCanary has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 13 (21 pts), if/else 14 (18 pts), boolean chains 13, error handling 2, loops 1 (nesting depth added 12). Of this number, 52 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/canary.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"495ca36edc43da26d5bc92cc3f3a0ff9f93b6133ee346fa85b49fa375df9d7c9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.driveTick (cognitive 55): index.html.driveTick has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 18, ternaries 7 (15 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1804dceb3f20d242dd83b328f7dd8062dbc3cc127f43e7ad4877992a04dc6d"}},{"ruleId":"D2","level":"warning","message":{"text":"run_rad_eval.validate_manifest (cognitive 55): run_rad_eval.validate_manifest has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 12, loops 2, ternaries 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_rad_eval.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8149727d5822422dcbc82c5a1b930096070d5b754b96c1f19397be5a0791dacf"}},{"ruleId":"D2","level":"warning","message":{"text":"createService::report (cognitive 55): createService::report has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 15 (20 pts), boolean chains 15, if/else 10 (14 pts), error handling 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d524e3ecca3c1307dbc7a2a04d3f029df14a112355ca5957fc609f322436aeb4"}},{"ruleId":"D2","level":"warning","message":{"text":"createService::handleProfiled (cognitive 55): createService::handleProfiled has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 26, other 11, ternaries 5 (8 pts), error handling 3 (6 pts), if/else 3 (4 pts) (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1ae21a6967f3d1dc1dc56e1f1e97d8c12e59ae8afa4cd59e16c4336797aa40"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.consumeInferenceJobs (cognitive 53): DriveForegroundService.consumeInferenceJobs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (36 pts), error handling 5 (11 pts), boolean chains 5, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b762354595a4b4174bcd99cb55fa3a6ed4d816bf85e13b53ac849ca12b171f5"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval.run_paid (cognitive 53): exhaustive_video_eval.run_paid has cognitive complexity 53 (threshold 15). Drivers by points: if/else 25 (38 pts), boolean chains 8, loops 3 (4 pts), ternaries 2, error handling 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":"eval/exhaustive_video_eval.py"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6ed21c661c7e773cace0672a91426b048e3b4dcd83cc6656dc21d609244df6"}},{"ruleId":"D2","level":"warning","message":{"text":"tenderCoversCarriageway (cognitive 52): tenderCoversCarriageway has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 20, loops 3 (6 pts) (nesting depth added 15). Of this number, 49 points are the body\u0027s own statements and 3 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":"static/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"472ff089a85e807f54e8e6531fd61c9461e9bb4e4381333f51e6aa00ec85ad4e"}},{"ruleId":"D2","level":"warning","message":{"text":"tenderCoversCarriageway (cognitive 52): tenderCoversCarriageway has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 20, loops 3 (6 pts) (nesting depth added 15). Of this number, 49 points are the body\u0027s own statements and 3 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":"android-app/www/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1eba2fb1be114adc9481f04f90220c8c5b630b7c71a14fc4f4336c29ce2f58"}},{"ruleId":"D2","level":"warning","message":{"text":"tenderCoversCarriageway (cognitive 52): tenderCoversCarriageway has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 20, loops 3 (6 pts) (nesting depth added 15). Of this number, 49 points are the body\u0027s own statements and 3 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":"infra/aws-central/service/tender-scope.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c1a67d10c26c4e110ae31c161bee20c35047700ed1a007f502017501b7ad35"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cognitive 51): standalone.municipalCityRouteFromGeocode has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d487299e0feb526d8a18146eb923f0865a260dbca58eebe37649be1591b4c510"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cognitive 51): standalone.municipalCityRouteFromGeocode has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4611279ab94bf1ad230035cd191db4276c2afd16689fd998d262798e0872d0db"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cognitive 51): standalone.municipalCityRouteFromGeocode has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84ee6b13521b34427d62234a3705ab65be63610427c12d62025369b46a80605"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.municipalCityRouteFromGeocode (cognitive 51): standalone.municipalCityRouteFromGeocode has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"10013f5ac7b33010f666610dd7cffe1a5723681a0845c62532f26219974927d7"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDeduplicationEngine.matchRoadEvent (cognitive 51): NativeDeduplicationEngine.matchRoadEvent has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (35 pts), boolean chains 16 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d1c9c83fd1bad5f747d1d7b508aae926da842c47c96ba8dd6fe542ab379bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationHelper.buildNotification (cognitive 51): NotificationHelper.buildNotification has cognitive complexity 51 (threshold 15). Drivers by points: if/else 30 (41 pts), boolean chains 8, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"01412405c6adedb1aec436db1758cea9919a98ba79598b97a6fcafcb9ae88ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tenderCoversCarriageway (cognitive 50): standalone.tenderCoversCarriageway has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 18, loops 3 (6 pts) (nesting depth added 15). Of this number, 47 points are the body\u0027s own statements and 3 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7c5833096e636290f7682e5cc128054310a6ddee4fdbac00c2a329150bdefd"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tenderCoversCarriageway (cognitive 50): standalone.tenderCoversCarriageway has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 18, loops 3 (6 pts) (nesting depth added 15). Of this number, 47 points are the body\u0027s own statements and 3 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":"docs/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"082d18d59be8e68c6a631d7746f2777dd2e5a721a436db6d7717f57d5c08ae47"}},{"ruleId":"D2","level":"warning","message":{"text":"pointOnSurface (cognitive 50): pointOnSurface has cognitive complexity 50 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 7 (15 pts), boolean chains 8 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b29917c9da752c1967359df08acd4093a7868bd459aed2397f2c4547e0fb85"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.rdd2022 (cognitive 49): prepare.rdd2022 has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (10 pts), ternaries 3 (10 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"97835b1bf6e4e729d5ecffc22dfef4e00f10561654b529300d739e03da361bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"release.build_model_manifest (cognitive 49): release.build_model_manifest has cognitive complexity 49 (threshold 15). Drivers by points: if/else 35, boolean chains 12, error handling 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/release.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c602d792c750fa63eec58e47df3a031de22aeae768b769abfe9d1803c6d87a"}},{"ruleId":"D2","level":"warning","message":{"text":"retryCivicRouting (cognitive 49): retryCivicRouting has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 21, ternaries 10 (15 pts), if/else 9, error handling 3 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"static/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fba15a0d7d2c2780184066547c2a2ac5f0a06d826d7ff18565e06327e1fd36"}},{"ruleId":"D2","level":"warning","message":{"text":"retryCivicRouting (cognitive 49): retryCivicRouting has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 21, ternaries 10 (15 pts), if/else 9, error handling 3 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f92d8ad6be01bffb43acb1b3b5d1fc5102d0f21804ebf4b277e08c421e0973"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDetail (cognitive 48): index.html.openDetail has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 26, if/else 17 (20 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 45 points are the body\u0027s own statements and 3 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c357147d53879986eada7dee5d61f13cfac9de29ef4f305f458e0d54222f74bd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.finishNativeDrive (cognitive 48): index.html.finishNativeDrive has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 32, if/else 9 (11 pts), ternaries 3, loops 1 (2 pts) (nesting depth added 3). Of this number, 45 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb572a28a1425e4d0ec94b82ec4b569c346a2c053a601fc5b14dbbf57427f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDetail (cognitive 48): index.html.openDetail has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 26, if/else 17 (20 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 45 points are the body\u0027s own statements and 3 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1b9a7a34751088ed1359d34bde8ff46ad388f7ea26ab03ed175bb39932b8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.finishNativeDrive (cognitive 48): index.html.finishNativeDrive has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 32, if/else 9 (11 pts), ternaries 3, loops 1 (2 pts) (nesting depth added 3). Of this number, 45 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"34708c288e4fc15d3c4e4e0088dfcffec19b83a2ba93d40f7f2d110050f87849"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDetail (cognitive 48): index.html.openDetail has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 26, if/else 17 (20 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 45 points are the body\u0027s own statements and 3 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8fe80d684341b84268e18d079b48782a44aa01c661928642ee06da76b7124a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.finishNativeDrive (cognitive 48): index.html.finishNativeDrive has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 32, if/else 9 (11 pts), ternaries 3, loops 1 (2 pts) (nesting depth added 3). Of this number, 45 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"74627d251be0194ef18f9a81bdca59186aa2e7bfa774e3cf459d4c05c38f8aad"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDetail (cognitive 48): index.html.openDetail has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 26, if/else 17 (20 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 45 points are the body\u0027s own statements and 3 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"796864a0761eaba5a3984421a3f824fac7ccc256ee4533d1bc6c9c602ef2559f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.finishNativeDrive (cognitive 48): index.html.finishNativeDrive has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 32, if/else 9 (11 pts), ternaries 3, loops 1 (2 pts) (nesting depth added 3). Of this number, 45 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":4883}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eeb2f5a11eec36575c7d02f510e330b254910c2e4412501f9255a7e9c27f00"}},{"ruleId":"D2","level":"warning","message":{"text":"run_eval.main (cognitive 47): run_eval.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 9 (15 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"207d45307ee2b5bd105ef12506064f2b28a266c0f5215ee34da48d3996e746ee"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cognitive 46): index.html.ensureNativeDriveListeners has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 24, if/else 12 (20 pts), ternaries 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1db0b731906ba9ce9550c7278a005351eeba604a0ef69e228844e2168a3281"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cognitive 46): index.html.ensureNativeDriveListeners has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 24, if/else 12 (20 pts), ternaries 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"android-app/www/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4807d9b7b1191cc88bb776a253f15ed5f5425f4de1502a0a2a8352cf7ae26c3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cognitive 46): index.html.ensureNativeDriveListeners has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 24, if/else 12 (20 pts), ternaries 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"docs/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"312e4adb3f00d983d3750fb6e5b8a1794fa1b06adfd7a6e1ff9097038bf2bef2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureNativeDriveListeners (cognitive 46): index.html.ensureNativeDriveListeners has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 24, if/else 12 (20 pts), ternaries 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5047, 5084). 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":"static/index.html"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc03f94f3a052324d966f7663dda84fa979b6e45fb438e838247b94371ec14e"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval.validate_materialized (cognitive 46): exhaustive_video_eval.validate_materialized has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 11, loops 4 (6 pts), error handling 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32c33f1d3f5516006641cf54fc20e55ec65f102973ef86c9726090d328535a3"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cognitive 45): standalone.maharashtraRouteFromGeocode has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 12 (17 pts), boolean chains 7 (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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f82aacba63da733fa82ac9bdcb1111a108b67a367f5d95ec46bd99402897b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cognitive 45): standalone.maharashtraRouteFromGeocode has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 12 (17 pts), boolean chains 7 (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":"android-app/www/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cbe0fda8cda48cded54546867a4884f22238e71f2a2d445c0b791227d49c18"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cognitive 45): standalone.maharashtraRouteFromGeocode has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 12 (17 pts), boolean chains 7 (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":"docs/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f76851ad650e77cf733a86858fdff8a6a440cfd3810b1d3cb5658e92626729"}},{"ruleId":"D2","level":"warning","message":{"text":"ward-tender-vocabulary.main (cognitive 45): ward-tender-vocabulary.main has cognitive complexity 45 (threshold 15). Drivers by points: loops 14 (24 pts), if/else 4 (15 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 22). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ward-tender-vocabulary.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefc1019b29e8427caaf53c60a6a087695725dc0a3aa9c13debfe02347f02c18"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.maharashtraRouteFromGeocode (cognitive 45): standalone.maharashtraRouteFromGeocode has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 12 (17 pts), boolean chains 7 (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":"static/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a7d5a704506989fabe03f124403595dcaafe7a9c53acd0db053661e7d4e213"}},{"ruleId":"D2","level":"warning","message":{"text":"run_rad_eval.validate_result_rows (cognitive 45): run_rad_eval.validate_result_rows has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 4, loops 2 (3 pts) (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":"eval/run_rad_eval.py"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b873ab947acf2e4aa94793cba9b692c6076d968192848ebf0114c5e951ba5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate._score_operating_point (cognitive 45): evaluate._score_operating_point has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (28 pts), ternaries 8, loops 3 (5 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/evaluate.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f12f629bebdd70404a122af9442efcd2622049ad8b9026f19f4c27a49a1ff8c"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_dataset.collect_owned (cognitive 44): prepare_dataset.collect_owned has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (32 pts), ternaries 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/prepare_dataset.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"497b414237bc1ee6d748692e01aa0df46a2a1499fb8b1f8a8d9d566d45eee023"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.shortlistFor (cognitive 43): standalone.shortlistFor has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 8 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 14). Of this number, 40 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a307a5bcc9099b260832291cf2f7c070fcc706979e563a986d348feadb0f7432"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.shortlistFor (cognitive 43): standalone.shortlistFor has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 8 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 14). Of this number, 40 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f0791e8da2942f94e0d7fa5a9ae9531b39bdf5d040233da36ace04021a1d9"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.shortlistFor (cognitive 43): standalone.shortlistFor has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 8 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 14). Of this number, 40 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec051f830485b808e63cb1b8a31f807343a5e3e18d245f40fb6a93505ee7a4c"}},{"ruleId":"D2","level":"warning","message":{"text":"local-address.search (cognitive 43): local-address.search has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 12, loops 4 (8 pts), ternaries 4 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (local-address.search::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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"31960799a1c78d94952dc08279d1ff19d9b5fcb9e8fc42e830531784695aaca5"}},{"ruleId":"D2","level":"warning","message":{"text":"kgis-layers.downloadLayer (cognitive 43): kgis-layers.downloadLayer has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 7, loops 4 (7 pts), error handling 1 (3 pts), ternaries 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":"infra/aws-central/tools/kgis-layers.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b821657015939b28c1815ba92ad4c8697888f3821d30d615b9ce5a3bb1d611a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.shortlistFor (cognitive 43): standalone.shortlistFor has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 8 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 14). Of this number, 40 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a61cef72d09d5ec5ebe28ccc7224ce47886a9fd7d37c98f957ceb43303a733"}},{"ruleId":"D2","level":"warning","message":{"text":"run.tasks (cognitive 43): run.tasks has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 11, loops 3 (7 pts), ternaries 2 (5 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":"tools/harness/run.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb27dfaeedb2a07c22c9f6cc6d7bfac78ca069eac316e35a7de61e2cc77a241f"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.startScanLoop (cognitive 43): DriveForegroundService.startScanLoop has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (33 pts), error handling 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff15cceb9f8b2ca07f8925b55bb09580a1f25215c9f16c118ecb61f44797d85"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDash (cognitive 42): index.html.openDash has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 21, ternaries 11 (14 pts), if/else 5 (6 pts), loops 1 (nesting depth added 4). Of this number, 38 points are the body\u0027s own statements and 4 belong to 6 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"948faaeade615b03c3439ac2c259175a00cdbed3c2b6f4fa416781b2cfa9462e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDash (cognitive 42): index.html.openDash has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 21, ternaries 11 (14 pts), if/else 5 (6 pts), loops 1 (nesting depth added 4). Of this number, 38 points are the body\u0027s own statements and 4 belong to 6 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7584d340c05d1f818e55c8b546d54995525ad9245728419af9006194ffc63b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDash (cognitive 42): index.html.openDash has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 21, ternaries 11 (14 pts), if/else 5 (6 pts), loops 1 (nesting depth added 4). Of this number, 38 points are the body\u0027s own statements and 4 belong to 6 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f66315030e66e907627803c84bd446583a8e5f17f188ea8afd18a3c92b797e"}},{"ruleId":"D2","level":"warning","message":{"text":"tenders.matchTender (cognitive 42): tenders.matchTender has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 16, loops 2 (3 pts) (nesting depth added 12). Of this number, 40 points are the body\u0027s own statements and 2 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":"infra/aws-central/service/tenders.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dad0732273a754ea890745e66a138944a75ade0be91edea2098a0c633159e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.openDash (cognitive 42): index.html.openDash has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 21, ternaries 11 (14 pts), if/else 5 (6 pts), loops 1 (nesting depth added 4). Of this number, 38 points are the body\u0027s own statements and 4 belong to 6 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fd5872efb544a1135b093d0221ae738873ef5ea61f18f16bac6a8bf829bed4"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.refreshCaptureInterlock (cognitive 42): DriveForegroundService.refreshCaptureInterlock has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 9, error handling 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":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8dd8ce08c41e9fc9be611dfbadb4b926263adef169c140aac915d3efc52e73"}},{"ruleId":"D2","level":"warning","message":{"text":"openOfficialHandoff (cognitive 42): openOfficialHandoff has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 14, ternaries 4 (6 pts), error handling 1 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d8b471203e5df0998139f60d07818293f865e743a7a2bc216960d2955a27fa"}},{"ruleId":"D2","level":"warning","message":{"text":"openOfficialHandoff (cognitive 42): openOfficialHandoff has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 14, ternaries 4 (6 pts), error handling 1 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"072ac254e2d032ce1732b7834f444a4c09d66a0b292a265ec0c3834dbc027da2"}},{"ruleId":"D2","level":"warning","message":{"text":"indexStreets (cognitive 42): indexStreets has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (33 pts), ternaries 6 (16 pts), loops 6 (8 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbe451904b60ed80848b1ff64bd284ec5e94a93bc1c5c73153fdb180a160ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"normaliseTenderMatch (cognitive 41): normaliseTenderMatch has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 29, ternaries 10, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4571b59e1d9b2eeb72b3520710be3fad18c8395c4c7fcd7f62caf280dd7bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"normaliseTenderMatch (cognitive 41): normaliseTenderMatch has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 29, ternaries 10, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faefd8752f70cb70ebe40cc522f540b45be05620412619217e0f5a0e6ad6e70"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.syncNativeRepairData (cognitive 40): index.html.syncNativeRepairData has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (23 pts), error handling 2 (8 pts), loops 2 (5 pts), boolean chains 4 (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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4404db19f8dada8c4cd3a7af60af8d609c4a35db7c5f60e189cb611f114816b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cognitive 40): standalone.validateOfficialHandoffRegistry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 17, loops 1 (nesting depth added 11). Of this number, 39 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e8cc6ab02c99c1c794dd63f20cc439fa54009149c8e7d2aa4b9d7e911344b7"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.retryCivicRouting (cognitive 40): standalone.retryCivicRouting has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 20, ternaries 8 (11 pts), if/else 9 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"82072ff1cd1f9171414d28c9c56707c131d456d10ce8a0420379dae0b210c301"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.syncNativeRepairData (cognitive 40): index.html.syncNativeRepairData has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (23 pts), error handling 2 (8 pts), loops 2 (5 pts), boolean chains 4 (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":"android-app/www/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be447899e6768b542095a23b694e84c1e67c9dd4572cde3b6467a0e7dceb587"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cognitive 40): standalone.validateOfficialHandoffRegistry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 17, loops 1 (nesting depth added 11). Of this number, 39 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef938d0153dc211ecb5d0140babf637d36181e2755cc84c9421e9ff731f50013"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.syncNativeRepairData (cognitive 40): index.html.syncNativeRepairData has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (23 pts), error handling 2 (8 pts), loops 2 (5 pts), boolean chains 4 (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":"docs/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a29b31c4b4b032f7cf456b6e04f6516a4b5104f8f64bfc39ab76325de5f2f22"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cognitive 40): standalone.validateOfficialHandoffRegistry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 17, loops 1 (nesting depth added 11). Of this number, 39 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dad1bb4b38db800dee18b284b8aee1d7bedab1235a3636a64fd065eba8e48d4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.retryCivicRouting (cognitive 40): standalone.retryCivicRouting has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 20, ternaries 8 (11 pts), if/else 9 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbb7581598292d2c9cabb83f12fdf1896b7674d91b565336853c3f1894303ed"}},{"ruleId":"D2","level":"warning","message":{"text":"index.tenderShortlist (cognitive 40): index.tenderShortlist has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 7 (10 pts), boolean chains 9, ternaries 2 (nesting depth added 12). Of this number, 37 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a7c8e3b20ed5fdeee6f9c4baabc4d7464185833151a1606a62d5ba43469731"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.syncNativeRepairData (cognitive 40): index.html.syncNativeRepairData has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (23 pts), error handling 2 (8 pts), loops 2 (5 pts), boolean chains 4 (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":"static/index.html"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d37e5c69dd334ef36b875ceaa4fa0b67626c33f02995edf1cd517dbe4c2a49"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateOfficialHandoffRegistry (cognitive 40): standalone.validateOfficialHandoffRegistry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 17, loops 1 (nesting depth added 11). Of this number, 39 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"699a6bf40287505ae5fb55dbe7eaf29b5b3621aa5bbde1a708ad398833139ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeBridgeJpeg.isPlausibleJpeg (cognitive 40): NativeBridgeJpeg.isPlausibleJpeg has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/NativeBridgeJpeg.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0392df0c5321917c97b7e36920d015bc1ae71c8b73bf410ddd2fc4a03a13ab16"}},{"ruleId":"D2","level":"warning","message":{"text":"rad_dataset.build_index (cognitive 40): rad_dataset.build_index has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 7 (11 pts), boolean chains 6 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/rad_dataset.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb417f53c7af9560ef70bef70b9ea2895442a9d99f845e402fe397a4c05610c"}},{"ruleId":"D2","level":"warning","message":{"text":"validateMunicipalCityPayload (cognitive 40): validateMunicipalCityPayload has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 17, ternaries 1 (3 pts), loops 1 (nesting depth added 10). Of this number, 34 points are the body\u0027s own statements and 6 belong to 7 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":"static/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53b247a233d5a9e3c7db3ebe7ded1853d14d316388fd5795ef1672f9b0d20dd"}},{"ruleId":"D2","level":"warning","message":{"text":"validateMunicipalCityPayload (cognitive 40): validateMunicipalCityPayload has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 17, ternaries 1 (3 pts), loops 1 (nesting depth added 10). Of this number, 34 points are the body\u0027s own statements and 6 belong to 7 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":"android-app/www/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"114f0a34e45627ed1450ae867523a7a26748764618d03f0f3c6738da15a8ccc2"}},{"ruleId":"D2","level":"warning","message":{"text":"build_manifest.main (cognitive 39): build_manifest.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 4 (5 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/build_manifest.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb77fcc6b648b90f405430b9d6aae4ff94dd5abcd7fa488b2513992f45f5d85c"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.main (cognitive 39): prepare.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 8 (11 pts), boolean chains 5, ternaries 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":"ml/detector/prepare.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e150bc0b436ca053be5dee30c2f6e8581415911ce75cce63fce483cf377e32"}},{"ruleId":"D2","level":"warning","message":{"text":"parity.compare_prediction_sets (cognitive 39): parity.compare_prediction_sets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 5 (9 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/parity.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be169394a54dd8ad4fd0d87280be6988b80fac2a4c33926895194eef36e1c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess (cognitive 39): addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 9 (18 pts), boolean chains 13, if/else 5 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dcc8cc925084f88c8b6c31e2449dd0978bdca12dccdb3fd0a2020922b8faa7"}},{"ruleId":"D2","level":"warning","message":{"text":"addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess (cognitive 39): addReportUnlessDuplicate::(anonymous)::(anonymous)::scan::onsuccess has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 9 (18 pts), boolean chains 13, if/else 5 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"359fa882f13cb914c35aaf86378746c1e7d845d89bd5d4574bbafcd2b378285b"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate._average_precision_at_iou (cognitive 38): evaluate._average_precision_at_iou has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 6 (8 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/evaluate.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eab83782bb745021eb1a6f838978eb7e0e9e961d1cbc978133b7e28e082eb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"junctionsOf (cognitive 38): junctionsOf has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 6 (8 pts), boolean chains 3 (nesting depth added 17). Of this number, 32 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f29fd76b7ce58398c35ada596265899b61e6a8f0e530ca564ca3b3beb5cf55f"}},{"ruleId":"D2","level":"warning","message":{"text":"encodeTile (cognitive 38): encodeTile has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 7 (14 pts), loops 8 (11 pts), if/else 6 (10 pts), boolean chains 3 (nesting depth added 14). Of this number, 34 points are the body\u0027s own statements and 4 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd759805dea98687071c87953f97f0feb6e2694249fd6065671d205e86ee15d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.performNativeDataSync (cognitive 37): index.html.performNativeDataSync has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 3 (8 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 16). Of this number, 36 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"9508f9ff1b06886e67e753a1c7987dee9abb9a0d997e4dd85408a9f03afe0ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.binaryAssessment (cognitive 37): standalone.binaryAssessment has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 23, ternaries 12 (14 pts) (nesting depth added 2). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c211b549614b868a8238bfe67bec86e5d15f39f8347dd51cdf05fe0370468ff"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadEventMatch (cognitive 37): standalone.roadEventMatch has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 15, if/else 13 (14 pts), ternaries 7 (8 pts) (nesting depth added 2). Of this number, 36 points are the body\u0027s own statements and 1 belongs 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce218383d4c494f07eabd718302b6477a120c3c77fc7e8347da7d2aba05e9410"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.openOfficialHandoff (cognitive 37): standalone.openOfficialHandoff has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 15, ternaries 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cdcfa85c1cbd266444368b377c7f9f4ebc99ff9f572c5312649cefb35e8755"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.performNativeDataSync (cognitive 37): index.html.performNativeDataSync has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 3 (8 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 16). Of this number, 36 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":"android-app/www/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"405a98cb836ebc201c1b1a4658218102180bcbf6cbbfab6020e273c163662303"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.binaryAssessment (cognitive 37): standalone.binaryAssessment has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 23, ternaries 12 (14 pts) (nesting depth added 2). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a05c5852e3667297ddd4cffa30e6e54e839b656810d3a079b1c58386f195c4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadEventMatch (cognitive 37): standalone.roadEventMatch has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 15, if/else 13 (14 pts), ternaries 7 (8 pts) (nesting depth added 2). Of this number, 36 points are the body\u0027s own statements and 1 belongs 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":"android-app/www/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"129235e43e7bf8b0ab1bc4866420ea8d5b9b3cfa3a53e074fd1bb0b50ecd32af"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.performNativeDataSync (cognitive 37): index.html.performNativeDataSync has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 3 (8 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 16). Of this number, 36 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":"docs/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"8321e4a26faa818d0993447bffe1df2349dfdc74737170c6677529182f0718ed"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.binaryAssessment (cognitive 37): standalone.binaryAssessment has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 23, ternaries 12 (14 pts) (nesting depth added 2). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46bd62c98acf13a71c70ff8edde06b5476835e910504b048805e146d95f4ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadEventMatch (cognitive 37): standalone.roadEventMatch has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 15, if/else 13 (14 pts), ternaries 7 (8 pts) (nesting depth added 2). Of this number, 36 points are the body\u0027s own statements and 1 belongs 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":"docs/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9e3c51d14b04984a02320999527f65eb1b97a2989754944067bda0eb5dfdf8"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.openOfficialHandoff (cognitive 37): standalone.openOfficialHandoff has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 15, ternaries 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"e063acd01bb37894f3a0999a054867cbf337d7b18372675f07879809e27a9564"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.performNativeDataSync (cognitive 37): index.html.performNativeDataSync has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 3 (8 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 16). Of this number, 36 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":"static/index.html"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee3a27d95cbd625791e4a8b2c3c55c890091f635ecdf2d0be1e5299348a57f6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.binaryAssessment (cognitive 37): standalone.binaryAssessment has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 23, ternaries 12 (14 pts) (nesting depth added 2). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"334df2fc3b116ac371da962f17bd5bfc5608879d0b63de0c3e54f90093ad2ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadEventMatch (cognitive 37): standalone.roadEventMatch has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 15, if/else 13 (14 pts), ternaries 7 (8 pts) (nesting depth added 2). Of this number, 36 points are the body\u0027s own statements and 1 belongs 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":"static/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f7d36d8c2c1c077520904db70b82f95cca1d7eefd4ca87f81527f81cefe561"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.scheduleCriticalCameraRecovery (cognitive 37): DriveForegroundService.scheduleCriticalCameraRecovery has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"137fa6d3a01af6a1c97beb47f1be0f747fbb6a151f07dd9b5268b747f0d6cb44"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDriveCameraManager.finalizeVideoSegment (cognitive 37): NativeDriveCameraManager.finalizeVideoSegment has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce749c916b920dfd02daaab38bd9b3a752cf2449fd9f583a32b64ec97b060b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.markdown (cognitive 37): evaluate.markdown has cognitive complexity 37 (threshold 15). Drivers by points: loops 14 (25 pts), ternaries 2 (7 pts), if/else 2 (5 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/evaluate.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"30519fd6f19e5597743883b6508da6f112546fffa4d0413ea4f2606b536e2a06"}},{"ruleId":"D2","level":"warning","message":{"text":"Area.constructor (cognitive 36): Area.constructor has cognitive complexity 36 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 4 (16 pts), boolean chains 1 (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"640d64fab2bce3d3d5e469d09d1dc302a88082e1aae951b9834ff85b5513238a"}},{"ruleId":"D2","level":"warning","message":{"text":"generatedComplaintOutputs (cognitive 36): generatedComplaintOutputs has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 29, ternaries 4 (5 pts), if/else 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c5e2e0731f6af8208fd936f2c58c2c16fb14298665a58b6b995530618318d2"}},{"ruleId":"D2","level":"warning","message":{"text":"generatedComplaintOutputs (cognitive 36): generatedComplaintOutputs has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 29, ternaries 4 (5 pts), if/else 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27bed89ec85e574b0a7b26e45a434fbddc1f0eed56db8a33f73ad13a884f8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateMunicipalCityPayload (cognitive 35): standalone.validateMunicipalCityPayload has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 12, ternaries 1 (3 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad219556193b2f504d7ba3ebbba509c392bab3e5876bea9976b605dfa260e3ea"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.normaliseTenderMatch (cognitive 35): standalone.normaliseTenderMatch has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 27, ternaries 6, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb9b62e3f85b414f77964cd5a5f19d55e38bc06db3caed8160938f02b0781f3"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateMunicipalCityPayload (cognitive 35): standalone.validateMunicipalCityPayload has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 12, ternaries 1 (3 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":"docs/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad722ecc3c0f9dc29d338041902ab12968ceabe3a281f5db069afb7d2638af2"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.normaliseTenderMatch (cognitive 35): standalone.normaliseTenderMatch has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 27, ternaries 6, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d20cfffd6bc586bf4da206e6411f9715165585d47342c21ec3860ca99bee4f"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateDetector.roadEventMatch (cognitive 35): DuplicateDetector.roadEventMatch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 9 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DuplicateDetector.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f13e4b9a41d1e176bf81c81bc4d71e9f3063861951e269c10229fc12e50569d"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDriveCameraManager.processImageProxy (cognitive 35): NativeDriveCameraManager.processImageProxy has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 5, error handling 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f321d312c3c3ec9aa79dbdecfed2149d6b6cb5244807e36a45401027c2a2e6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.generatedComplaintOutputs (cognitive 34): standalone.generatedComplaintOutputs has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 29, ternaries 3, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e536590255f83311131ce5992917a71ffb7fbe38c9f29d692e9591ea3f1d0cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.generatedComplaintOutputs (cognitive 34): standalone.generatedComplaintOutputs has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 29, ternaries 3, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dd7eea4037c9704a162a0728499a74b302371e516a614506edfcd2e46dc825"}},{"ruleId":"D2","level":"warning","message":{"text":"index.reportCandidate (cognitive 34): index.reportCandidate has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 16, if/else 12, ternaries 6. 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":"server/src/index.js"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ca8b53f862801490f34c6ee8bd51ebe0b970948b3a2258e85d08242a0a2ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval._validate_source_manifest_for_receipt (cognitive 34): exhaustive_video_eval._validate_source_manifest_for_receipt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 11, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab1a9e007737bdb9079652ef43bdc83dbb00e79f754bb69025ac584dc201410"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval._accepted_clusters (cognitive 34): exhaustive_video_eval._accepted_clusters has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (6 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"4995c78c45e94fe4c06f67dd72eafe6f1260428f8a7642e7f031dff59b181db5"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval.main (cognitive 34): exhaustive_video_eval.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fa3aae69dbf8d2a772262abfc5348718ffbff7a294bb63c0d8651c0dc6d6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"createDetector.yolo (cognitive 34): createDetector.yolo has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, ternaries 4 (7 pts), error handling 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":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b5f25064e819f0eca4bacb1c6a51f7e9d125b2934d1706102d4c999aa929ad"}},{"ruleId":"D2","level":"warning","message":{"text":"build-india-localities.loadStates (cognitive 33): build-india-localities.loadStates has cognitive complexity 33 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (11 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 20). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3462fb218c29e0420ee039818c24789e6f50f0e64e992c4c2d45ed18c21c4a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.prepare (cognitive 33): build-street-index.prepare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (9 pts), boolean chains 4 (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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4af92e439e997986efb3de5bc0ab67a75fd8bfbb606d82a8b7163339b17558"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveModeService.driveTick (cognitive 33): DriveModeService.driveTick has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 5, error handling 5, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ec049d56238d89de8f7c02544416c1699dc4ce1101a7dffcb5009fa482d8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"detector.load_and_validate_manifest (cognitive 33): detector.load_and_validate_manifest has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22, boolean chains 9, error handling 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c302b39d9248808436ca62743c9222f72c782f3728e799177a56f575ffc938b4"}},{"ruleId":"D2","level":"warning","message":{"text":"webview-drive-analyse.main (cognitive 33): webview-drive-analyse.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (7 pts), boolean chains 4, error handling 2 (4 pts), ternaries 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":"tools/harness/webview-drive-analyse.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74fd9ebfb6faf99e767a159251ed8318e0ecdcb304648fba84285b4e068c660"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzeImage (cognitive 33): analyzeImage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 8, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 10 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":"static/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ea3381cea305c0f16521c5ead6e0b4a83666529087a4c6a3526d3a970b6a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeRepairEvidence (cognitive 33): decodeRepairEvidence has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 15, if/else 9 (11 pts), error handling 4 (7 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbff2d93eb076239fe77539576c3bf9dc4c4d8cf5c6be23003d72ce250606789"}},{"ruleId":"D2","level":"warning","message":{"text":"highwayContractCandidates (cognitive 33): highwayContractCandidates has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 12, loops 3, ternaries 1 (2 pts) (nesting depth added 8). Of this number, 27 points are the body\u0027s own statements and 6 belong to 10 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":"static/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed7f8ab44c33c5c1c23fde1dd6c4355e6b36dfbfb7904edbe76a91a134b4ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzeImage (cognitive 33): analyzeImage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 8, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 10 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":"android-app/www/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f46926ebf3af96ab7f39c131501c79c9cfca7e6dfacef5b8e3eb57a0792c31"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeRepairEvidence (cognitive 33): decodeRepairEvidence has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 15, if/else 9 (11 pts), error handling 4 (7 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b59e7dba00bd4abe56dc2f95c4d42247d78eb98df89a52b54ac58441a532ca"}},{"ruleId":"D2","level":"warning","message":{"text":"highwayContractCandidates (cognitive 33): highwayContractCandidates has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 12, loops 3, ternaries 1 (2 pts) (nesting depth added 8). Of this number, 27 points are the body\u0027s own statements and 6 belong to 10 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":"android-app/www/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"813be6000883c3763474137fc50d7af456260568a13473a82d86d13162ea024a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.decodeRepairEvidence (cognitive 32): standalone.decodeRepairEvidence has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (11 pts), error handling 4 (7 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd176d349b6c320a48082fc501e38e050df0cd9110c232670aaf363e3e2cc83"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.decodeRepairEvidence (cognitive 32): standalone.decodeRepairEvidence has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (11 pts), error handling 4 (7 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":"docs/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3300ed5e72dbec34e3785b1aa33704999999a569dc2aaf8b0e2909bef0e263"}},{"ruleId":"D2","level":"warning","message":{"text":"detectors.createDetector.yolo (cognitive 32): detectors.createDetector.yolo has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, ternaries 4 (7 pts), error handling 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3619b04cf402ed3f0ed195c974129b555e0ea7ababa7a97eae2599f47ef612"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-local-address.sample (cognitive 32): verify-local-address.sample has cognitive complexity 32 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 6 (8 pts), boolean chains 7, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 13). Of this number, 30 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ce767f460705ba567c7d653dc88beabb6f5ca88932530c24826d4544589e23"}},{"ruleId":"D2","level":"warning","message":{"text":"index.callOpenAI (cognitive 32): index.callOpenAI has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 9, if/else 9, error handling 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3581418084acd408bf8994bb3bc38e31f5085131ec7267a24580142f427d7777"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDeduplicationEngine.checkAndCommitReport (cognitive 32): NativeDeduplicationEngine.checkAndCommitReport has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3bf953ccc58c747b9480030277695f704d51a26b1fb31f9fff98d078b4508e"}},{"ruleId":"D2","level":"warning","message":{"text":"run_rad_eval.main (cognitive 32): run_rad_eval.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (21 pts), ternaries 4, loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_rad_eval.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd69f314c1cfe375ee169b6d91188e1d5654170f87c2273d357fdc9aae1c94f0"}},{"ruleId":"D2","level":"warning","message":{"text":"createService::detect (cognitive 32): createService::detect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 10 (11 pts), boolean chains 6, error handling 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7221908ebf66cb20ee2e70b4a1facf1ebea1180410505c5dda8c7e0048494dd"}},{"ruleId":"D2","level":"warning","message":{"text":"averagePostcodes (cognitive 32): averagePostcodes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 7, ternaries 2 (4 pts), loops 3 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 2 belong to 5 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6128b3f6fb6615d3497636d81b93e2b0e7f87aebb0f9ef9babe29b6bed6d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.drainSSE (cognitive 31): standalone.drainSSE has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 2 (7 pts), boolean chains 3, 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33a9b0afb77da7584e03d45838bd8d5179b60e6ff374afab3b2367884bc21f4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.analyzeImage (cognitive 31): standalone.analyzeImage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 8, ternaries 1 (2 pts), error handling 1 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 10 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"786c837f9461bdcae02f22e9502dd826f7beea59971ed89058461b483dbabe2b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.drainSSE (cognitive 31): standalone.drainSSE has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 2 (7 pts), boolean chains 3, 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":"android-app/www/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c11b5bff5d770250d0b20c0c1aa6b823b3d8fba7667c331a7d86503b6132b79"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.drainSSE (cognitive 31): standalone.drainSSE has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 2 (7 pts), boolean chains 3, 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":"docs/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2d89e90ac47ebc79ac90b9b43cb2fa45105463e00067eef226940ce595ce7a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.analyzeImage (cognitive 31): standalone.analyzeImage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 8, ternaries 1 (2 pts), error handling 1 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 10 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":"docs/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"48787c728ad0bccd6bd7a5e1d61406c40c5be9aae9ac2e9feed871159d03cc74"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.drainSSE (cognitive 31): standalone.drainSSE has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 2 (7 pts), boolean chains 3, 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":"static/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39ac9d918b4ab4abeddedca0f461bdd053f7b5ec55011c93d1ef1c97979c84a"}},{"ruleId":"D2","level":"warning","message":{"text":"rad_dataset.list_remote_inventory (cognitive 31): rad_dataset.list_remote_inventory has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/rad_dataset.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c36705b419ee886b0b1d284ada6a0a0a269831044665c74aa17ae0b785c66f2"}},{"ruleId":"D2","level":"warning","message":{"text":"separateRoadResponsibility (cognitive 31): separateRoadResponsibility has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 17, ternaries 13, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec87839da7c0e6f5b8b6c500f745fcd14a65614b6c5165fd52e305c8f4ad5b81"}},{"ruleId":"D2","level":"warning","message":{"text":"validateHighwayContractPack (cognitive 31): validateHighwayContractPack has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 25, if/else 3 (5 pts), loops 1 (nesting depth added 2). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c3c0eca8f01d12e63ad423c04768070084290527ea6f7911cd4f8a53914d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"separateRoadResponsibility (cognitive 31): separateRoadResponsibility has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 17, ternaries 13, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2d584589b33d7463e9efe7092eecb386dcdb922646283564a14481f72c25af"}},{"ruleId":"D2","level":"warning","message":{"text":"validateHighwayContractPack (cognitive 31): validateHighwayContractPack has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 25, if/else 3 (5 pts), loops 1 (nesting depth added 2). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"99beac6ab423024b7f18818afd3a412f22710d9e1cde7c180c9aebca8ab0ce66"}},{"ruleId":"D2","level":"warning","message":{"text":"buildSnapshot (cognitive 31): buildSnapshot has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 7 (10 pts), boolean chains 5, other 3, loops 1 (nesting depth added 4). Of this number, 23 points are the body\u0027s own statements and 8 belong to 15 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef801d0aca4312df019526d7491999ae4b0fd49781da004d816dd0d745a99d0"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.matchHighwayTile (cognitive 30): standalone.matchHighwayTile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 11, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd21dc8864e91925da4eab4fdec2d96ca0205a397b95f4c0c0e9916e1b73341"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cognitive 30): standalone.addReportUnlessDuplicate has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 19, if/else 5, error handling 2 (3 pts), ternaries 3 (nesting depth added 1). None of this is in the body itself: all 30 points belong to 11 function literals inside it that branch (lines 8785, 8761, 8858, \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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef51a3dcb4594dd65542b85a7200179179493024eb6fa26a8d95ee79386c4fe"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.highwayContractCandidates (cognitive 30): standalone.highwayContractCandidates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 11, loops 3 (nesting depth added 7). Of this number, 26 points are the body\u0027s own statements and 4 belong to 5 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af8bf90d2bb6d5fb49cae620b770fb62dbf7c917b0780211493370cea8e28aa"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.matchHighwayTile (cognitive 30): standalone.matchHighwayTile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 11, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e288469668931e9d571f42150c3e9ee80dfd7c24d8754efa1f89a3941a0afc"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cognitive 30): standalone.addReportUnlessDuplicate has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 19, if/else 5, error handling 2 (3 pts), ternaries 3 (nesting depth added 1). None of this is in the body itself: all 30 points belong to 11 function literals inside it that branch (lines 8785, 8761, 8858, \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":"android-app/www/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb737063442a52850f1841ef417e2de482831e73bdb620b433ec1707c71f699"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.matchHighwayTile (cognitive 30): standalone.matchHighwayTile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 11, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fcd9fb40c9e58a60171205ef5770c95394bfbd0e50dcbd2b47ea5f729e813a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cognitive 30): standalone.addReportUnlessDuplicate has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 19, if/else 5, error handling 2 (3 pts), ternaries 3 (nesting depth added 1). None of this is in the body itself: all 30 points belong to 11 function literals inside it that branch (lines 8785, 8761, 8858, \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":"docs/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64d54ee3179de4016a30c302a82b9a88e27428b9a84a8b604199d4a65b7c700"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.highwayContractCandidates (cognitive 30): standalone.highwayContractCandidates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 11, loops 3 (nesting depth added 7). Of this number, 26 points are the body\u0027s own statements and 4 belong to 5 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":"docs/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"896469e6f86bb5653c4cc57be6263fe5cc6bfdb309d81ca74d6e2ef2a4ec8e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"core.createService::dispatch (cognitive 30): core.createService::dispatch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 12, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (core.createService::authenticate) 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efc7564abce846be513ba98db87ce1bffbf4e226832de888248e792d165e452"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.matchHighwayTile (cognitive 30): standalone.matchHighwayTile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 11, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf5398640f72ab686acc5e415176538630387b43756b2c6976d1d541404a509"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.addReportUnlessDuplicate (cognitive 30): standalone.addReportUnlessDuplicate has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 19, if/else 5, error handling 2 (3 pts), ternaries 3 (nesting depth added 1). None of this is in the body itself: all 30 points belong to 11 function literals inside it that branch (lines 8785, 8761, 8858, \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":"static/standalone.js"},"region":{"startLine":8760}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b34765d42d8c002c0103d920d181a8467ca5f070a74ea1bae4e128c5f0947f8"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDuplicateReportOwnership.merge (cognitive 30): NativeDuplicateReportOwnership.merge has cognitive complexity 30 (threshold 15). Drivers by points: if/else 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":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"da58552279fb9829594da32061918aa5d01b6dbe0bb0b641aa586bc1907a92ea"}},{"ruleId":"D2","level":"warning","message":{"text":"signedServicePost (cognitive 30): signedServicePost has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 11, error handling 3, ternaries 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f984a436e48282d1fb2ebe52d6f6044c924f12a1fb3593723990486cb0c460"}},{"ruleId":"D2","level":"warning","message":{"text":"pruneStoredHistory (cognitive 30): pruneStoredHistory has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (10 pts), loops 2 (3 pts), ternaries 3 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 15 belong to 8 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a82d2c2cabc5f9f8e251534522807ae0d3ded483430a3e643c14c3a1b10a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"signedServicePost (cognitive 30): signedServicePost has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 11, error handling 3, ternaries 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d1c5127e6ad17d54541b177af9ef1a9f01d5851b30631d73ef070faacaaebf"}},{"ruleId":"D2","level":"warning","message":{"text":"pruneStoredHistory (cognitive 30): pruneStoredHistory has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (10 pts), loops 2 (3 pts), ternaries 3 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 15 belong to 8 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"081e335d71e1d7f547b2af997ed3525627ff235eaa6ce28048c768264f4344be"}},{"ruleId":"D2","level":"warning","message":{"text":"createLocalAddress.answer (cognitive 30): createLocalAddress.answer has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 11, ternaries 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eb024f99adeb10ba47cdf7bd0ee6e93f100c9b6fe11aef34fdf808871c80db"}},{"ruleId":"D2","level":"warning","message":{"text":"placeFromFeature (cognitive 30): placeFromFeature has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 10, ternaries 5 (6 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"924dad4354583d810e6053c3370d568d63c64604719e432a6727a4e7dd2eab59"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.signedServicePost (cognitive 29): standalone.signedServicePost has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 11, ternaries 2 (3 pts), error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"175920dab14f0d826df358b26c873f4fa0a72eadc56a355330eb0c4705ee7e24"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.signedServicePost (cognitive 29): standalone.signedServicePost has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 11, ternaries 2 (3 pts), error handling 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":"docs/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a24ceb7c1c942bb2d26252ecf6b816ddfa716e5e789851082766ac1aa47221"}},{"ruleId":"D2","level":"warning","message":{"text":"india-wards.createIndiaWards.locate (cognitive 29): india-wards.createIndiaWards.locate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 12). Of this number, 28 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":"infra/aws-central/service/india-wards.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2837413bad55bb8c65309aac29017fa444ef41d32637206f8d9f585f2e5ebe0a"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.createAddressModel.piecesOf (cognitive 29): build-street-index.createAddressModel.piecesOf has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 15). Of this number, 28 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6a2ba261e5532770d4480b23a2a1b5eec566669f6d930b771050ba97e7c1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"india-ward-coverage.measureStates (cognitive 29): india-ward-coverage.measureStates has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"858efdad8b3526670bfa39e8cfe23079c8d8ce0eb2ade059a178f038adbdb6b0"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzeViaService (cognitive 29): analyzeViaService has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (10 pts), ternaries 5, error handling 1, loops 1 (nesting depth added 2). Of this number, 27 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a7268f28534905abe5fca2e03a57c1e5642f43121ff50a09c923fcda8977f4"}},{"ruleId":"D2","level":"warning","message":{"text":"roadAgreementCandidates (cognitive 29): roadAgreementCandidates has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 17, if/else 4 (6 pts), ternaries 2 (4 pts), loops 2 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 11 belong to 13 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af73b3ac972466d7b2bb013c0789a0bec0a6d8c3aedf7029e12f0e5da25bb18"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzeViaService (cognitive 29): analyzeViaService has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (10 pts), ternaries 5, error handling 1, loops 1 (nesting depth added 2). Of this number, 27 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fb3173e6db43649983a6dafa22e41fe83479d9aa831629acdd09dd80f455a1"}},{"ruleId":"D2","level":"warning","message":{"text":"roadAgreementCandidates (cognitive 29): roadAgreementCandidates has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 17, if/else 4 (6 pts), ternaries 2 (4 pts), loops 2 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 11 belong to 13 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfdcfd0eff8cdd341ec35aab90a26cc75b231e21b9718ca404e5c70ac456e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"createIndiaWards.locate (cognitive 29): createIndiaWards.locate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 12). Of this number, 28 points are the body\u0027s own statements and 1 belongs 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":"infra/aws-central/service/india-wards.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf846a6cb7851dfb1059f95c4c1a6f53961c809a67a04931ee511ed33dc80d8"}},{"ruleId":"D2","level":"warning","message":{"text":"createAddressModel.piecesOf (cognitive 29): createAddressModel.piecesOf has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to 5 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c78f18a42a4eb1ba3651c1dcd24541a4f3549be5f0ad261fb826b6e0325ad26"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.separateRoadResponsibility (cognitive 28): standalone.separateRoadResponsibility has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, ternaries 13, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebe87b49a8516bd7f4e3605a72ef52e17b79c43b050da0659d0aa815be3082a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.evidenceForReport (cognitive 28): standalone.evidenceForReport has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (16 pts), boolean chains 6, if/else 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fead2c0a5dabf70d54fac39313ef6e3c446376374ed6f899f88c6839fbb9cab"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.evidenceForReport (cognitive 28): standalone.evidenceForReport has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (16 pts), boolean chains 6, if/else 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b71f572a57b5ec3b436f69288be12161ded6475c8109cba25bf5109ac6bc26"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.separateRoadResponsibility (cognitive 28): standalone.separateRoadResponsibility has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, ternaries 13, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9545a019e754e485ce5e587b4e911b9d325e604be77c85ec0b682de8e067d540"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.evidenceForReport (cognitive 28): standalone.evidenceForReport has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (16 pts), boolean chains 6, if/else 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aab446ff131781196b74f6c94061a6554f74e8732bd00ceffeb81ceb6294cb"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.evidenceForReport (cognitive 28): standalone.evidenceForReport has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (16 pts), boolean chains 6, if/else 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96cc9867f47031b0271dd62e4f591d9ecd1b3f14639a0a296a8a3e3c77dfbfd"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.startDriveSession (cognitive 28): DriveForegroundService.startDriveSession has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 7, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf1c54467fddf5c02edbe2b5f6deba611503a2cc7f28df13a04401b56789048"}},{"ruleId":"D2","level":"warning","message":{"text":"release.command_release (cognitive 28): release.command_release has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (26 pts), error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/release.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e40417ec3c452cc45ad72c8fc46c44f76c06dadfcb8367041ae28a5d8b06323"}},{"ruleId":"D2","level":"warning","message":{"text":"createDetector.openai (cognitive 28): createDetector.openai has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, ternaries 4 (6 pts), error handling 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9b1c2ce1794ed40e8e36e46e9bfd368a6e9d4720f2033b1239470c02c9ce30"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.analyzeViaService (cognitive 27): standalone.analyzeViaService has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (10 pts), ternaries 3, error handling 1, loops 1 (nesting depth added 2). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e77745ecb2a382353de3e7239ed83c54993e79a507d161bd5e793faa568ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.analyzeViaService (cognitive 27): standalone.analyzeViaService has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (10 pts), ternaries 3, error handling 1, loops 1 (nesting depth added 2). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"docs/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a9a8054287e5de46af92e2af05ad7bbdfc9b6cf45bd2993a091b737f9c8e10"}},{"ruleId":"D2","level":"warning","message":{"text":"detectors.createDetector.openai (cognitive 27): detectors.createDetector.openai has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, ternaries 4 (6 pts), error handling 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d8f697c61a0d4fa949566bf048428487e43d1bc5b60f2ff0c395a5ef2e8a36"}},{"ruleId":"D2","level":"warning","message":{"text":"materialize_private_eval.release_records (cognitive 27): materialize_private_eval.release_records has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (21 pts), loops 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6264f63d4f019d0c1b91e98596fef7135a3cc787274db111e3e744b15f9182ff"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.evaluate (cognitive 27): evaluate.evaluate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/evaluate.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb86dac7e98a87bf7be53c050dc5a98b38ecff120cd1fb85b54648766c3f4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.attain (cognitive 27): prepare.attain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (7 pts), boolean chains 3 (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":"ml/detector/prepare.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3251916a8ee331f730c16395d503c945956fcecca11f086a76080a5f61c9ef"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_dataset._coalesce_groups (cognitive 27): prepare_dataset._coalesce_groups has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 4 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/prepare_dataset.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac28ef2c7575cd66d7cf99e2605b1f172b92d45f3f1ce7aa6f23a00b38abf0a6"}},{"ruleId":"D2","level":"warning","message":{"text":"validateRoadAgreementPack (cognitive 27): validateRoadAgreementPack has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 17, if/else 5 (8 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2d81360385eda942d3e0488a4007154d251413fc992518f9f943832be27e36"}},{"ruleId":"D2","level":"warning","message":{"text":"validateRoadAgreementPack (cognitive 27): validateRoadAgreementPack has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 17, if/else 5 (8 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf93602d089dfe054b0432a10e9a93d38ecaf43d4adf0c09296d97d7e084dd5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cognitive 26): index.html.renderNativeDriveStatus has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 10, if/else 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf4900f32bd194a717a5ae8bcff1f5a9c2f2f2adc57ce1cb8a00376e8773d10"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.deleteAllAppData (cognitive 26): index.html.deleteAllAppData has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), ternaries 3 (4 pts), error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"975cec0b01509c12303a3b423aae893396c4f5b35b5ab9fe71606bb86e1b9872"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.oaiStream (cognitive 26): standalone.oaiStream has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"9776a28fb4a46f4c1ff74a894fc25769fcffa74eb1c43f4777dfb74a6e58e5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cognitive 26): index.html.renderNativeDriveStatus has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 10, if/else 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"912e971ea0f40c4b99d4094092f85385c71557f6332294c353d096fdc5fedbb9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.deleteAllAppData (cognitive 26): index.html.deleteAllAppData has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), ternaries 3 (4 pts), error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd018058d623b826df3b40eb43f35343956713633fe9094eddba8e51009f4624"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.oaiStream (cognitive 26): standalone.oaiStream has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"13800d3fbb5d9717a0f22e9b3a19e8ef80faaf59350d1527628794f8ae9a9e94"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cognitive 26): index.html.renderNativeDriveStatus has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 10, if/else 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2538025c48873a947143ad4bd3c0e448727145d8e1e6d15a9fcfe3fcc60278"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.deleteAllAppData (cognitive 26): index.html.deleteAllAppData has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), ternaries 3 (4 pts), error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70d11ea877f1a02cbfe74df2ade170ee1f8dd67e3f3cf989cde6d05b9e0caa6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.oaiStream (cognitive 26): standalone.oaiStream has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfdbf3d28db0f697fefdd02e65af67760848569411e075e55354ac00e86db5a"}},{"ruleId":"D2","level":"warning","message":{"text":"local-address.createLocalAddress.answer (cognitive 26): local-address.createLocalAddress.answer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 11, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d008fb9c70fa94b132afa40558b96b6833653c44fd294cb02e28eb24ae8afc06"}},{"ruleId":"D2","level":"warning","message":{"text":"india-ward-coverage.positionCheck (cognitive 26): india-ward-coverage.positionCheck has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f79a6a5def43cf34ecd051bbd6e2578fa8fe5bda08784a08ea57f6550baa5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeDriveStatus (cognitive 26): index.html.renderNativeDriveStatus has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 10, if/else 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4756e8e63fae1ae963de0d3f2d3d1bf838075aa9bca7893981424e498eca4887"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.deleteAllAppData (cognitive 26): index.html.deleteAllAppData has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), ternaries 3 (4 pts), error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9676}}}],"partialFingerprints":{"codehealthFindingId/v1":"4294a834b2735dbd49fe5d7ce3f2e19816fd7455981435bbfa96c1848200d3e6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.oaiStream (cognitive 26): standalone.oaiStream has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"06518704fadc5a93bab88eb7bc056e1cbb3f94efd67682dc30b9ca209196af4a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeRtspFrameSource.onImageAvailable (cognitive 26): NativeRtspFrameSource.onImageAvailable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5, error handling 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"717313bd7855a23aee18c5445377f66fdd08f6d2f4e6d97493b980b1865491ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveModePlugin.monitorPendingStart (cognitive 26): DriveModePlugin.monitorPendingStart has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7751ad19030249464bcc8a788cf97c6403498c5ae5e8e6a300f9049a85b2acac"}},{"ruleId":"D2","level":"warning","message":{"text":"parity.run_production_onnx (cognitive 26): parity.run_production_onnx has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 3 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/parity.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ec18681cd479233273abf93ccb08e24bf67d8400bf06cd3ffa208f82e3c448"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.hydrateThumbs (cognitive 25): index.html.hydrateThumbs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"a164fc5f7f7243b94c671434d727bda40d3db8f1f5f6597ccbcb4b8ef845b29c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedHelp (cognitive 25): index.html.unroutedHelp has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (25 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bf530fccb3e3b77bd4cb8ddc02a74568131d79ff4124ab6e8a99753d7cd690"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.hydrateThumbs (cognitive 25): index.html.hydrateThumbs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"508fed17f1767ee39b08192c9e0e333c59c79e98c0de0489e1e5291862056e6d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedHelp (cognitive 25): index.html.unroutedHelp has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (25 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"33608212d1ac1fa4d016a3e52eeaf3b945ebeb3d7c83827afbe6a378b4ae6f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.hydrateThumbs (cognitive 25): index.html.hydrateThumbs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e0e0c42ca61712a2dc4cf482fcd440aa233eb5ae7532599026ca2c180c4fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedHelp (cognitive 25): index.html.unroutedHelp has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (25 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21f08d35f5eafb5345142ed51faa528ac5f22c8f350771a11ddb6d092289f31"}},{"ruleId":"D2","level":"warning","message":{"text":"build-karnataka-geometry.ownershipBundle (cognitive 25): build-karnataka-geometry.ownershipBundle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 5 (6 pts), boolean chains 2, loops 2 (nesting depth added 6). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function item inside it that branches (kgisLayer). 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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84aaefc58e83054cbc4375e1fb542a43681fe3ab373c0d9846fbec0e5bd5410"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.lineMeetsBox (cognitive 25): build-street-index.lineMeetsBox has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"7861a8be2c8b832361d4aed4bd63f1d1067f43de693f227a2e0ea6325a16dd43"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.hydrateThumbs (cognitive 25): index.html.hydrateThumbs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59e47391cbbcfdb462b6d2d6ee5d0bda6f9221c447aae47f78e0d0b11f297f7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedHelp (cognitive 25): index.html.unroutedHelp has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (25 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66889b9afc74ed46d7c259ca4cb752c34179109b3a4531b152ff6d80452e5d2"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveModePlugin.startDrive (cognitive 25): DriveModePlugin.startDrive has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (24 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2782cc1707b447e0ed047cf3d010730aa6202715469dd7a63c7f4a6bd25638d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rad_dataset._download_one (cognitive 25): rad_dataset._download_one has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, error handling 2, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/rad_dataset.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51fab48f8344d665d7bc3b0e448ca07ecdc61c88cb340a489c517761f65c960"}},{"ruleId":"D2","level":"warning","message":{"text":"datasets.main (cognitive 25): datasets.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/datasets.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"252b134c0ba0f55ba18e2f210788ac54feb8f3c6e2ce2615361d8fdd8938193c"}},{"ruleId":"D2","level":"warning","message":{"text":"finetune.main (cognitive 25): finetune.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (5 pts), ternaries 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/finetune.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c8613fd1cc41c4b7edf8656ee007784d65b42b1fb783139cbe84a3bfcae0bf"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_dataset._parse_audit (cognitive 25): prepare_dataset._parse_audit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6, 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":"ml/yolo/prepare_dataset.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1308756be51394ba52fb65231580d10cf3ffd3e0453de7bc7acf2a27cf70e639"}},{"ruleId":"D2","level":"warning","message":{"text":"release.verify_prediction_split_coverage (cognitive 25): release.verify_prediction_split_coverage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 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":"ml/yolo/release.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d2b74c969f0dd6e04bbd5b93459c2b83741bd632f4301bd4089f851a3d5609"}},{"ruleId":"D2","level":"warning","message":{"text":"tenderFromService (cognitive 25): tenderFromService has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (9 pts), error handling 2, ternaries 1 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"edef93537b0774f851e4fb46ac9fa40832861687cc6f07f20b95e2e8a0c707c8"}},{"ruleId":"D2","level":"warning","message":{"text":"tenderFromService (cognitive 25): tenderFromService has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (9 pts), error handling 2, ternaries 1 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68094a8b6cf6e94bbb8db616e64a7ec87cc0e1d6dbd52d60ce5695a78cdcdba"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.watchForFix (cognitive 24): index.html.watchForFix has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (7 pts), boolean chains 4 (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"02daebd2985d4115e41972165d8931cb2266819d37d8f9cec0092d9acc3d215b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleAppBack (cognitive 24): index.html.handleAppBack has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c86aa3dd526c06cb5c4b8bec5e3244757eceb9fcace4dac5b1f1f8bda4ede85"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cognitive 24): index.html.$(\u0022setSave\u0022).onclick has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 5 (7 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1869f7ea9203c5cf6a1c9a14f1654875f77bd17f32c4fa28942ac1adbfabc9"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.authorityRoute (cognitive 24): standalone.authorityRoute has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 16, ternaries 5 (8 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca365a0352657f45d7b0980c9052bba14c4a16335b169db4548f6e5ff529e74"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.watchForFix (cognitive 24): index.html.watchForFix has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (7 pts), boolean chains 4 (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a94a1b02e2acec6c37428343e432082cab3b41184bdbb4ae00ac9603e06211"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleAppBack (cognitive 24): index.html.handleAppBack has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"089c7a592a44437d9b9ecb887ede476c02b417dd4259d089db601c3142ad431b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cognitive 24): index.html.$(\u0022setSave\u0022).onclick has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 5 (7 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a2a14c73159355a20104df958a3d74baa5022b67eb2892ad3694e14d5425d0"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.authorityRoute (cognitive 24): standalone.authorityRoute has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 16, ternaries 5 (8 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4ecfcf69ca8031a8b390ca5cb9239fa0e806223644fdbaf113b0959610d89b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.watchForFix (cognitive 24): index.html.watchForFix has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (7 pts), boolean chains 4 (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"666ce2d4b1e312973bb4017d7061d8b13a1747b345766d8682bc42a8edae4062"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleAppBack (cognitive 24): index.html.handleAppBack has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f999e7757843f9217a2bd2f28a142bab48e36f110c9619a1d16eab6492b3d4a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cognitive 24): index.html.$(\u0022setSave\u0022).onclick has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 5 (7 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"661c2d0b7dfbcafb9131af9d3d0bc208f2f098396d4b132810099a47dfb2a9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.authorityRoute (cognitive 24): standalone.authorityRoute has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 16, ternaries 5 (8 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa3cf86aabbb218abcd45efcdb71c3ddf1c94ccdaf7b0baafbb8c9ef496cb61"}},{"ruleId":"D2","level":"warning","message":{"text":"india-ward-tenders.namedWards (cognitive 24): india-ward-tenders.namedWards has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"62918f8d516923f3d8c4384813dec56541c2f0176c1ac32b635bb47d6d2e2368"}},{"ruleId":"D2","level":"warning","message":{"text":"rules.reportShadowScreen (cognitive 24): rules.reportShadowScreen has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 5 (7 pts), boolean chains 2, 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"724c93b3dc9732abb954bda961b9858026471ac54b27066a919cde10a2722642"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.watchForFix (cognitive 24): index.html.watchForFix has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (7 pts), boolean chains 4 (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc78d330d2b3705d5d3f1a8981c7233daf1562bd700ae6c7272e28b896643f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.handleAppBack (cognitive 24): index.html.handleAppBack has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dad1346b7d6f9da6b84cb884e3afe53bad5a5dbe629889cc6fbd9aacba5fe21"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.$(\u0022setSave\u0022).onclick (cognitive 24): index.html.$(\u0022setSave\u0022).onclick has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 5 (7 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"603abcbe7cb5ae4edfee6539ed7b07dd2c929dd45e38e9e92487e3b95aedbe0c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.authorityRoute (cognitive 24): standalone.authorityRoute has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 16, ternaries 5 (8 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a18de1c875c2da8567cb7b40486e7f041af24302b407c23caf7ee522b4a06aa"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.dispatchStatus (cognitive 24): DriveForegroundService.dispatchStatus has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cd487b6fdef8a333f39130ff2b0c5f825b4bd8025c19fb0e903aa0e4415b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"detector.validate_release_bundle (cognitive 24): detector.validate_release_bundle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, error handling 3 (4 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e24d4ded9dd7c0c00059504c306ed426023f3461fa5de50a548533071fb749"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_dataset.build_dataset (cognitive 24): prepare_dataset.build_dataset has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 5 (8 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/prepare_dataset.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"244719c73c3c1b9e87ef2bec20fdc1438e3cfcf418d82043f3eba1ba7566c2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"validateHighwayManifest (cognitive 24): validateHighwayManifest has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8d53dce4cfa9c902d3d882d0c8448071fe688bdd292b892440b7570c25d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"verifiedContractForComplaint (cognitive 24): verifiedContractForComplaint has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 20, if/else 4. Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, 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":"static/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2469daa16702b5c4434d69a41ed9988686cb2c6f74dd7757a7dc8fc4ed71bc"}},{"ruleId":"D2","level":"warning","message":{"text":"resumePendingDetections (cognitive 24): resumePendingDetections has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (7 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 9556, 9557, 9565, \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":"static/standalone.js"},"region":{"startLine":9554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1db70fb59046e123ce62a81cc4bd020804e170ad513e96743a29731511b4487"}},{"ruleId":"D2","level":"warning","message":{"text":"roadNoticeCandidates (cognitive 24): roadNoticeCandidates has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (6 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 7 belong to 10 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a95fb91c0eeb1739a02a4c705ccb77376ccfc04d7e97b03d70331457618726"}},{"ruleId":"D2","level":"warning","message":{"text":"validateHighwayManifest (cognitive 24): validateHighwayManifest has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e5b2531e587cb09639ce63ea4a4a76fdb2c071575d3fdca0fd14e148861b74"}},{"ruleId":"D2","level":"warning","message":{"text":"verifiedContractForComplaint (cognitive 24): verifiedContractForComplaint has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 20, if/else 4. Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"539796f87a61b241f457b1c32143e059510078fec50554ef27752856eccef726"}},{"ruleId":"D2","level":"warning","message":{"text":"resumePendingDetections (cognitive 24): resumePendingDetections has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (7 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 9556, 9557, 9565, \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":"android-app/www/standalone.js"},"region":{"startLine":9554}}}],"partialFingerprints":{"codehealthFindingId/v1":"543bfe19689ff25f9fbe5248860c409ee0e713c098ba6198b0715253c35202df"}},{"ruleId":"D2","level":"warning","message":{"text":"roadNoticeCandidates (cognitive 24): roadNoticeCandidates has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (6 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 7 belong to 10 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3856d307fb0f722d97bf18a9695a389077fcfefceb0163649bc5cf6eb526bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"createCachedGeolocator.resolve (cognitive 24): createCachedGeolocator.resolve has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (7 pts), boolean chains 6, error handling 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geo-cache.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ddbf8466bbeb491978c866c2d75bd3ff4c027a612127a04ae80ff047f771e2"}},{"ruleId":"D2","level":"warning","message":{"text":"noticesOfBody (cognitive 24): noticesOfBody has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (8 pts), ternaries 2 (6 pts), 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"829b1471dd0ac964970c0043a56510f11ccc4f25051e70290081dda657f7f315"}},{"ruleId":"D2","level":"warning","message":{"text":"parseRequest (cognitive 24): parseRequest has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 11, error handling 1, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/service.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b196595873b32066184957719f8361bce3e9743315576cc9fef28b26e9df9b61"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startNativePreview (cognitive 23): index.html.startNativePreview has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe8911b3b8dbb15d15dfc883df6d5d31b9ce3de6ca4841dfc25d33a6c46b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive::finish (cognitive 23): index.html.stopDrive::finish has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, ternaries 7 (9 pts), if/else 4 (5 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"1826ec2523f0f18bc339f3a93c0528310b4a57c72ef7a0296076092fc51aad81"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateHighwayManifest (cognitive 23): standalone.validateHighwayManifest has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f36527253738e31b6e814f6bb047491b250fbb36b6074a609b1fb6f3533e27"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kgisJurisdiction (cognitive 23): standalone.kgisJurisdiction has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b89a8075e50e4f093a093c4bd33930cfa2e36ff5ba8166cd3bd733530668fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cognitive 23): standalone.savedMunicipalLocationMatches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ac98a34e9be79ab59edcd8d17fbf97bbedf27ab0ba7c9557cf0022cc9f9496"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startNativePreview (cognitive 23): index.html.startNativePreview has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"android-app/www/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31987be8702f502524ffcf4ca7c96eb1691be6a312324ce200b450227373671"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive::finish (cognitive 23): index.html.stopDrive::finish has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, ternaries 7 (9 pts), if/else 4 (5 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"android-app/www/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f608196ba76e96239237e15368c5bf05c6ae686c7c5a2ff197d49c94c7288c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kgisJurisdiction (cognitive 23): standalone.kgisJurisdiction has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0212857077cf2a6828dddc7e81d9dc89e10c376da4abc52da4be9ffd320a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cognitive 23): standalone.savedMunicipalLocationMatches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"262545bf86ef30a5ae78517ca17b9f3bf52332620dcc4946c9a64779a7addb8a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startNativePreview (cognitive 23): index.html.startNativePreview has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"docs/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd23c0d7da2baaaed2d6675b21eb5f56f07f18aa3df8a10ec04ea98bdd1986e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive::finish (cognitive 23): index.html.stopDrive::finish has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, ternaries 7 (9 pts), if/else 4 (5 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"docs/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6331a8f461d8d6d8cbef0217270fee3dc77abd5e25ca0ee0176fd3319709740"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateHighwayManifest (cognitive 23): standalone.validateHighwayManifest has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b5982e1f738db21dd326de4edfff0fc3f85d04e39274535e15f7b38f1097a0"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kgisJurisdiction (cognitive 23): standalone.kgisJurisdiction has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f831e2ad07853af85d5d63d79ff0adc4507abd6ec4a30f05f2f6b2e135e5538"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cognitive 23): standalone.savedMunicipalLocationMatches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac52599d55515027c5a1a7dd63b8c8cdcb47418ee1dfa8dd82f6757318a1a66e"}},{"ruleId":"D2","level":"warning","message":{"text":"Area.distanceTo (cognitive 23): Area.distanceTo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea15f56ee9d32f60bca532a3a8d59a86ab29c9030d37d16d2226906a47ecfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"CellIndex.query (cognitive 23): CellIndex.query has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee0b16c1c2980dced8869448ff72b6bbf1ea0e325aa52bd16e138e46aacbf16"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startNativePreview (cognitive 23): index.html.startNativePreview has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4478, 4523). 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":"static/index.html"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"1172e19b29fd74148be0d5405ef78b35576613f4dc253ee474798133e4abc028"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive::finish (cognitive 23): index.html.stopDrive::finish has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, ternaries 7 (9 pts), if/else 4 (5 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. This shape REPEATS in the file: one other method here (index.html.stopDrive) 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":"static/index.html"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"845beeb72de69219b2a58c52f62f01ed131101f4cab741553daed9d08b94d33a"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kgisJurisdiction (cognitive 23): standalone.kgisJurisdiction has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b702bb25383993d893e8ec509f00b8715dfd13c97dd2e734aee2c6176372181"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.savedMunicipalLocationMatches (cognitive 23): standalone.savedMunicipalLocationMatches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c384c55d23b9a4563d2f6073ee092c23253076adeb60a4775565e7ae3dc2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.persistSelectedBurst (cognitive 23): DriveForegroundService.persistSelectedBurst has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, error handling 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"551894ca5c00f574c82b087d5f03193ede02e87f2fcc75a9bc8acd180e7b6fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeRepairCandidateMatcher.selectCandidate (cognitive 23): NativeRepairCandidateMatcher.selectCandidate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRepairStatusEngine.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"637ef79cafa0b02436f9b0058b97a12e81ff6e002007577fa5b87dd61b0971ef"}},{"ruleId":"D2","level":"warning","message":{"text":"handler.parse_request (cognitive 23): handler.parse_request has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 11, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/handler.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3736568d0ff645b00cac38de3fad469168b6ebbcf68a0bb5ba4dd9e492f1aba2"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage (cognitive 23): coverage has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (12 pts), ternaries 3 (5 pts), if/else 1 (3 pts), other 3 (nesting depth added 11). Of this number, 16 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76ab6ad6a3a33c1ba34a6a75e9e1ace82784d8030009e1a44e1c1f92bb798bf"}},{"ruleId":"D2","level":"warning","message":{"text":"overlapPairs (cognitive 23): overlapPairs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 pts), boolean chains 2, ternaries 1 (nesting depth added 12). 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3e555481ae6845ccf52b3ac42b1cdd8a4676fa39dc658bcc4a29233e1dba36"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cognitive 22): index.html.updateNativeSourcePresentation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59462b89ed01089c5c7f6dc79c46713c7a1760af8b0b84493b5ba416a6067a0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cognitive 22): index.html.refreshNativeRepairTargetCache has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), error handling 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"05aa081602de167eb997c8c5fccc8e6a462209a9d701dd18896c67ddc71e8cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cognitive 22): index.html.presentNativeStoppingStatus has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 9, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5493efb4c26b22b9c710fe4cb636d17059acad363889f9101fb7d42d3244b3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drawMap (cognitive 22): index.html.drawMap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 3 (4 pts), error handling 1, ternaries 1 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47bfb86c968d9af4fbd64444c6ebb7ed0f169745771fdcaca1d3c8c76fbccb2"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cognitive 22): standalone.reverseGeocodeUncached has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 20, error handling 1, if/else 1. Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"00441d202046e18fad731ba0bdd629c9c9689fe5b9a6d28683569cec55d2f7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tenderFromService (cognitive 22): standalone.tenderFromService has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 7, error handling 1, ternaries 1. Of this number, 18 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c76ab0d7cd11184f956adf342ff57c8b2d43b7d56005da40763108804a3a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.pruneStoredHistory (cognitive 22): standalone.pruneStoredHistory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2 (3 pts), ternaries 3 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8118bc95af070fd25799239f6e79bb8ab1bc285f0920e27394ebe7195e0032d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadAgreementCandidates (cognitive 22): standalone.roadAgreementCandidates has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (6 pts), loops 2 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 10 belong to 9 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"980e821cde2ab7bf6ee08be4d88fa084d4833034f282d5bde22a0afec7fe7e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cognitive 22): index.html.updateNativeSourcePresentation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa932bf16ae85b38a15ffc88335fda222db8edda6b748fcee145ec0ce4d9266"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cognitive 22): index.html.refreshNativeRepairTargetCache has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), error handling 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba830ba89615ff1b255ab0be6d8e6d13e72fdda84add20e5226a815843e7d998"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cognitive 22): index.html.presentNativeStoppingStatus has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 9, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee94fe4a55c39f81d2ebdf523e0ba511a5f007c4f39aa5ba451dadbbf2c7bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drawMap (cognitive 22): index.html.drawMap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 3 (4 pts), error handling 1, ternaries 1 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db1fc419c5e6b3112ca6ca54136ad3e74a464926e9c0400c47727f41fd4a6ad"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cognitive 22): standalone.reverseGeocodeUncached has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 20, error handling 1, if/else 1. Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a852ebbe3d54534309c97b6036c480abdcfd403752049b4ef5a2d609275032"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cognitive 22): index.html.updateNativeSourcePresentation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79a50966c88dcf7941cdfee117ccf92fba1015b65f438bd6401973f5cbc39df"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cognitive 22): index.html.refreshNativeRepairTargetCache has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), error handling 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0bab6d5a14b1153e5f0bf1fe86193fdcc5ac1f9048db713294c5b8c9d15cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cognitive 22): index.html.presentNativeStoppingStatus has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 9, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ede47fac6cb31974848173f06fd9303e72374b5feb199012a240b939d7546f8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drawMap (cognitive 22): index.html.drawMap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 3 (4 pts), error handling 1, ternaries 1 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b34968234fe759af8f2287617953651b5a84ac90a7090c59764af834f45bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cognitive 22): standalone.reverseGeocodeUncached has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 20, error handling 1, if/else 1. Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb430539dc6d6ced0b195c8a106416b688294208b564a650518bc9846a7da00"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tenderFromService (cognitive 22): standalone.tenderFromService has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 7, error handling 1, ternaries 1. Of this number, 18 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bb5ccfe99facd4832c6553e829d7c237d0ef71f16ffc0e67dd801f5e568519"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.pruneStoredHistory (cognitive 22): standalone.pruneStoredHistory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2 (3 pts), ternaries 3 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebfe80700b050b551d78cdac900edf65e87f7b1c6db504b23618aebc14d9acc"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadAgreementCandidates (cognitive 22): standalone.roadAgreementCandidates has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (6 pts), loops 2 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 10 belong to 9 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79f6a9cba99fca21a068e35b8ad8754a42447ff47abbb32cb0397ab910e5bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"service.createHandler.handle (cognitive 22): service.createHandler.handle has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 6, if/else 3 (5 pts), error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/service.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22bfe6acf47fbcddf7e8b8deec6664e1376b2a96f970ceab40cba4afdc6d361"}},{"ruleId":"D2","level":"warning","message":{"text":"index.handleImpact (cognitive 22): index.handleImpact has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 21, if/else 1. Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3582}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbacb53dbff614b42e38709a8d90cdb6dbcaa38f8657dc1392b65886aa2eb18"}},{"ruleId":"D2","level":"warning","message":{"text":"index.dispatch (cognitive 22): index.dispatch has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 11. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"274a8d6bb518b372650aec74e69a0dba450522e20088557b9858b28fbe2461d1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateNativeSourcePresentation (cognitive 22): index.html.updateNativeSourcePresentation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cdd9d7bfb239e10013e79822fac6250cc1749d218dcc652f89b17e86a96ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.refreshNativeRepairTargetCache (cognitive 22): index.html.refreshNativeRepairTargetCache has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), error handling 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":4826}}}],"partialFingerprints":{"codehealthFindingId/v1":"486c53921efdb32a6f46b065ab94ed56a23e1bb984e070b9d302437e44efb53a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.presentNativeStoppingStatus (cognitive 22): index.html.presentNativeStoppingStatus has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 9, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51e4010244895273ba976b54ec886f704633632d323cc0aec753c4a6fc992bd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.drawMap (cognitive 22): index.html.drawMap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 3 (4 pts), error handling 1, ternaries 1 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09a927a4f6c424d49ea074712e2b9ea9e845ad84368a231deb558f3812a92e7"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.reverseGeocodeUncached (cognitive 22): standalone.reverseGeocodeUncached has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 20, error handling 1, if/else 1. Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7d54aad26f1a1e774b0822a5d7dbe0020bb4362070b03471add129325d65e4"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoImportStore.loadAndCleanup (cognitive 22): VideoImportStore.loadAndCleanup has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportStore.kt"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b06fe227ac1d69f3645ade6e05b8177374937f52a77f9a1ab4afbc3e2b300ae"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDriveLocationProvider.replaceRegistration (cognitive 22): NativeDriveLocationProvider.replaceRegistration has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, boolean chains 4, error handling 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveLocationProvider.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0513458ce5000bbe93a32fe2e47ed2ff2b9dc32eed5fde95e60e50ba0fe45bb"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeInferenceTransport.readSse (cognitive 22): NativeInferenceTransport.readSse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 3 (4 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":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d8b2f1a163debffbaa84c521612da28b271ed8220cf31214388e59a696ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval.validate_results_receipt (cognitive 22): exhaustive_video_eval.validate_results_receipt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7f41d7a773c79cd59f2ac13cb8d529cf6274acb9432c2f138ef3ecfdc931b1"}},{"ruleId":"D2","level":"warning","message":{"text":"materialize_private_eval.validate_ground_truth_manifest (cognitive 22): materialize_private_eval.validate_ground_truth_manifest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b034c6da16afd6ca53b99387f3a86747e47d31d08e61c76ff4789d21550f01"}},{"ruleId":"D2","level":"warning","message":{"text":"private_drive_corpus.validate_phase (cognitive 22): private_drive_corpus.validate_phase has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e0d3b4bc651d67d2b10f6bc5bb9dfe31cef5dc312d80c50a3f3acfd2b4b8cf"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchWithTimeout (cognitive 22): fetchWithTimeout has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, ternaries 4 (5 pts), error handling 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 4 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":"static/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec307a32a67289a5c8caf7a922791d94c13a81ea03be6a75286459c315966e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"validateRoadNoticePack (cognitive 22): validateRoadNoticePack has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (6 pts), loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f22bc23a2f1c65ee30bb7d93398e3c5867dd4dbab5ea275453be27d4f89c57"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchWithTimeout (cognitive 22): fetchWithTimeout has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, ternaries 4 (5 pts), error handling 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 4 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":"android-app/www/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f7e9b53c8a00d6d3f1aa3dfa051f469b5c23173ec89fa4683243a08b30f40a"}},{"ruleId":"D2","level":"warning","message":{"text":"validateRoadNoticePack (cognitive 22): validateRoadNoticePack has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (6 pts), loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc233c9b0840c277e0a2076975ea882eb178365bfb6318eaa4ee000bef217e4"}},{"ruleId":"D2","level":"warning","message":{"text":"recordMetrics (cognitive 22): recordMetrics has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 18, if/else 2, error handling 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a0c86ab80239aa7f7bfc1078142cb468c35573ed08abd65220ce0f7a094f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"createHandler::handle (cognitive 22): createHandler::handle has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8, boolean chains 6, if/else 3 (5 pts), error handling 2, other 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":"ml/classifier/lambda/service.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee559a2b269afbe7eb2fdfadc33d1049beea2d8e48419222e1d3c90c24d52f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.fetchWithTimeout (cognitive 21): standalone.fetchWithTimeout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 8, ternaries 2 (3 pts), error handling 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef0288f8c130d1cdda33ace1d5665c734f591822cd70cfc5ba61836c7825cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadAgreementPack (cognitive 21): standalone.validateRoadAgreementPack has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (8 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da40b8c0b28e9553080862bf6f3bfba4f2fa82476ecad608db86242cfb99821"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadNoticeCandidates (cognitive 21): standalone.roadNoticeCandidates has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (6 pts), loops 2 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 6 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d7e7de8efb97a812ddb69ba9dddf3d0dddaf2278a64ecb217194165f10d489"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.fetchWithTimeout (cognitive 21): standalone.fetchWithTimeout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 8, ternaries 2 (3 pts), error handling 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d03c3a7150c75ba8a247b7d5512427a4ffd1732fbe22c04dae1814650de97b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadAgreementPack (cognitive 21): standalone.validateRoadAgreementPack has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (8 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c883f9b2c4594ec5a6fa5bd687b2f00483b55fbfe67ee16d4455928cc529130"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.roadNoticeCandidates (cognitive 21): standalone.roadNoticeCandidates has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (6 pts), loops 2 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 6 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2759ccf428e91d99164e8489d7187b06a19122c2a54e628fbc7860a36bf39ac"}},{"ruleId":"D2","level":"warning","message":{"text":"india-ward-coverage-report.packGeometry (cognitive 21): india-ward-coverage-report.packGeometry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (walk, a function literal at line 127). 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d50587cb090c411d33ac49b041dfdda4a623e5dbc6be1ef319ece56d99824"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveForegroundService.onStartCommand (cognitive 21): DriveForegroundService.onStartCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 1 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10e0245b64d0a9bc567790d3fc9e7ac29193c9ad981b8b8e0d0f8ce2b1b82fa"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeRtspFrameSource.playerListener (cognitive 21): NativeRtspFrameSource.playerListener has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c065b8d986561c13fc8d3f2c2153dfcee81a4a5f21d2664972cbaef2c9ac534b"}},{"ruleId":"D2","level":"warning","message":{"text":"materialize_private_eval.validate_dataset (cognitive 21): materialize_private_eval.validate_dataset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42666b2598ef7d3c72c5e5bcf4837b762449261f87dc5c6f434b7eacc6b3418"}},{"ruleId":"D2","level":"warning","message":{"text":"rad_dataset._signed_file_url (cognitive 21): rad_dataset._signed_file_url has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (3 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":"eval/rad_dataset.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a42b6c90359b9f66ac5c0802f413f142566f9d3e47f60cfb3ade37e73c3dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"rad_dataset.parse_yolo_labels (cognitive 21): rad_dataset.parse_yolo_labels has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, error handling 2 (3 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":"eval/rad_dataset.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc5ddfaf028fb2130d86266aa0a7ef272845d4d79664f7d12bb348261d35728"}},{"ruleId":"D2","level":"warning","message":{"text":"run_eval.native_decision (cognitive 21): run_eval.native_decision has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d47b8a6922a6cb756b5caefcd091b8acb775f283e7af3ab0e0feaa0d357f9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"run_eval.parse_api_response (cognitive 21): run_eval.parse_api_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f8c047795888e6b92b8d528bcc519e58bfd32f02307bcb594efde1c470a4b7"}},{"ruleId":"D2","level":"warning","message":{"text":"run_rad_eval._verify_frame (cognitive 21): run_rad_eval._verify_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, error handling 1, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_rad_eval.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0247275d5d64542f1063db7cf6da133bb7b5a20827968e3a332cd7cc5e8b89b9"}},{"ruleId":"D2","level":"warning","message":{"text":"validateStatePackManifest (cognitive 21): validateStatePackManifest has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (7 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). 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, 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":"static/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb95c707791a1be3ecb213f34f963ff005340bda460ace2514acaf39a65fcc8c"}},{"ruleId":"D2","level":"warning","message":{"text":"centralPotholeRequest (cognitive 21): centralPotholeRequest has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, ternaries 8, if/else 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff18168ffdbd0261458e17db73b95229afe8a3add49c5e11de35bd3265811e88"}},{"ruleId":"D2","level":"warning","message":{"text":"retryCentralOutbox (cognitive 21): retryCentralOutbox has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 9227, 9259, 9229). 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":"static/standalone.js"},"region":{"startLine":9224}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf0c3209bd68f1d9f6d083dc17f3dd22260d166d143f3eee4521cefcac179d9"}},{"ruleId":"D2","level":"warning","message":{"text":"validateStatePackManifest (cognitive 21): validateStatePackManifest has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (7 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9cb3273e6cafcc0796f7f0117c3e30eaac89efd66abad412f63a331294f996"}},{"ruleId":"D2","level":"warning","message":{"text":"centralPotholeRequest (cognitive 21): centralPotholeRequest has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, ternaries 8, if/else 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be7c9fa7fbaf8ca774b02cac2a8ab30a1d9d6e417a939436a7a2ad7e7ddc9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"retryCentralOutbox (cognitive 21): retryCentralOutbox has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 9227, 9259, 9229). 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":"android-app/www/standalone.js"},"region":{"startLine":9224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70aed0b5557c9251262b4f53f55a305a5fdf0598187725ed577ae2984c0a062"}},{"ruleId":"D2","level":"warning","message":{"text":"verifySharedDetectionReceipt (cognitive 21): verifySharedDetectionReceipt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d857251588e5c1941f87b7df095a5493225c97e714f40c81402cd1ae4fc173"}},{"ruleId":"D2","level":"warning","message":{"text":"matchIndiaWardTenders (cognitive 21): matchIndiaWardTenders has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, ternaries 5 (7 pts), if/else 4 (6 pts), loops 1 (nesting depth added 4). Of this number, 16 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"033d8c519c57a3add7115287f281611b29da212c3bfd6234a1950c6118f8eb07"}},{"ruleId":"D2","level":"warning","message":{"text":"parseTile (cognitive 21): parseTile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (7 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b104b42fa23b2e70f6cc2bf925d89b88d1bd0bd818bef51020a71638326f384"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 21): main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (5 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 1 belongs to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/seed-tenders.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1ac23848a5540099fc1e17d8721bca1afd1d9c338dbda0cccf4788949ab37"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive (cognitive 20): index.html.stopDrive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 18, ternaries 8 (10 pts), error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"58450abf6eb8f9267e38825820184fa1ef1dadb721068e1dbaed2441764a444f"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateAuthorityRegistry (cognitive 20): standalone.validateAuthorityRegistry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"980cf33029d5bff1cbcbd554a9f05ae2e8bcc500b35b81d79ad1de58a3525e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadStatePack (cognitive 20): standalone.loadStatePack has cognitive complexity 20 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 6, boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 2918). 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b0e620ffe2826af3af8a8b701cb8e6371f7ed106369406ef00e4f178c9cdc8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive (cognitive 20): index.html.stopDrive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 18, ternaries 8 (10 pts), error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"android-app/www/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbd6dd04c6b2636d81bf8733de45997f8e987ef6d17159a4e854bdacf4d332c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateAuthorityRegistry (cognitive 20): standalone.validateAuthorityRegistry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d04937c782f7e53add95adf8fcd6c3b883efa1d56f8432f31d2623d9c012643"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadStatePack (cognitive 20): standalone.loadStatePack has cognitive complexity 20 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 6, boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 2918). 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":"android-app/www/standalone.js"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cba685a12a75bb4e4ea93bea4448fb40bcb72b2e0e878402bab12d2192927b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive (cognitive 20): index.html.stopDrive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 18, ternaries 8 (10 pts), error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"docs/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2a234aa2a34fb4d9be0649b41bb600804d2cd192f2fc7cad31016e7c7a39c7"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateAuthorityRegistry (cognitive 20): standalone.validateAuthorityRegistry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52a9c2c1d6aa4309a89601bf57e0027bc20d685b354ebfff58c46218aa4756c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadStatePack (cognitive 20): standalone.loadStatePack has cognitive complexity 20 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 6, boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 2918). 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":"docs/standalone.js"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"021bc61a7c71c7ba8408ff7f9f13fe6a962387fb41518ce74d334ebe55b8e997"}},{"ruleId":"D2","level":"warning","message":{"text":"ward-tenders.localityKeys (cognitive 20): ward-tenders.localityKeys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). Of this number, 19 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aec2375439beb15f95b9f820410c1bd02477d52999e626a3f0a0b3df6d571f9"}},{"ruleId":"D2","level":"warning","message":{"text":"geo-cache.createCachedGeolocator.resolve (cognitive 20): geo-cache.createCachedGeolocator.resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (7 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geo-cache.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bd82b3c05d70d1c206616b636635b4a4603c6a4525b315b00118d5254ce833"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-india-wards.main (cognitive 20): snapshot-india-wards.main has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 6 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). Of this number, 18 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e25459e25d22b280032820c05f5ba167a82641b86f1c369e05237ac1b2bc13b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.stopDrive (cognitive 20): index.html.stopDrive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 18, ternaries 8 (10 pts), error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (index.html.stopDrive::finish) 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":"static/index.html"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df0529196b58014474a73bbca578a66d68d08d8899656153f6fff8f520976cb"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateAuthorityRegistry (cognitive 20): standalone.validateAuthorityRegistry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69607e171d53838210c934346ad8f71546cf17e90c430be6dc49ad2242cc81b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadStatePack (cognitive 20): standalone.loadStatePack has cognitive complexity 20 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 6, boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 2918). 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":"static/standalone.js"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2067025a2da76829479bce852b0e999b2301ae420e2ce03066bc8d7fdfaee4"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoImportStore.import (cognitive 20): VideoImportStore.import has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportStore.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2addf762b09d34562e7772320d70725ce319749274eab2970ec6f9b417c66034"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval.materialize (cognitive 20): exhaustive_video_eval.materialize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), error handling 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1964cf925ed897e3a62738682ebbf64bad5188fc8aa5701860ee8aa61f2402e"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.bharat (cognitive 20): prepare.bharat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 1 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c8a6dd347e5644ae60d3f28aa56737d65c5bfafe9a7cae4eaa891e77a913b2"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.group_bootstrap_confidence_intervals (cognitive 20): evaluate.group_bootstrap_confidence_intervals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 5 (7 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/evaluate.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"570be9aaac626d6fef8e0644025a6c82a1b3ca7a75478383c08325828c0b91ec"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.command_predict (cognitive 20): evaluate.command_predict has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), error handling 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":"ml/yolo/evaluate.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0727851660fd643e2c5347cca108ef8b7da1ec80069016ce0f0f758abcfd9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"routeForIssue (cognitive 20): routeForIssue has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 4 (6 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ac3f26b5cf425f74ae83a4ce4561f74b85fc91da6727679c3470abc52a6498"}},{"ruleId":"D2","level":"warning","message":{"text":"openIdb (cognitive 20): openIdb has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 1 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 4). None of this is in the body itself: all 20 points belong to 7 function items inside it that branch ((anonymous)::onupgradeneeded, (anonymous)::onupgradeneeded::onsuccess, a function literal at line 8199, \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":"static/standalone.js"},"region":{"startLine":8198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce92019ac17d43726d5bb59173265a37d7dff4f26fc62676841bcc504ce0af24"}},{"ruleId":"D2","level":"warning","message":{"text":"completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess (cognitive 20): completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9174}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b558c1e3655d178f3e614f629e063ff260dd75f00e91b5ea100ec0dca9728b"}},{"ruleId":"D2","level":"warning","message":{"text":"matchRoadAgreement (cognitive 20): matchRoadAgreement has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, if/else 3, ternaries 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"10deb1b6570801080da972b3a01861af4921b0ab92a1dbd773c74d860d370df1"}},{"ruleId":"D2","level":"warning","message":{"text":"routeForIssue (cognitive 20): routeForIssue has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 4 (6 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f39559c74c6731475946e2f957466a89f8d4e1197181ccb8072db1346802fc"}},{"ruleId":"D2","level":"warning","message":{"text":"openIdb (cognitive 20): openIdb has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 1 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 4). None of this is in the body itself: all 20 points belong to 7 function items inside it that branch ((anonymous)::onupgradeneeded, (anonymous)::onupgradeneeded::onsuccess, a function literal at line 8199, \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":"android-app/www/standalone.js"},"region":{"startLine":8198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec3f0a09ee45355eefd862c90606b42b22c386803fde8f1ad0279c7800394b"}},{"ruleId":"D2","level":"warning","message":{"text":"completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess (cognitive 20): completeCentralRetry::(anonymous)::(anonymous)::onsuccess::onsuccess has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc178a3a0e3c0d017db3982addf44589181f33a3244f67b0646c7b1b300cdc3"}},{"ruleId":"D2","level":"warning","message":{"text":"matchRoadAgreement (cognitive 20): matchRoadAgreement has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, if/else 3, ternaries 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e667b3a1a6968e8e3a8a06478af658408897f8a8c4954de846fc723abd4b807f"}},{"ruleId":"D2","level":"warning","message":{"text":"measure (cognitive 20): measure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (7 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d675ef641bf5f147bccaa570b060c0d6b134a1650858b8bb9a111a184f89ee80"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cognitive 19): index.html.validateDashcamRtspUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5e592b9736d551538e0a379de1f66935aab35b6ff6a12542280d2aed70bdb1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::footageRowHtml (cognitive 19): index.html.renderReports::footageRowHtml has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (16 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::cardHtml) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1045e199e57771a295f219bd3d9d45109658bd24eebd00d68c19e7e701cb5470"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveLocation (cognitive 19): index.html.startDriveLocation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (3 pts), error handling 2 (nesting depth added 2). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c75e51d5a2a54406e928974a131426744dba258f81a45f79361fd8cb05979c2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.end (cognitive 19): index.html.end has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), boolean chains 3, 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83679f6a7f866d2c7d77b967ed700408ce46bfe52c36594d2370cffee5e594f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cognitive 19): index.html.renderNativeVideoImports has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 4, ternaries 3, loops 2. Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"352bc16a100a4d232403692855c64e030de2e308420ef33b93f6babddc5ab2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cognitive 19): standalone.loadHighwayContractPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53175fb69c411867997c55a253e31ad4614a2427ed2a26284802f6d50329cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadNoticePack (cognitive 19): standalone.validateRoadNoticePack has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (6 pts), loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf782c85bfb3799c243c0531217651fd947698e0f0891ec66449813a25a4d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cognitive 19): standalone.loadRoadNoticePack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf41f7603bbc5c41fc40ea2873a6ff71eb7eedeae6b1eb91992af991e1a3c11"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cognitive 19): standalone.loadRoadAgreementPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a0992f50d59dbab41318b101380a63e6d4cdf4197a971369446629d9ae0bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.verifiedContractForComplaint (cognitive 19): standalone.verifiedContractForComplaint has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, if/else 4. Of this number, 16 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1709517b13c863d9a92107006c7b993a676938ba0156c60c18758b79c976b09"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.centralPotholeRequest (cognitive 19): standalone.centralPotholeRequest has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, ternaries 6, if/else 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad7701c475274e197486f4d0cfec64fe3eb8851c250bc5b164be2b70c85a0b1"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cognitive 19): standalone.detectionEnhancementPlan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a47c5ba8bf6d3bbc40fa911858f689a383cea2cb8a64fdcbc68ba4b2347728"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.matchRoadAgreement (cognitive 19): standalone.matchRoadAgreement has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 3, ternaries 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"154d39a10ccd79e462b2d5dfb99ede8cec441960f60c0aaa0f4c9a9897e62b82"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cognitive 19): index.html.validateDashcamRtspUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc7c285b20b7dcb962cc97e0a333e4948eb359dd1e7b7803c28fbf5dce99aef"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::footageRowHtml (cognitive 19): index.html.renderReports::footageRowHtml has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (16 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::cardHtml) 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":"android-app/www/index.html"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee79fc8d5e89855f57bf6880f986d465ccd67fb1be54e6b42c8fd6bf7d553a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveLocation (cognitive 19): index.html.startDriveLocation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (3 pts), error handling 2 (nesting depth added 2). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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":"android-app/www/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b6fd46e8486b668283cac5e1bf314eab8ba49746e2cd1458ad79dd7650e6ac"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.end (cognitive 19): index.html.end has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), boolean chains 3, 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":"android-app/www/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e2b57cfa672dfa0a6d158950fba48f89a00b873345379dc88db18829db63b4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cognitive 19): index.html.renderNativeVideoImports has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 4, ternaries 3, loops 2. Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"a104049b15f37add31cce107bdc37210d9747c7024e211fde4d7c9917bede52c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cognitive 19): standalone.loadHighwayContractPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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":"android-app/www/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dffeae66342448ea2205878e0e6eac79d95ddfaa7675ee5105b1558a35d05a7"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cognitive 19): standalone.loadRoadNoticePack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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":"android-app/www/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"749796c1568a48d2b8209de5f24479d1919132bbf728a15835c206fd8f8e630f"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cognitive 19): standalone.loadRoadAgreementPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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":"android-app/www/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"217e3d52c61021542e81364d98bcdd370791247488e20a899cce98bf6b2efa4c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cognitive 19): standalone.detectionEnhancementPlan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4356d3ef063253d8fcbcb0562c7fd6af2c9bd4071b63d81b597b91906813185"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cognitive 19): index.html.validateDashcamRtspUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8081c0fc35ffe37e2d034a7140d0adea80d970341d73dfa96ec33fe772999c36"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::footageRowHtml (cognitive 19): index.html.renderReports::footageRowHtml has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (16 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::cardHtml) 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":"docs/index.html"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c43b799f191509430a5bdd112ebd4657463e6064b125c3954a25ae2bfab36c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveLocation (cognitive 19): index.html.startDriveLocation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (3 pts), error handling 2 (nesting depth added 2). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59bebd754fd68cf723217113f9d49d039b7f3ad9aa68982033130a5cce27bff"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.end (cognitive 19): index.html.end has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), boolean chains 3, 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":"docs/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf1a74583f3f7e8ccfd6eb52ed21edadf5d1cd8c415fe6a068c96348891d9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cognitive 19): index.html.renderNativeVideoImports has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 4, ternaries 3, loops 2. Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f6605a2461e5eb4261841805fb541f04b10c8772cadeaa5468b3468dec3f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cognitive 19): standalone.loadHighwayContractPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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":"docs/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb7e08a44179f45018963509446174cb01d65e9d01bdad09d8088d0ce28c7ad"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadNoticePack (cognitive 19): standalone.validateRoadNoticePack has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (6 pts), loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d415a60877005e32a7020f61e0831828d871e73c788262a1dbf1ae5e0d3e6224"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cognitive 19): standalone.loadRoadNoticePack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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":"docs/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"31709f43a1d95aab9cfdc9f4bfd2770794ba3a056f88b728060dd27c9c3e27d6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cognitive 19): standalone.loadRoadAgreementPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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":"docs/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"278ce599b9e5fd2e443f8f885d568cd1dec47131cc4554167843e6f47158b829"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.verifiedContractForComplaint (cognitive 19): standalone.verifiedContractForComplaint has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, if/else 4. Of this number, 16 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, 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":"docs/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"67796528bf9b3967e0edcbbd479f3aa6354abf67986a0606320fbcf5e73e3e25"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.centralPotholeRequest (cognitive 19): standalone.centralPotholeRequest has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, ternaries 6, if/else 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c454c274853fe4d4aacf3f54303da19bc9779eb33249b53838b10b9dff8297"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cognitive 19): standalone.detectionEnhancementPlan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c047a7417848459e306158c8c31ad19351cf5f094961885f53e90b4fe406980"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.matchRoadAgreement (cognitive 19): standalone.matchRoadAgreement has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 3, ternaries 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ac3f8e173926aced1cfdc88b632e2fb33ef3b34300f4e4c4fcc2b756b8d519"}},{"ruleId":"D2","level":"warning","message":{"text":"india-ward-tenders.bodiesOf (cognitive 19): india-ward-tenders.bodiesOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, ternaries 1 (3 pts), 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9985bf5a7604aa73874e9a90b587ace3e65ecdbe210a1127170499ec5eb026e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rules.estimateLiveRecall (cognitive 19): rules.estimateLiveRecall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b7470b2805aae6bcdab1c19df32b867065717235e5d27c2d85820328891535"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-india-wards.assembleRings (cognitive 19): snapshot-india-wards.assembleRings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7a56123ae07509b1695cff765bdfbec34244bab9e8ad4110be8cc196c4cc06"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.simplify (cognitive 19): build-street-index.simplify has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5305ced956f68704378294328c79996e34f2d013ec4c58cf99e4fd2549cb7875"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.validateDashcamRtspUrl (cognitive 19): index.html.validateDashcamRtspUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6574cf5e197773d75f1b1a69a1fe57da04753612553e3c9038e76094b38e41b4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::footageRowHtml (cognitive 19): index.html.renderReports::footageRowHtml has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (16 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::cardHtml) 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":"static/index.html"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8321f506c49d453098f74e0c3fbc5d99a04b9e5ffaa280b4dc3dca181ec28309"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.startDriveLocation (cognitive 19): index.html.startDriveLocation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (3 pts), error handling 2 (nesting depth added 2). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (probe, clear, accept, \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":"static/index.html"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"63caf5a301c917c1821ac29a830a30eb751c8424ee7ceb8884c0d2c664434962"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.end (cognitive 19): index.html.end has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), boolean chains 3, 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":"static/index.html"},"region":{"startLine":6704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd93192800d0a41b55ed4d3bd2bc96fd601969528a54dccf0a9a90e7177a087"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderNativeVideoImports (cognitive 19): index.html.renderNativeVideoImports has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 4, ternaries 3, loops 2. Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":7840}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf07975bb194612ac3237aee6a9ac95bd948a1eb1e7805f24eb67150aecc514"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayContractPack (cognitive 19): standalone.loadHighwayContractPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3181). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadRoadNoticePack, standalone.loadRoadAgreementPack) 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":"static/standalone.js"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"951c31b214322e612f6eb57d594a7524bfb80d72accc33bde1fe0e7ec02c5add"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadNoticePack (cognitive 19): standalone.loadRoadNoticePack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3436). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadAgreementPack) 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":"static/standalone.js"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5869e326bc35563afe35a37f0255c420b6345ae7e303d2fb8da348bdaa500e"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadRoadAgreementPack (cognitive 19): standalone.loadRoadAgreementPack has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3760). 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. This shape REPEATS in the file: 2 other methods here (standalone.loadHighwayContractPack, standalone.loadRoadNoticePack) 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":"static/standalone.js"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89a3b745a1d16f7daa6e069956a883f27adb0e996f38125c04ce613a4e49e95"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.detectionEnhancementPlan (cognitive 19): standalone.detectionEnhancementPlan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a12582cda42ac03cb4b051b78d9ffe79ee7a010f296e88a16067c7fe7a4a2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameQualityEvaluator.bitmapToBoundedJpegBytes (cognitive 19): FrameQualityEvaluator.bitmapToBoundedJpegBytes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/FrameQualityEvaluator.kt"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23558bf2f52d1b4bebdb91b5b4085d242f3171abded1c8e3611b30584ea3812"}},{"ruleId":"D2","level":"warning","message":{"text":"build_tender_cases.build (cognitive 19): build_tender_cases.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/build_tender_cases.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9199f1f0c8e866d3eca6ec6722fee9b0c57af6566c328b634f9c761e9f05a24"}},{"ruleId":"D2","level":"warning","message":{"text":"rad_dataset._get_json (cognitive 19): rad_dataset._get_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 3 (5 pts), ternaries 1 (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":"eval/rad_dataset.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"be480b9467255a61ac42161f51b5bd525a5b6ca4d473bb995f0573bf34964db7"}},{"ruleId":"D2","level":"warning","message":{"text":"YoloOnnxDetector._postprocess (cognitive 19): YoloOnnxDetector._postprocess has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, error handling 1 (2 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e4011f6c48b1ceed2e6908137fa9325e2865fabf7961a8d617370b2042d499"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.judge (cognitive 19): evaluate.judge has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/evaluate.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6229ed28ac15ae2917a7d3a72fb39aafab734d682b8c809b5e43f7d7d8fcbbfc"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.markdown (cognitive 19): evaluate.markdown has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (7 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/evaluate.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd4fc68276ba1e21c56ffda60b9f6cce26a1c1738dcac35670ab81ec83dd374"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.alvaro (cognitive 19): prepare.alvaro has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"221607a86f354bbf24f1210e2e53fd7e512ee3c31848f8f5ffd6df20e7cdfa4c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, error handling 1 (2 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":"static/standalone.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"732fee7cd7d66f0d3a26c7b4c9f39e7082fa3c2e72810990b388fee9d604453d"}},{"ruleId":"D2","level":"warning","message":{"text":"applyRepairObservation::(anonymous)::(anonymous)::onsuccess (cognitive 19): applyRepairObservation::(anonymous)::(anonymous)::onsuccess has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4 (5 pts), boolean chains 3 (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":"static/standalone.js"},"region":{"startLine":11101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb38f80a6347b7e3897307b196f3f3d550b0b482d52edd712d291d35cda1601"}},{"ruleId":"D2","level":"warning","message":{"text":"resumePendingRouting (cognitive 19): resumePendingRouting has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, error handling 1 (3 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 11695, a function literal at line 11697, a function literal at line 11711, \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":"static/standalone.js"},"region":{"startLine":11693}}}],"partialFingerprints":{"codehealthFindingId/v1":"6594baf4ea02e01dbf7b2d95bbcf4ff404f5ce47d98f21c132bd2d91c9ea8683"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, error handling 1 (2 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":"android-app/www/standalone.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedb7fb340fa363d86e57c7217cf538da011d60ee69300a648421092def0d2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"applyRepairObservation::(anonymous)::(anonymous)::onsuccess (cognitive 19): applyRepairObservation::(anonymous)::(anonymous)::onsuccess has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4 (5 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2b5b7e5aeeb3c9e94739d1f51848b88cc00d9e66aac5f4be06a5a274ad9566"}},{"ruleId":"D2","level":"warning","message":{"text":"resumePendingRouting (cognitive 19): resumePendingRouting has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, error handling 1 (3 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 11695, a function literal at line 11697, a function literal at line 11711, \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":"android-app/www/standalone.js"},"region":{"startLine":11693}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5b32a004b9c76227763b1ad01d9699b738977ddbc8546e208b578139e4c2af"}},{"ruleId":"D2","level":"warning","message":{"text":"crossingTurns (cognitive 19): crossingTurns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43757349fc76eacd644c66e536ca356f4d4b4eacaede5f935a3bc59e6e73d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"createAddressModel.readBack (cognitive 19): createAddressModel.readBack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca046d58a9e4ac2522b9d662013846495ce7a9156eafaec379fd56000b58e81"}},{"ruleId":"D2","level":"warning","message":{"text":"returnedPairs (cognitive 19): returnedPairs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb594bcbcfe8fb3930bf9ca914de1cb13e22d0cb9a3bcbf3df2ce2ac55b4478"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshotOne (cognitive 19): snapshotOne has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (4 pts), boolean chains 3, other 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c74b7f4b9fc400018b22a4f89b286122c58ccb2ee303bfcf39e77b5808b88c5"}},{"ruleId":"D2","level":"warning","message":{"text":"shadowScreenCurve (cognitive 19): shadowScreenCurve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 5 (7 pts), boolean chains 3, loops 2 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9559b94c5fe6796e71b403315af21a1614bace5f6ef564545906e78be494ea"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateStatePackManifest (cognitive 18): standalone.validateStatePackManifest has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d933ff103c816841b0c4839992ae404a634425d2bd122cfe28d264c5d38fa8"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateHighwayContractPack (cognitive 18): standalone.validateHighwayContractPack has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 3 (5 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf0994df2976bd9db8a4618bacf8563cb5c58f8840c976745a0e4420aa07485"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.routeForIssue (cognitive 18): standalone.routeForIssue has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 3 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"013c86eea59b00b221a798c65200a369f3ee87bd8a03bf9081ad273bcd9dd09d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.planUnreportedReminder (cognitive 18): standalone.planUnreportedReminder has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 7, if/else 2 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475426ef016c7fe921929de9bd7f9d6e1c74526d698f816f37f3a4828c0668f"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.sanitiseWardTenders (cognitive 18): standalone.sanitiseWardTenders has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6719}}}],"partialFingerprints":{"codehealthFindingId/v1":"8439032875d62f833c0353335b2567e797506b4010fbebb66808b11f5c9d15dd"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.planUnreportedReminder (cognitive 18): standalone.planUnreportedReminder has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 7, if/else 2 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"android-app/www/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"141a4b16cefe4aa4500b1e51199092c70cba3cd73ffd4ed3fdb684adb15e07f0"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.sanitiseWardTenders (cognitive 18): standalone.sanitiseWardTenders has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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":"android-app/www/standalone.js"},"region":{"startLine":6719}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cb67321dc744aa7d4f8d659bf2a86ce2def8f048376205814e7a1b14b28f70"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateStatePackManifest (cognitive 18): standalone.validateStatePackManifest has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"d398c56cb064a5c7b447adb12146789daecd51f0d14bb0ba694fa9cf72d99b11"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateHighwayContractPack (cognitive 18): standalone.validateHighwayContractPack has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 3 (5 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59596f8b30818349ddc157ba1528d061d466ba16a805ff2e95437c0cd8cf793"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.routeForIssue (cognitive 18): standalone.routeForIssue has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 3 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d2ebac9ff2b49e0c3ac7702c43662182b272d4251ceebfbf330de93f6260f6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.planUnreportedReminder (cognitive 18): standalone.planUnreportedReminder has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 7, if/else 2 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"docs/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e942605b17a1f5c44554945ec5ee9586160e6276eba0fd479fe63eb0bd19e41"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.sanitiseWardTenders (cognitive 18): standalone.sanitiseWardTenders has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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":"docs/standalone.js"},"region":{"startLine":6719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a488deee96514d48b4b0c14b8bacf1a5b941f0a3b3df04347ba286438246fdb5"}},{"ruleId":"D2","level":"warning","message":{"text":"ward-tenders.spellingDistance (cognitive 18): ward-tenders.spellingDistance has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (8 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 5 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d39dfdf584fba9ef9a030326c69add178f38d9eabfadb87a5278a5d6f83122"}},{"ruleId":"D2","level":"warning","message":{"text":"ward-tenders.placesOf (cognitive 18): ward-tenders.placesOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"950b912bc3b4c1df6d4cb61462bec2acbff1277e07d2438756e2019733e06f41"}},{"ruleId":"D2","level":"warning","message":{"text":"dynamo-repository.createDynamoRepository.takeVisionQuota (cognitive 18): dynamo-repository.createDynamoRepository.takeVisionQuota has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/dynamo-repository.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e4e7d923c0173204ac5704d9c9c7a19dc5a66f9c5797e8f293332aae684e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"local-address.search::visit (cognitive 18): local-address.search::visit has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (8 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (local-address.search) 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8a7eecc9d659ed7f55a76e78f5c16e8b0b3f30435babe7094e4918d7db2485"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-india-wards.download (cognitive 18): snapshot-india-wards.download has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"583bc9aaf0230b5ebe582ae91d5ac6c9fe2e1d49a63e7c5a822a4f9b7d69985e"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-india-wards.boxOfRings (cognitive 18): snapshot-india-wards.boxOfRings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107c293d11e21396cb2cb64b8eff2128f4e74215e9ac8e28c66574c8508e8fe"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-india-wards.stateBox (cognitive 18): snapshot-india-wards.stateBox has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a81ce3449be27ebb8df0ca290eb9bf11dc55f1f301d67ebc189586a8e6c309"}},{"ruleId":"D2","level":"warning","message":{"text":"index.prepareSharedDetection (cognitive 18): index.prepareSharedDetection has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 6, boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f8e74c5505f9ee59db76daa5e4c6f174208abcc720e1cb32241d1f190daf0e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.addressTokens (cognitive 18): index.addressTokens has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 2 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2946}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadb3792e8fb26d2bcb47307cfd889e1bd8b3598cc35eeb2a97e39139236c6c2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.candidateHasSpecificRoadIdentity (cognitive 18): index.candidateHasSpecificRoadIdentity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a586ceb98068349a341ced9d2aa2675649b9628281d538348fdd0d99fefa8017"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.planUnreportedReminder (cognitive 18): standalone.planUnreportedReminder has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 7, if/else 2 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"static/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e6a7c34ffaa8bfd6fb45383a2138e51652efbdd666c53732173b04ec50ea01"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.sanitiseWardTenders (cognitive 18): standalone.sanitiseWardTenders has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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":"static/standalone.js"},"region":{"startLine":6719}}}],"partialFingerprints":{"codehealthFindingId/v1":"798b562d368eaf110f0d26370c167823968ea04a6874d2bfa0e46e017eab81cd"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCaptureInterlock.evaluate (cognitive 18): NativeCaptureInterlock.evaluate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeCaptureInterlock.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"558439e49b53ead7bffa50b43edd8cb9aa83ae64ddff53e7d27e55687b0b0e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeOutboxKeysetPager.collect (cognitive 18): NativeOutboxKeysetPager.collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/NativeOutboxKeysetPager.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"457ee4cb7299e5b8d0b13c6a390ea7974b013cae5d71201ea8752a0fc16c148c"}},{"ruleId":"D2","level":"warning","message":{"text":"exhaustive_video_eval.require_private_artifact_root (cognitive 18): exhaustive_video_eval.require_private_artifact_root has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 4, error handling 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7983a20b7910e88485e81bd9629e075a669d636b64a71fee9e36a1595c3ab599"}},{"ruleId":"D2","level":"warning","message":{"text":"rad_dataset.parse_data_yaml (cognitive 18): rad_dataset.parse_data_yaml has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, error handling 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":"eval/rad_dataset.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5269331974ab962324d47e5164a08a6117fb0890ea8a117bd1559ba4b0fd046"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_frames.main (cognitive 18): extract_frames.main has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (6 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/extract_frames.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"09334ba5ebe004410fdbc8566b985957f367b7ce9158cc17656e5ab30300b917"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.rome (cognitive 18): prepare.rome has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 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":"ml/detector/prepare.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0af9b720fd471fa804a7f4b1e239846b445e57ef799c35a105d136a9d4c10d6"}},{"ruleId":"D2","level":"warning","message":{"text":"parity.validate_runtime_verdict (cognitive 18): parity.validate_runtime_verdict has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/parity.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad299bbdc290fa8be3b5850e1927cf4e860e7a8cc8133b6c4a8214fe472a4fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"serviceError (cognitive 18): serviceError has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, ternaries 3, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc366ad1e8518001ac5a60e9cf5de9b69a5f2db1665dcfad16e7a629a940bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"wardAnswerFor (cognitive 18): wardAnswerFor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 5). Of this number, 10 points are the body\u0027s own statements and 8 belong to 5 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":"static/standalone.js"},"region":{"startLine":6892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5b381171ab3323d38eabca13c9fc12cf670d0d30b97d21f1fdd17f36aea09a"}},{"ruleId":"D2","level":"warning","message":{"text":"footageSummaries (cognitive 18): footageSummaries has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (8 pts), boolean chains 5, if/else 2 (4 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":"static/standalone.js"},"region":{"startLine":8615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1c72a2f37e675299a9584e53a8fbd5b710a5cee965a3a0a73e463f04626255"}},{"ruleId":"D2","level":"warning","message":{"text":"serviceError (cognitive 18): serviceError has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, ternaries 3, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e029dd40d12cd11b9560fca7a24131ac5272839b29b30779651e72920e3c3b"}},{"ruleId":"D2","level":"warning","message":{"text":"wardAnswerFor (cognitive 18): wardAnswerFor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 5). Of this number, 10 points are the body\u0027s own statements and 8 belong to 5 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":"android-app/www/standalone.js"},"region":{"startLine":6892}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2bed9d66ce5625dbd58483624c5c8ad40803f9a0bb6eba1a0712d04d69fe7c"}},{"ruleId":"D2","level":"warning","message":{"text":"footageSummaries (cognitive 18): footageSummaries has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (8 pts), boolean chains 5, if/else 2 (4 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":"android-app/www/standalone.js"},"region":{"startLine":8615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f82743e5867787a079f9369213ed54f630fb91e71040a004cf525ccf2b7d7"}},{"ruleId":"D2","level":"warning","message":{"text":"createDynamoRepository.takeVisionQuota (cognitive 18): createDynamoRepository.takeVisionQuota has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 1 belongs 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":"infra/aws-central/service/dynamo-repository.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82b5a222354024aa55ac0ff83c7b747f8c323940f61705238bfbdff09fda83b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cognitive 17): index.html.renderReports::cardHtml has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::footageRowHtml) 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be1c67c8e3caaf4ea68febff9341857bbc13aad6be1dff52749540dfdac6112"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.acquireManualPosition (cognitive 17): index.html.acquireManualPosition 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"1541ef8f11c55d8405e34a145c81e801b644716dfd0915fe44212acbc7e29682"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedTitle (cognitive 17): index.html.unroutedTitle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0104b55dddc58be89dc7724495d7e32c7a81df17eedf335e2bcf52166707c06d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureVisionAvailable (cognitive 17): index.html.ensureVisionAvailable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 3). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c243dde6835940487333602cf8952d76e993470b63925d101fa0413974765e7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.recoverDriveCamera (cognitive 17): index.html.recoverDriveCamera has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), error handling 2 (nesting depth added 1). 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"697eeda14f230e2ba9f894e5152e43f397d3c011b7d190818acf39ea2700b0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.cycleClip (cognitive 17): index.html.cycleClip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 3. Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8ed4978c9f4b0514a087af59158d983f4deae9a715b7a9e20136d27e57bb0e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.publicMapPin (cognitive 17): index.html.publicMapPin has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 5, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea923bb67e46ad92f8f61104e375705276aa4395f13b9098b56c14a7f21046b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.positionWithoutAsking (cognitive 17): index.html.positionWithoutAsking has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":9063}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdf5e0a4acf35ec5debf925e41e7964d40b9205a8163ef55aa68a645aa55da6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.serviceError (cognitive 17): standalone.serviceError has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d8b7a1d5c172b0fb6183f3a810db8ec13535580667eb688b0e594e83f18887"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cognitive 17): index.html.renderReports::cardHtml has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::footageRowHtml) 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":"android-app/www/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b9638e4855b5a05718d5fa5cf1c28e6598ba1d63e73c0ca563bfbea7382304"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.acquireManualPosition (cognitive 17): index.html.acquireManualPosition 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffaa80a176af5b27039efc66aecb1674d87bf83fa6c5734cb16e24dedf463b6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedTitle (cognitive 17): index.html.unroutedTitle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"59278db12a370f7c4c35c68d74a3c2fb45ecc75f6fb9f40129b057b618ad721b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureVisionAvailable (cognitive 17): index.html.ensureVisionAvailable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 3). 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":"android-app/www/index.html"},"region":{"startLine":5179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bce8614e3cefa70632e608aeeead844c53c6cba417425485a0eba61c88ad59"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.recoverDriveCamera (cognitive 17): index.html.recoverDriveCamera has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), error handling 2 (nesting depth added 1). 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"5025a54a92ab14bdc293938d2ef21fb3847545026012aa04dc3cfaed8d2d4253"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.cycleClip (cognitive 17): index.html.cycleClip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 3. Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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":"android-app/www/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6f34732012523eaa441e7aa92eaa1017399ab645809ea87ba0ee3044c9fbde"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.publicMapPin (cognitive 17): index.html.publicMapPin has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 5, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"879159ace32323c9c3cc7d48a5c3d54ddcb0154b56e698da6693ee7720538aca"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.positionWithoutAsking (cognitive 17): index.html.positionWithoutAsking has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":9063}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96b984e41f371d78cdf51d92578943ac692c9c1442471c5118c700e4c0619d8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cognitive 17): index.html.renderReports::cardHtml has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::footageRowHtml) 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":"docs/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c8a49fcd4fc1c897b4d82fe093047e334bfb51127e75323bc63a65bf4081d3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.acquireManualPosition (cognitive 17): index.html.acquireManualPosition 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0caf38a215fc8b6240e206e42bca1b2ba7fb051a2f9bd3ec05f6dee8195f159"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedTitle (cognitive 17): index.html.unroutedTitle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5aaa26e77d794ae57af166535b8aa86aa74e61f8ca278405f679cfbe7efc51"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureVisionAvailable (cognitive 17): index.html.ensureVisionAvailable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 3). 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":"docs/index.html"},"region":{"startLine":5179}}}],"partialFingerprints":{"codehealthFindingId/v1":"523e3232cd5351e785d4b831617b67f49ed04160243d814bea1f14e28ce3987c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.recoverDriveCamera (cognitive 17): index.html.recoverDriveCamera has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), error handling 2 (nesting depth added 1). 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, 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":"docs/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a5b9b2cd421c6e4837ae5a5350c6764c390821bf34b3505390bf84db8769e9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.cycleClip (cognitive 17): index.html.cycleClip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 3. Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7cfab7df4bca50b7f053bdc55f7997839b1f0b59c76c1c4f126d6df487c8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.publicMapPin (cognitive 17): index.html.publicMapPin has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 5, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36e015a71517cf5a1afa3eca7557bf4b7b8064c88e246e87a2630d1091845fd"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.positionWithoutAsking (cognitive 17): index.html.positionWithoutAsking has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":9063}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c787beb130c9432e8d4a7077b85de989645e5fb11d3d0ca93fe501d97b4f32"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.serviceError (cognitive 17): standalone.serviceError has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"70238551c1c5a19cd01d45cb415dceb8b8233b66774b3cd0c2a03a3c58100d31"}},{"ruleId":"D2","level":"warning","message":{"text":"core.createService::authenticate (cognitive 17): core.createService::authenticate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (core.createService::dispatch) 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"74988ec40b024cd655797282e804bbc7d0635570b9ccc6d3526490d3ffbd72e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dynamo-repository.createDynamoRepository.impact (cognitive 17): dynamo-repository.createDynamoRepository.impact has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/dynamo-repository.mjs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7568cc61bef215f8575b344619896448295a861749eb81979acaba98efd658"}},{"ruleId":"D2","level":"warning","message":{"text":"local-ownership.openOwnershipBundle (cognitive 17): local-ownership.openOwnershipBundle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-ownership.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7c4319eb173906f3c084432ede53bba9851c93a1cdab0ed534965854eed2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"local-address.indexStreets::file (cognitive 17): local-address.indexStreets::file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee0f628541da5d8392c28d25a9793b29bbe2e0dcf6a4e6a1b23ab3bbc7e5135"}},{"ruleId":"D2","level":"warning","message":{"text":"local-address.createLocalAddress.tileOf (cognitive 17): local-address.createLocalAddress.tileOf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7e8fa53d61a22f0b27f31b91abc6b83e59c433e55bdda055ecda665356f525"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-india-wards.parseKml (cognitive 17): snapshot-india-wards.parseKml has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3baa1d4e64e581674ec8cd92dffd2bb8e1c24dec44021c3236621f891da9c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ownership-bundle-writer.createOwnershipWriter.finish (cognitive 17): ownership-bundle-writer.createOwnershipWriter.finish has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7069a2242744c69d490db162438a8d7aff2b6e03672f9925945ea5f23791d299"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.streetFromFeature (cognitive 17): build-street-index.streetFromFeature has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb52f20929a755e6c62fe8da1c6d59bc16d006e7586297d24ad744b0ecb28d6"}},{"ruleId":"D2","level":"warning","message":{"text":"build-street-index.createAddressModel.nearestPostcode (cognitive 17): build-street-index.createAddressModel.nearestPostcode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2, 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d785915f716f25a792ed032e1d656e0e9d469ef4cb0ef86650c4c724861067f4"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-local-address.tenders::outcome (cognitive 17): verify-local-address.tenders::outcome has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"598b4323a74328650178e1171ec3ab664cb6914e3fc18ff660b14bbb67750502"}},{"ruleId":"D2","level":"warning","message":{"text":"index.captureProvenance (cognitive 17): index.captureProvenance has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 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":"server/src/index.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf2dcbde239501612e357df8a173748a954ee86db7946cc9626bf40dbfdfdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.callHttpYolo (cognitive 17): index.callHttpYolo has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 2 (3 pts), error handling 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c8a186cb5d668d0701b439245b6351b019386a1d50bce3a46496c8b9cb5dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"index.tenderResult (cognitive 17): index.tenderResult has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 2, error handling 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: 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":"server/src/index.js"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab04fa8b1d326aa33e77f158ae79e35619df420d75958018a72e436f9c59a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderReports::cardHtml (cognitive 17): index.html.renderReports::cardHtml has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (index.html.renderReports, index.html.renderReports::footageRowHtml) 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":"static/index.html"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"41385cbfbc08c96aa17e70ba1e5b35aa3a32a0cfbc6038bd09183cae9763cb13"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.acquireManualPosition (cognitive 17): index.html.acquireManualPosition 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"456f433eef3c9e62b56b6a74d4cc7c1874b18b10e36fe74e1132b490da187cba"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.unroutedTitle (cognitive 17): index.html.unroutedTitle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a41400f3a4eed1a1ed92f7612e4d614f887e1ec4075ee9e5982b739c14b9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.ensureVisionAvailable (cognitive 17): index.html.ensureVisionAvailable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 3). 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":"static/index.html"},"region":{"startLine":5179}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aa549bca9cb50930288ff0ad2874d55caa27ec3cd1e4221dd0af65276928d1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.recoverDriveCamera (cognitive 17): index.html.recoverDriveCamera has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), error handling 2 (nesting depth added 1). 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, 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":"static/index.html"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eca9e9a78b6847cf8854e9e7578cc7f0980d5becbe97d51add4addba9c8d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.cycleClip (cognitive 17): index.html.cycleClip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 3. Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (settle, requestStop, a function literal at line 6514). 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":"static/index.html"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"deffabf4b15b265611ac09eea05cd47434e1c116c63838ff6e60f8db53d8a50e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.publicMapPin (cognitive 17): index.html.publicMapPin has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 5, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":8805}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b59b9a80ae907b2805efa57659bd3e9f954f013691d42dc9c75f3fda1a19c6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.positionWithoutAsking (cognitive 17): index.html.positionWithoutAsking has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":9063}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c78e3bb182b893795ad905c318f19f1bef89c4860a36714e44f171b44f0b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"CentralServiceClient.resolveTender (cognitive 17): CentralServiceClient.resolveTender has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 8, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/CentralServiceClient.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea31f8a6264341e6b898018418610507fd7dfa342e0d9bd4e2a17dbefb9c170"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameQualityEvaluator.scoreRoadPixels (cognitive 17): FrameQualityEvaluator.scoreRoadPixels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/FrameQualityEvaluator.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"080582132f37a2c0961b51419ebacc66788c719d8be06e424b59659672d6bfdf"}},{"ruleId":"D2","level":"warning","message":{"text":"run_eval.grouped_metrics (cognitive 17): run_eval.grouped_metrics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (5 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"8358a308e2e760ce3453a17f26122ae27c65affacc98a81bfececb2261f41566"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.irdd (cognitive 17): prepare.irdd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a83f43350e8f901404459ea3938b701ac41cb2c4e52c8a60809294bf9599ba"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate._load_predictions (cognitive 17): evaluate._load_predictions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/evaluate.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"af122576a0b2724ffe4cc988f24ac27b31f08009deccaef8ba0aa3a4bbe61b38"}},{"ruleId":"D2","level":"warning","message":{"text":"repairTargetMatch (cognitive 17): repairTargetMatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9728f660eed9b93d5664b652226a167ea939c18136e38b05e173162c6b9076b9"}},{"ruleId":"D2","level":"warning","message":{"text":"repairTargetMatch (cognitive 17): repairTargetMatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec1fba7c0fda8369c4ca2cfa99ca0afbb309ed81d1bdf535a7afefcaa2b5486"}},{"ruleId":"D2","level":"warning","message":{"text":"nearbyPothole (cognitive 17): nearbyPothole has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4, boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"236c023349653a0e7f10bde49ee98574ac8eee57aa5e7fa97d4161cb9ba212d8"}},{"ruleId":"D2","level":"warning","message":{"text":"handleMap (cognitive 17): handleMap has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (4 pts), ternaries 2 (nesting depth added 1). Of this number, 9 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3506}}}],"partialFingerprints":{"codehealthFindingId/v1":"656607c45e96a440037cc8e64ed9545c48caf5213d9d9d77ed0b27be16c9b6c9"}},{"ruleId":"D2","level":"warning","message":{"text":"createService::streetRouting (cognitive 17): createService::streetRouting has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (6 pts), boolean chains 3, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdb3b0294c6249f184c05eb19f038da4367dfe3ff0f7b66380d452a8d2c0a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"createKgisClient.verdict (cognitive 17): createKgisClient.verdict has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 6, if/else 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"290f29dcdd409ec9cd6969c265c517a983253cdf09449194aefb09d15cd6f5ad"}},{"ruleId":"D2","level":"warning","message":{"text":"createLocalAddress.tileOf (cognitive 17): createLocalAddress.tileOf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e208b274c57349823061d11806d5a989866e9e8a05dba7872f2cfe579992876"}},{"ruleId":"D2","level":"warning","message":{"text":"createAddressModel.nearestPostcode (cognitive 17): createAddressModel.nearestPostcode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2, 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"411c93f84f53f1ecf60f7d239a0f1ea7fd9c130eda94efa3c02f081bb28d8c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"createOwnershipWriter.finish (cognitive 17): createOwnershipWriter.finish has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec1effc14ed886f23c5f26b5468294b4e939c975233a18e8c1c12f3bd991fde"}},{"ruleId":"D2","level":"warning","message":{"text":"judgeIndiaWardCanary (cognitive 17): judgeIndiaWardCanary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 3 (5 pts) (nesting depth added 2). 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: 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0279d5d8d6786abd0b05222777bcb75f6dd477f08bc60f463d9f2bab53b44c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateHud (cognitive 16): index.html.updateHud has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3979464282434211520ee6883560ecba974d2d334709d90e5edf610b8bfa7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cognitive 16): standalone.validateRoadNoticeManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ccfba5786191a8b07084de76a9dfc9ad83dbeb673f348afb562f69631fa3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cognitive 16): standalone.validateRoadAgreementManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"895939362cab21b9225a3c2a9f88c7c53f905a045a080fb30707322f24f2b70d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayTile (cognitive 16): standalone.loadHighwayTile has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 5, boolean chains 2 (nesting depth added 4). 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 4035). 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a71f2308013f25287f6246a0d2047469bd3ac0c47213e88a11569e8a2e8d148"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cognitive 16): standalone.kolkataRouteFromGeocode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ebc0d9cc750b3bd7034f7d28976100a112c3489f2ce55391028cbf9e950924"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.trustedContractStateCode (cognitive 16): standalone.trustedContractStateCode has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6082}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c04dbfdad8a8a3cf34738041a430ced2b9d9eec8fefcdf136d5f10f8fef30b"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.repairTargetMatch (cognitive 16): standalone.repairTargetMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b1ab6a3c8bb186581154576dd21274bfa5986d7afc83278f6a29ed110f0392"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tendersFor (cognitive 16): standalone.tendersFor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 1 (2 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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d29f09e301c192491bca82ecafe38cfe0abcaa45cfec616e44bc89801fa08e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateHud (cognitive 16): index.html.updateHud has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fcbdbbab64e3efd9d5d0c4082513fbe42f36a4128848825ddcbad6b676c143"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cognitive 16): standalone.validateRoadNoticeManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5151748a751599a268a7233e1ea8492c502819ffc391d49d584c02cfad4d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cognitive 16): standalone.validateRoadAgreementManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"634e95bec8048cdd3fcae255e7d99eabbce20ce800a0da84d9cca4f373a97bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayTile (cognitive 16): standalone.loadHighwayTile has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 5, boolean chains 2 (nesting depth added 4). 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 4035). 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":"android-app/www/standalone.js"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a5287bdfba1e8ce293fff608de976b6032d90f93f284d8c7d5dc9fe23dd54"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cognitive 16): standalone.kolkataRouteFromGeocode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"089e7d67b87e393f1ac5cb0deafa0374f4df861da44c92caf672e68600bade5f"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.trustedContractStateCode (cognitive 16): standalone.trustedContractStateCode has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6082}}}],"partialFingerprints":{"codehealthFindingId/v1":"335b31affd1a67597f64996e56017481f94cfc17a7428cad0740572ee64de27d"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tendersFor (cognitive 16): standalone.tendersFor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 1 (2 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":"android-app/www/standalone.js"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"2283224c54828f466e44936daac99b86e0d8718abb32b876865095e862079a37"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateHud (cognitive 16): index.html.updateHud has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebdcd65c666888086b45881992ec41cb3c02c7b698f14610850c94cf0d99cab"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cognitive 16): standalone.validateRoadNoticeManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d18271394483e0291437386f2479a00cb7f558865e118e2d588a67f1852307"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cognitive 16): standalone.validateRoadAgreementManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a8ebc85aef04c35a8aaf2059a5060a9d96389254e505a5cbd92e27d202f716"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayTile (cognitive 16): standalone.loadHighwayTile has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 5, boolean chains 2 (nesting depth added 4). 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 4035). 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":"docs/standalone.js"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35fe856539cdd42904cf6d8a49a0f44a03c03d2b525ecf254c5f9bfe95efd8c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cognitive 16): standalone.kolkataRouteFromGeocode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1834302ae82ee0c487115382c9a9bdd9115b1e16c7be679753dc99a5a53a87c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.trustedContractStateCode (cognitive 16): standalone.trustedContractStateCode has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 4 (5 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":"docs/standalone.js"},"region":{"startLine":6082}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05ef3ac1068cac322c950f7f268ed8f1d26765cce6947b44d4a86cfe6255683"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.repairTargetMatch (cognitive 16): standalone.repairTargetMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3760cd5b2e65dee57ef1513ce9ce55d74601863c7873ed6a17c6e95eaad33f6"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tendersFor (cognitive 16): standalone.tendersFor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 1 (2 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":"docs/standalone.js"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a863b2052d824439b507b639086a11fe43efa293d51e3cd0176f6935f26a1"}},{"ruleId":"D2","level":"warning","message":{"text":"india-ward-coverage.gazetteerOf (cognitive 16): india-ward-coverage.gazetteerOf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8db214602425456cd07284171b20c230f5bb1f7886062b6317fc95b2e4c66eb"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-local-address.read (cognitive 16): verify-local-address.read has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 16. Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddbe3c036a5d82fa5a7f4180377527cf9abe4a282f2fc8144990cf8e2473e7f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.updateHud (cognitive 16): index.html.updateHud has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71aaaff93ee092272cabcfa482c7fa558560c0ed5a253f55847444416a64f52"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadNoticeManifest (cognitive 16): standalone.validateRoadNoticeManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eff2992262d9a381456598cf2c7a7a6cf89cd210fbc02cc78ea5fb4f5bb17c1"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.validateRoadAgreementManifest (cognitive 16): standalone.validateRoadAgreementManifest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"035f589c0e9d51cbe9f4f0194790c0eddc39220839e9a6c65a8b32c2fde55f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.loadHighwayTile (cognitive 16): standalone.loadHighwayTile has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 5, boolean chains 2 (nesting depth added 4). 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 4035). 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":"static/standalone.js"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2c4d79c02a63425850feaeb244a672300f69fb47d441d1348b8c7669d1d3f4"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.kolkataRouteFromGeocode (cognitive 16): standalone.kolkataRouteFromGeocode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"324eb62b21c6bd6e4208b836c890588d619709ff4a13cb8c84805423fe157ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.trustedContractStateCode (cognitive 16): standalone.trustedContractStateCode has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 4 (5 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":"static/standalone.js"},"region":{"startLine":6082}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e1dae7b44b7790c704ca679cb4de9d82adb992ff40cdd01002d132def55097"}},{"ruleId":"D2","level":"warning","message":{"text":"standalone.tendersFor (cognitive 16): standalone.tendersFor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 2, loops 1 (2 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":"static/standalone.js"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b528a64d8f07444ce04fcaf0a2901d1687de70d2bf5334b7b06a561968162ee"}},{"ruleId":"D2","level":"warning","message":{"text":"check-i18n.sliceObject (cognitive 16): check-i18n.sliceObject has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/check-i18n.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d737791ae1a008c3ed16971aedddf7e51ab386a4f1a08b57dbcb381ae27f13e"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveModePlugin.getStatus (cognitive 16): DriveModePlugin.getStatus has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (6 pts), match/switch 2 (5 pts), if/else 4, 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":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9ed56245fa021e738fd5c9f881d82c8f542887bbd569e68609e0df4dd655a9"}},{"ruleId":"D2","level":"warning","message":{"text":"DriveModePlugin.deleteFootage (cognitive 16): DriveModePlugin.deleteFootage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, error handling 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c025662010a455878e3a6cbc9e9bf2c21bf18d6293d8f8067f41516f963cac"}},{"ruleId":"D2","level":"warning","message":{"text":"materialize_private_eval.copy_verified_frames (cognitive 16): materialize_private_eval.copy_verified_frames has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, error handling 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":"eval/materialize_private_eval.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae785089ca554eb331b27cfa11dcbcc47367674b9b880071846188697b4eaa5"}},{"ruleId":"D2","level":"warning","message":{"text":"private_drive_corpus.discover_sources (cognitive 16): private_drive_corpus.discover_sources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b33561b2a1dea01367b0fa2618fb00809545fc4687d47a8711e10e553a2068"}},{"ruleId":"D2","level":"warning","message":{"text":"datasets.attain (cognitive 16): datasets.attain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/datasets.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba33cee4d75f77b618519cfefff460ac9618dd1b11539f147b94d76b2dce6e96"}},{"ruleId":"D2","level":"warning","message":{"text":"permission-button.main (cognitive 16): permission-button.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/permission-button.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"aead4f5a98371e8ff7c368eec3ac6738f175accea4b7f9daae0ea4d673ef6ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"loadInstallationIdentity (cognitive 16): loadInstallationIdentity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, error handling 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdceef5c54153a88a0733c5b9fcab77b773df95c9f85ec87cbc286c41ba0df0"}},{"ruleId":"D2","level":"warning","message":{"text":"matchTender (cognitive 16): matchTender has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, error handling 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"af538a5c6c29cece171a7804940cc80fb5ea4175f213f8bb3d03cd882edc4e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"matchRoadNotice (cognitive 16): matchRoadNotice has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, boolean chains 6, if/else 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":"static/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f68fb919f737916bf33e137c27b7178a65cb9c793ea7537c7d514f3944ca8b3"}},{"ruleId":"D2","level":"warning","message":{"text":"loadInstallationIdentity (cognitive 16): loadInstallationIdentity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, error handling 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1f26d5ba9b78cdcaaabba145ace303c288921f504a15518b3cfd58cb8fa464"}},{"ruleId":"D2","level":"warning","message":{"text":"matchTender (cognitive 16): matchTender has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, error handling 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"48440f667a12e37c9caed43257d308f7b9d5c89c6b4ae07a98532f738ab8b070"}},{"ruleId":"D2","level":"warning","message":{"text":"matchRoadNotice (cognitive 16): matchRoadNotice has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, boolean chains 6, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b24473f6a52d409fc61b57f5fb27c2bdbf82b5be778cd42fbbb51f41ab139b"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshotWards (cognitive 16): snapshotWards has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3, other 3, ternaries 3. None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 200, 223, 207). 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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"335324cb241acaaf8742d3b5557d8e7ffc42c4922d5908c527bffbe811fb52a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: www/standalone.js: FileTooLong \u2014 10303 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 8803 over it, 6.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa10e73601c0c178579b72d7aa2327c76524db9760e7d5b29314c380236f7a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: static/standalone.js: FileTooLong \u2014 10303 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 8803 over it, 6.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc378f77e2b2b368b1a0d9d287d6426d2e558842d52c99af748b3c2861152d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docs/standalone.js: FileTooLong \u2014 10303 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9803 over it, 20.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21846f18ca03a20844b8650c39124d9523a84bdcdbf4f37b6bb0dd2004369ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: www/index.html: FileTooLong \u2014 7255 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6755 over it, 14.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0054a1cf1ada8c9f5614b797a6edb3b2d0ac900b7aabb8ca7e21eda33f9829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docs/index.html: FileTooLong \u2014 7255 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6755 over it, 14.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ff45dbabee1d4c3ed900af56f3e724c8782ed95dbc4e6a5b776ee05b5b7cdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: static/index.html: FileTooLong \u2014 7255 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6755 over it, 14.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bbe7584f2ba311a261f0f524045e894887215de6f7df4e8aecfa6a4a787b27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: core.createService: FunctionTooLong \u2014 createService runs 788 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 688 over it, 7.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd974fb7a7a81b460ffd99334a2f293e7f8ca56091ed412275d15e9847c9565"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.js: FileTooLong \u2014 3116 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 2616 over it, 6.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efb54c2d627a73fb341d03ab8c0ff9dde43c62c9f5a803c70fe32aab07dc983"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DriveForegroundService: ClassTooLong \u2014 2221 significant lines (blank, comment-only and punctuation-only lines excluded), 75 methods. The bar is 400 significant lines; this is 1821 over it, 5.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca98faa2c1481b361ad0dfdad8ad258fc79400554f21e73dfcb4be1b147becf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DriveModePlugin: ClassTooLong \u2014 1878 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods. The bar is 400 significant lines; this is 1478 over it, 4.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"11801af11f58486293404ed956fbb0a420b3e6de647f608868ba9fba9c13706f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dynamo-repository.createDynamoRepository: FunctionTooLong \u2014 createDynamoRepository runs 461 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 361 over it, 4.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/dynamo-repository.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d59a3ec957af7fa237ac2d166762c357efd385262261b13b8e39624f2af8ff7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drive/DriveForegroundService.kt: FileTooLong \u2014 2287 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: DriveForegroundService (75-3093). The bar is 500 significant lines; this is 1787 over it, 4.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b8cbfc3513b4522407428cdde9d68bc47721c89156e572315ac6be43adf84a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.createReport: FunctionTooLong \u2014 createReport runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a26718362817a6b32655a5597e7042fe3de93fcdd7b6133d9b07440a69c0df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.createReport: FunctionTooLong \u2014 createReport runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.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":"docs/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d604b7c024e1735ac51d1ffc248d4babf9b5e8c40b8a09fa128b1cce5d63e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.createReport: FunctionTooLong \u2014 createReport runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.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":"static/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"7658a515e7a67612fc738a615992a8da1880b5d5fc3ee0fe82c43d075b8fb571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/DriveModePlugin.kt: FileTooLong \u2014 2008 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: DriveModePlugin (165-2689). The bar is 500 significant lines; this is 1508 over it, 4.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475dd6bb9cebc4243560fa3532f5d906513c326e3a197a8530c8311b136e5c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/exhaustive_video_eval.py: FileTooLong \u2014 1983 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1483 over it, 3.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35830ba7375436dc478561c1bb9aa0c36e77dde68342efd296c5a830fc2c089c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: detectors.createDetector: FunctionTooLong \u2014 createDetector runs 380 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 280 over it, 3.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0e817c7f62793d22ca4997c0d6cfe0b0930d44ccccdd22d92c2db97a3bb360"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: india-ward-coverage-report.render: FunctionTooLong \u2014 render runs 375 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 275 over it, 3.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c33fccb771acaec733a653c372ce5621552504328cd5b42349894a39922a29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DriveForegroundService.stopDriveSession: MethodTooLong \u2014 stopDriveSession runs 334 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 234 over it, 3.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8f7d25897050a24482ea09b7bc655cccd8c38bd833233b402c2688b07d05b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppDatabase.reportDao: MethodTooLong \u2014 reportDao runs 301 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 201 over it, 3.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/db/AppDatabase.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aff03ac403b04ac04963b98062a58c727c0a430bf14950e4e8c8ac9d0a9bd23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppDatabase.driveSessionDao: MethodTooLong \u2014 driveSessionDao runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/db/AppDatabase.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"616de70f7292be680fbd546407efe58bb1c400ca202597aa74052ba3df87d2cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppDatabase.centralObservationDao: MethodTooLong \u2014 centralObservationDao runs 299 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 199 over it, 2.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/db/AppDatabase.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b1cc8e1ff9255205739008dbc2f07a5e80cf8899ea60f8b55cfecba0408a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DriveModePlugin.reconcileNativeState: MethodTooLong \u2014 reconcileNativeState runs 298 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 198 over it, 2.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1cddfdf474c454d1fa28c5f102ee84fc31205ac96cb30dd1bafe132945ef6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.handle: FunctionTooLong \u2014 handle runs 284 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 184 over it, 2.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4daf761b09d852c13f95889232b577d808430f0c0a65328fdf137af78370c27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.handle: FunctionTooLong \u2014 handle runs 284 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 184 over it, 2.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"511e193d0b0c2e2d5cd8537f467ee9bf614d1f31887593e1b0e9bc3de9f04c8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.handle: FunctionTooLong \u2014 handle runs 284 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 184 over it, 2.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83a1749549e73029e65d8264c909a65845cb52226d4dc03333a54829719fc46"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DriveForegroundService: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf32d579d98da8cbe29980ae6c9db232177920357468c6add56559864ca717d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.commitReportObservation: FunctionTooLong \u2014 commitReportObservation runs 247 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaba8b82f0cf35b16a34ae5a88068723cdff2161f23cf579904a7e02567c8ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.routeOfficer: FunctionTooLong \u2014 routeOfficer runs 233 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"293c4061c65ada1e830a14b09e07567a69171ab325718881ad457dbcfc19bc6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.routeOfficer: FunctionTooLong \u2014 routeOfficer runs 233 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"0720a7f32979ef55ef2a483b9d3a2e067621058229d94dc3a3728919b973fd52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.routeOfficer: FunctionTooLong \u2014 routeOfficer runs 233 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf85e4354036c09be9a9f211c3e3618545b8c5cf36580fddb628c1d77b7b9c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/run_rad_eval.py: FileTooLong \u2014 1153 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 653 over it, 2.31\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":"eval/run_rad_eval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9ab0f608c14c82525f64f74ae8e7b6e5248568724c724542ef85a8b0b35955"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UploadWorker.doWork: MethodTooLong \u2014 doWork 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":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c780a3711cac580c9859d75876ac56cda184e479dbb3f6f7d8636adca6ff1646"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ownership-bundle-writer.createOwnershipWriter: FunctionTooLong \u2014 createOwnershipWriter runs 228 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 128 over it, 2.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":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e55c3d7e0c2ed920924e4f563e94f7c73fe969bc144935cbae59e96ab7552a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/build-street-index.mjs: FileTooLong \u2014 1130 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 630 over it, 2.26\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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1778d4c2b06aa451a90e05c26579939cbf125f470c0abf9a60c54ae5ea7bc103"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.migrateLegacyComplaintRecord: FunctionTooLong \u2014 migrateLegacyComplaintRecord runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6bd8714e46855afd99263d3d598957bef3ddf6bc1438270a9e07457fa46355"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.migrateLegacyComplaintRecord: FunctionTooLong \u2014 migrateLegacyComplaintRecord runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"385135c39b4b8b76235f4d32d68f8f28dd3dff7394c7c0d001dd21091fe5d0ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.migrateLegacyComplaintRecord: FunctionTooLong \u2014 migrateLegacyComplaintRecord runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10b3374f5acb5c9c1d6bb1035561b611eefd5d00a13bb06cdfd1ce27517dc8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.buildComplaintOutputs: FunctionTooLong \u2014 buildComplaintOutputs runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59737339a5f70aa59ad361ba2821e68b08c7e02d43942df3dc36a8bb2d241b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.buildComplaintOutputs: FunctionTooLong \u2014 buildComplaintOutputs runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"952ea3233533cd66a7931fc056406d82eecf62d81050dca17ec28a32b4ef1e7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.buildComplaintOutputs: FunctionTooLong \u2014 buildComplaintOutputs runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80bde3257861dd2ac2272df2ccbcda21dc0760af91f0fe3d33764204d7978af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: build-street-index.createAddressModel: FunctionTooLong \u2014 createAddressModel runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3cd56a44a57e2c758ac8b3fe6177f6fa4e91171a0ad06c877cb9d422f36b69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.importNativeReport: FunctionTooLong \u2014 importNativeReport runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fe6ab1a124537f52fe21a37393ffb364c47a3fe9d41394a603f23afcb4e368"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.importNativeReport: FunctionTooLong \u2014 importNativeReport runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30da1e8e0d926296b579267361c207d7c87053d8f5a23b6462b79a233bd26c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.importNativeReport: FunctionTooLong \u2014 importNativeReport runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f37a3672396f637a802e72542a4bf53c3d563b353edbad2af45f09a98bd03c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeDriveCameraManager: ClassTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 460 over it, 2.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"67323a7f81bfd19bed90bf81ad161f39dc1de4bdd97d40f55f1116127978f4cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DriveModePlugin: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ceef30aa57f15fd6435ddd123640c053f561235591ce235f195c05c7ff9fae0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/core.mjs: FileTooLong \u2014 1016 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 78% of them inside a single declaration: createService (307-1367). The bar is 500 significant lines; this is 516 over it, 2.03\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":"infra/aws-central/service/core.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4843af57b17712a899e3d800718430ef7853935d626bcd6d5d2b2502b3baa5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drive/NativeDriveCameraManager.kt: FileTooLong \u2014 911 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: NativeDriveCameraManager (63-1271). The bar is 500 significant lines; this is 411 over it, 1.82\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d086d12723ad19b3ffcb54e15b90c4aed87efec4dd2d2863a7801ca47ae4700"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/snapshot-india-wards.mjs: FileTooLong \u2014 895 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 395 over it, 1.79\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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f85ec6b9082094b5101644e9e6d56fa6a22bef88b3433566a9deb8545da3afe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yolo/prepare_dataset.py: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/prepare_dataset.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29615720f2892fff22b08d045a191a0c0e28e373431ebbe42b620996716130fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: build-street-index.buildRegion: FunctionTooLong \u2014 buildRegion runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e6a3c34fff8e5b7c2f696fa41c3de430118f360eb5f002b9144d9401c4a61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/rad_dataset.py: FileTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 308 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/rad_dataset.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd443f56b16f67ebac5071e669accd92af3c26477d616048774d831cf169310"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: geolocation.createGeolocator: FunctionTooLong \u2014 createGeolocator runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d218c9ccb95518a335e0f734f78d20c7a87720126c045c20cf8b5a43d0ad864"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.validateRoutingPack: FunctionTooLong \u2014 validateRoutingPack runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"01019e1699bab7f7b91e28a9c25856f62fedd9082161380b7c8a17655b45bd4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.validateRoutingPack: FunctionTooLong \u2014 validateRoutingPack runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"686cf291720170510f8edfba7bab612f7bfb3eaaa05d3ddfbb3f35110162ca2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.validateRoutingPack: FunctionTooLong \u2014 validateRoutingPack runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"58df09237f8eb4649a473b81b7785601b5e45ba1338028a4470fb2da6a711092"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeDriveCameraManager: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89680c632ca31f07394fa041da39592e0bd0d71e3651015662e48a96cd45d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/materialize_private_eval.py: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"845298bff41b41e56075479817f5e1ed3eae0909a81a53031ec42d80eb826a15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.installRoutingAuthorities: FunctionTooLong \u2014 installRoutingAuthorities runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbd17485fd4639984515d444aa8447942a5835ff6fcab2c76d9fc3fac3d66f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.installRoutingAuthorities: FunctionTooLong \u2014 installRoutingAuthorities runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2602c2629ddbc6f80e8608a4db2fc109592fe282cd38684cd4ad2a4231407400"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.installRoutingAuthorities: FunctionTooLong \u2014 installRoutingAuthorities runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfe0f88d11ed5cfc22e668acaaac07251f084435010dcb6f1d4b48a49feea16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/VideoImportStore.kt: FileTooLong \u2014 719 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: VideoImportStore (187-893). The bar is 500 significant lines; this is 219 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportStore.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a98f5aacfd6fc958c966d6807454ce7c4f324cab95f32ccb3ff5b91a0fd8ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DriveForegroundService.startDriveSession: MethodTooLong \u2014 startDriveSession runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebe6e9d416121876a23ac0c42bf7b24462d78f6c7f98d3b552f15bdfb2f70d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/private_drive_corpus.py: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 200 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d06692b93a6a3231a97163b68ca5d937b73719f823eaa99cf766895ae8f95f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.resolveJurisdiction: FunctionTooLong \u2014 resolveJurisdiction runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"af988f6aa1ba0995f2a0269babf7b06b5f90126e1e84f01c599a08fce04cb1bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeRtspFrameSource: ClassTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 156 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ce2330a4dd24b63ecdfb3fa47aecb15bb95162c7f3878202bcca99fbfe0197"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DriveModeService: ClassTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 141 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32feb5175fda7d38c8cc677c8aeaa1089fa8bba1df936686e9ccbea5a5cfb82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yolo/evaluate.py: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/evaluate.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e957704bf674bd14e539dede5e202cfd5b246e7d6f843a8e6f409bbbdd01d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drive/NativeRtspFrameSource.kt: FileTooLong \u2014 669 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: NativeRtspFrameSource (40-785). The bar is 500 significant lines; this is 169 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"578ae2cfd005e6df51eddbaba3a24391c135f83bdae63ae066957f8516e70d15"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VideoImportStore: ClassTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 134 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportStore.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f5784267db307b8724900aff18621badcd854b364c18a80c5998d1d78022d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeRtspFrameSource: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1337a1f5f76fe167ce01a2eda38f4d356c92a6fdb4686c96cbc103ccdf16cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: geolocation.createGeolocator.wardSnapshot: FunctionTooLong \u2014 createGeolocator.wardSnapshot 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":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88842cc5bc0301d40772cb4b400411c0d464ca668116d44ba8b84b6c4aa8785"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.openEmailDraft: FunctionTooLong \u2014 openEmailDraft runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"41096dd353515681f638b608fab01284c38a03f3b1ad47d0b2ab95700867ee49"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.openEmailDraft: FunctionTooLong \u2014 openEmailDraft runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb134475eb48775d41665e9383c31a6aeb41da9c273bffa5255783a17e35973b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: geolocation.createGeolocator.placeWard: FunctionTooLong \u2014 createGeolocator.placeWard runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6ecf6d9c4490eebb35c3129276051aba4e2578a40ca372add68be960c9eae5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: local-address.createLocalAddress: FunctionTooLong \u2014 createLocalAddress runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"df23162ca576c9985cd3b6c040cef3dd7d4cfaa2f705ec3a61aa744688f5db66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.openEmailDraft: FunctionTooLong \u2014 openEmailDraft runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a160f1e1ac17fbb3f374fb0b784efb4357b52a0a7dbae6a02a7af59777997efe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: geolocation.createGeolocator.resolve: FunctionTooLong \u2014 createGeolocator.resolve runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c512844bdc7060bafc2924f84cfe65a6fab69bc4d1b70670c36e00a5e6c7f62c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.savedOfficialRouteBinding: FunctionTooLong \u2014 savedOfficialRouteBinding runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcc8ed8c9eb8e35f5b916977c9a122f8b3b93a47bbe004d064a99e2310a5577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.savedOfficialRouteBinding: FunctionTooLong \u2014 savedOfficialRouteBinding runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"86582e5dbb324802f2a7b11ab852b89f5c50be4be6df83b0d96a9608a2a94fe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.savedOfficialRouteBinding: FunctionTooLong \u2014 savedOfficialRouteBinding runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1bc52922fe41221cc33c2b554af7edff37718399331c8eda823e6a8de9a80d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DriveModePlugin: ClassTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 103 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7011a5ceccb91334cc7f308b53519ae900533f7145519d3491f6ccb1c230a76b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PotholeDatabase.reportDao: MethodTooLong \u2014 reportDao runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/PotholeDatabase.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb95d33147b169a4ebfd49f1c84dec898ed96f648312ca9820229187b5af485"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.createCivicReport: FunctionTooLong \u2014 createCivicReport runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0593256e3c9a17b1d1fb51d2afcdaa843b90271a65cf1778025e96d1c60a575"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.createCivicReport: FunctionTooLong \u2014 createCivicReport runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"237376449a490dd094932670a313e445f3fc87769d4cee895c8e4bac8e757180"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.createCivicReport: FunctionTooLong \u2014 createCivicReport runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e16fdf36ece24394759aa86abda427c262b49482ac664e0ec824565bd7b7135"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PotholeDatabase.eventSightingDao: MethodTooLong \u2014 eventSightingDao runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/PotholeDatabase.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8e1c535b921b09a4429f98740748d3469eb3e02146c676c5f0d3d7382db0be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: build-india-localities.main: FunctionTooLong \u2014 main runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75b5bb114a0e98f0eeeaaaf20b1475d76dac9bf2014a93fdda1328de5992e8e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PotholeDatabase.repairTargetDao: MethodTooLong \u2014 repairTargetDao runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/PotholeDatabase.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ddb79a4b0edca9b47c955727c7fe78e71d8c17925bcaec2a515db62e05f245"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: window.judgeWindow: FunctionTooLong \u2014 judgeWindow runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/window.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa65ecf1d971fabb2aab68213fbdd206643d13f326e14fe0cd094f86e07ba83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PotholeDatabase.repairObservationDao: MethodTooLong \u2014 repairObservationDao runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/PotholeDatabase.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f025da17b064a6701b38bd54ef71ab3060f7e1a0750524776efd01eadba70457"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PotholeDatabase.sessionDao: MethodTooLong \u2014 sessionDao 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":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/PotholeDatabase.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaf35beb2e56b9f90b8eb3fcd543495b67a91d8af364b7e7e714305f8777944"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/detector.py: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 99 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7833fe26161846f2d5978b59c36c00e354cdf75d3a62368de7300c3240ad3c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PotholeDatabase.footageDao: MethodTooLong \u2014 footageDao runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/PotholeDatabase.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1a7608a6bff46947e3a0cde8d56fa92958aae8ea9248869707e1f4ba0670b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PotholeDatabase.driveKeyframeDao: MethodTooLong \u2014 driveKeyframeDao runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/PotholeDatabase.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74bb7c660879a804b0b8f2fd7ac7c188f854f36a596680ad525b7f785a90885"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/DriveModePlugin.kt: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: DriveModePlugin (122-831). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d8701d43d4a6a07560b443b616a8fb96297df3b29fb2b2516b1130658bcb60"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DriveForegroundService.consumeInferenceJobs: MethodTooLong \u2014 consumeInferenceJobs runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dae855a95a2fbbc3d90287fa7795e28fc5499c0d767db84ca3499b9b50231a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VideoImportStore.import: MethodTooLong \u2014 import runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportStore.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ab4e7db56ce5198fd2fd69f3afaee1c3a47fe1a9221c09f1ad8a9a84ac7d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drivemode/DriveModeService.kt: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: DriveModeService (46-921). The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00e0702c4c9a3980d879320550e31be1a0a445c3adfebb36c4c305dbc325758"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.validateRoadAgreementPack: FunctionTooLong \u2014 validateRoadAgreementPack runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"0947d0630222d0978ec4cdd55119d92c074f4fe3b1a9d99b25f5e2294b4a3aca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.prepareComplaint: FunctionTooLong \u2014 prepareComplaint runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab52b6915b70e7008374c4df25ad4cf841c29db4665205dc6b79c64931037e0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.validateRoadAgreementPack: FunctionTooLong \u2014 validateRoadAgreementPack runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0174c199296b78a062bd5e14a39d91dfe6784c9f3dd60a98fc06cef503f588"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.prepareComplaint: FunctionTooLong \u2014 prepareComplaint runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f12e10d2859e94abeaa4558709604e36722e8c2e000c5c9b7357660348dd58c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.validateRoadAgreementPack: FunctionTooLong \u2014 validateRoadAgreementPack runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"72538f6214133fade092d40cb1845186ad122b4289f25dbde45491740234bda7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standalone.prepareComplaint: FunctionTooLong \u2014 prepareComplaint runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b7fab6b47adaa5dc9c973b3d2d72ed2ea20c5669c6c8167fdde0da3e098780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yolo/release.py: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/release.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"942bf6c5f5910fe061bc7964d06f115f92ee9cfb02dd98a0942b4c26493cbb62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: snapshot-india-wards.buildSnapshot: FunctionTooLong \u2014 buildSnapshot runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8a07c09b5757534b34c387a5d6b95cd5ddb6433ad9acd56c39fa85bddf5e20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/handler.py: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/handler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c162c49d6c838a91b8f9f07372faa5a5667a680e62f6c0524fe9906e2fff5283"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DriveModeService.processDetection: MethodTooLong \u2014 processDetection runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"36273195049b373786536e43a0d0a231d60a1f4f9344fdb0b254160a470163c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DriveForegroundService.startScanLoop: MethodTooLong \u2014 startScanLoop runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ed8a33e4d6c94e3b2228407657ea1ca45b818de6651f03ff4dbf1a57abf26a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/detectors.mjs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 74% of them inside a single declaration: createDetector (233-758). The bar is 500 significant lines; this is 15 over it, 1.03\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":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d0cf3c0deb6a2532022230d23272f3b832ed5dd0a5d33d483cf1966a7b7aa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: india-ward-coverage.measureSnapshot: FunctionTooLong \u2014 measureSnapshot runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"197324d7444144ffece12b838d88aa4ba14296beb25a1f2b84e1af8c032f50fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/india-ward-coverage-report.mjs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 75% of them inside a single declaration: render (162-595). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ede24fafe4ca86ad70949a5bccf47954821db4f0c37b1a1d196eb38b32236ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:785-837 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:1099-1145 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dde698c271c223331641618ca3ad68871b39f6bd24059e5dcb6f6b0bd4efe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt:552-626 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt:453-513 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"98840d4e91589fa1b339f003ff98bf27c560263f3a134bc934c747105788f466"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt:41-98 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt:100-148 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"617254577a533d1ff52ab106c243ee12ea8623709791bb2e3e71658b833a95d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): eval/run_eval.py:461-481 | eval/run_tender_eval.py:195-223 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d8315bc8e960b030cf47cefa3cfebc43322d8cd3ac55d6e899a220b7fb8250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:745-782 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:1066-1096 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27af96aff5257c8ef8b05e2aa5a49512967935b81009c307ee074f1bb4760ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): ml/detector/prepare.py:178-197 | ml/detector/prepare.py:261-279 | ml/detector/prepare.py:284-308 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1c42689140a6733b7a8df1faf4ff24fe3fda8ed33b2a544377930473657d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): eval/materialize_private_eval.py:149-236 | eval/materialize_private_eval.py:241-336 \u2014 These two members are one piece of code written twice and then edited apart: 88 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a94773ad6744cb2a956448ac0fb4b169610ef5678f96d96a701765b90d693d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): eval/historical_detection_contracts.py:126-150 | eval/run_eval.py:313-346 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/historical_detection_contracts.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b384fecd2463108acfd8fcd14f381603d677f16162effa3bac07da5e6135f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt:372-387 | android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt:606-625 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"decf6db833efcfac88baca790cc46cfe9d6650fee4c55263adcd713052cb8f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): infra/aws-yolo/service/detector.py:374-397 | ml/yolo/common.py:230-256 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f508af400540e655912b3fcff2f7268063326899f994fd89ae7e4715bb33e9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt:377-405 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt:407-445 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"840775ac1c4fd6089d10f2444e4600b06c9303aec386bb7419da7f5adbb5850f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): ml/classifier/evaluate.py:42-47 | ml/classifier/train_probe.py:31-36 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/evaluate.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"973f8885270c63c35442aa9e41d5af7fd3e312c810da293a7fc334f9f9995c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): eval/exhaustive_video_eval.py:987-1001 | eval/run_rad_eval.py:1188-1199 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6d2e3949c7e87029831235df36fde76cf420673c21a612968aef0562e0f342"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ml/yolo/evaluate.py:108-120 | ml/yolo/parity.py:327-341 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/evaluate.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"294313c0efb2aecf025273736c600d9611dff22182e4e361c7ad524458ceda8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ml/yolo/common.py:134-145 | ml/yolo/parity.py:81-92 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/common.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e999b5988134955b7e93926cbe8b6dea5a594e09cae9223ac3415566ff1492c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt:222-238 | android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt:240-255 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f1256d8996acc27d070d66a686b9cce476ffe74e86c05a25872b95174eb5dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): eval/private_release_gate.py:458-468 | eval/run_eval.py:54-62 | eval/run_rad_eval.py:1103-1113 | eval/run_tender_eval.py:37-47 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_release_gate.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0ce09b5e5cfa4f3cb80a1714cdc29501284194e08099343548428b7aee49b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt:1223-1234 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeSourceMediaLedger.kt:13-24 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b724da6aa5394c2faf9b71f315e67bbfa817c047127234ddbf7cb1e70521617f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): eval/exhaustive_video_eval.py:661-667 | eval/private_release_gate.py:272-280 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fba57178149a060fadf00e476f50fdbab1f1099ddbb55d2ee4734ad60712afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): ml/classifier/datasets.py:44-49 | ml/detector/prepare.py:71-75 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/datasets.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c5ac8e809562ddfa0e29d427e602e2629d45a3811f7934a43bb276ec74f9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt:361-371 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:1630-1639 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff410b8f9ab053ec74536d514ec220d195984fa92505f947edb300744b668ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): infra/aws-yolo/service/detector.py:246-250 | tools/cloud/device-farm/run.py:43-47 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba6ab05c4ce3d1574e85e8831fa3055d3e5475272aeb927766de3685ad82805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeReportEvidenceStorage.kt:276-280 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/NativePrivateMediaFiles.kt:8-14 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeReportEvidenceStorage.kt"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0713ff517684277f6f23bc119e82f14a5f22da0ce8700bc9c631649938341318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): eval/private_drive_corpus.py:413-416 | eval/private_release_gate.py:157-160 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a552de0419c35c4dcbeebd5609199c38a21f1383d2bc0981fa1f262380882ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): eval/rad_dataset.py:642-646 | ml/yolo/prepare_dataset.py:493-497 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/rad_dataset.py"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7529dae92f9154a9f58d7bd3fd074914ad65e6d4444f365d3f2e15f6b72aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): eval/run_eval.py:578-581 | eval/run_rad_eval.py:141-146 | eval/run_tender_eval.py:309-313 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c16ac22d9a02f1da0c98885bfd05831f9ad5b2eaa2e7c71b15511f288d68bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:214-244 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:2195-2226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"401762bb0418d17116334cd0da4dc00f872a61c38ec52f0de0c98f4b82ccaa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt:287-306 | android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt:329-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt:287\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3817cf9a6c25c9724ce03d281ce36471c4ffba6f6d1ccb1e6d5cceb0b770c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt:144-156 | android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt:330-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c659356c92bebb36b559bb868cddf102f3a3cc803e0c1878db9cfaba7e0d256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/FrameCompressor.kt:60-69 | android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/FrameCompressor.kt:183-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/FrameCompressor.kt:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/FrameCompressor.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa15ab0c45e3330370247c621543ea32a84ced966d6d5649ec090bd6ff190b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt:596-605 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt:486-495 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt:596\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a311e02ce8b140eddf737f642e25a0b38a395fcdf69402e2cebae8ed2adef36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt:44-54 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt:103-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87e1046cd7591d12e77d9a045b9db940cd6e2db1fcf2361480fa862bdf859ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:786-794 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:1100-1108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:786\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"60394646d372f8bca739ff1e4c3f6c915ea25abb0de80cbd26cc39dfab3860c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:1394-1401 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt:1473-1480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf540fdea907829f56cf076be112b70f73834556b98bcf5e95c7dde7e1b55a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt:912-920 | android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DuplicateDetector.kt:219-227 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a60ea6aa49c66e7969b17ebeffbea75c2223142ae77a146d7344ab8877285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt:1214-1221 | android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRtspFrameSource.kt:603-610 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"daed85160d423e9b233118d0ef7f3ec1fcd9d84b0b082b19f214cff6985dca75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt:373-377 | android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt:504-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt:373\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/DriveModePlugin.kt"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91439481acca739349f122350dc168d7ebbb44520e50b2924b7fc27a51c95db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): eval/historical_detection_contracts.py:140-150 | eval/run_eval.py:334-346 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/historical_detection_contracts.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac2afc0e9fbeec69a8f0650e1e128f3e0fe3af0bfb53a60102e1698850c4bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): ml/yolo/release.py:70-82 | ml/yolo/release.py:178-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/release.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"424ae4dcff2ecb7962e8cb5f5b9fae65a08bdcddf8c6c0984d53ec8be0a04329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ml/yolo/common.py:110-119 | ml/yolo/parity.py:60-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/common.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fe593cb453326763378f68d98569f70cc67f464a812b13ba29e5c877daa62d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): eval/private_release_gate.py:458-466 | eval/run_rad_eval.py:1103-1111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_release_gate.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f603cc1bf7f4485f9646dd134cdce752627241e6f5b60618a0c3121f873d0f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): eval/exhaustive_video_eval.py:708-716 | eval/private_release_gate.py:390-397 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060eval/exhaustive_video_eval.py:708\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5f76e3b9a51bf9791dc2bcf672f976d4eb72ac5c1a433c8f5ae9fc0230062d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): infra/aws-yolo/service/detector.py:227-234 | ml/yolo/release.py:299-305 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1014725f5aad94df9a5b0e7b7648ef780a5299fae98c0c1a30166e6ebf63a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): infra/aws-yolo/service/detector.py:381-388 | ml/yolo/common.py:237-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"29703b1db732dfdfeacb39fb9b0ab049e979ef6b7d5c4dc15b96a41d58a53a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ml/detector/prepare.py:269-276 | ml/detector/prepare.py:322-329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"599eb72b6e530b81f835b20af393bd2325475580039066e41a94826351b8b01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ml/yolo/common.py:457-463 | ml/yolo/prepare_dataset.py:825-831 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/common.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3c503d9ef8ac669d0f92abbeb4f4c70e102a2340da6055f612515bd9048cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ml/detector/prepare.py:187-192 | ml/detector/prepare.py:298-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/prepare.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6461997b970b0162573b6736efb88a1d1b9f427d22596ab46eefef60bc61b350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ml/yolo/common.py:412-417 | ml/yolo/prepare_dataset.py:819-824 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/common.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ccce39b50fe954c007b5e47940582b13ed8ba1b5f65af8a05ce585eeb3ebd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): eval/materialize_private_eval.py:196-200 | eval/materialize_private_eval.py:294-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060eval/materialize_private_eval.py:196\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"720b6bd90c54b3746c3a8741fbaa640980b38c2d63614467cd7159cbeabd1a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ml/classifier/evaluate.py:214-219 | ml/classifier/evaluate.py:222-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ml/classifier/evaluate.py:214\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/evaluate.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4413314c4a3a49990b08444689288a56c1b533a088dea90e99ada39f3b164f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): eval/private_drive_corpus.py:54-58 | eval/private_release_gate.py:44-48 | eval/rad_dataset.py:140-144 | eval/run_rad_eval.py:133-137 | ml/yolo/common.py:100-104 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca439034e5f4b56c6f3062e9ff65d450179a37e17535121fc88c9887b754ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): eval/run_prepared_eval.py:86-92 | eval/run_prepared_eval.py:93-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_prepared_eval.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b9668c82f7b0b60515a0e4f292fbf06b4de313e3a3244af0f723f639e0877a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (47 shared lines): tools/pull-bihar-road-tenders.py:334-507 | tools/pull-telangana-road-tenders.py:409-511 \u2014 These two members are variants of one another: 47 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96d7f55486dea7ad0a81e056b646aa744f214702ae511cc79e7fdb54ad7360d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tools/pull-bihar-road-tenders.py:519-539 | tools/pull-telangana-road-tenders.py:523-545 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e23ee103be2676397fbfc9efbd31c3140be4043f14dfebc33716a0c097af06"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): tools/state_pack_tools.py:1079-1149 | tools/state_pack_tools.py:1158-1269 | tools/state_pack_tools.py:1278-1348 | tools/state_pack_tools.py:1357-1443 | tools/state_pack_tools.py:1452-1539 | tools/state_pack_tools.py:1548-1636 | tools/state_pack_tools.py:1976-2140 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd2e1001ab66184818a33e59afc9d5067bdc6d256d433faf757e78f1d215363"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): tools/build-andhra-pradesh-coverage.py:99-124 | tools/build-metro-coverage.py:57-79 | tools/build-punjab-coverage.py:94-119 | tools/build-tamil-nadu-coverage.py:107-132 | tools/build-telangana-coverage.py:100-125 | tools/statewide_boundary_builder.py:78-107 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3c87dfb07b124bfdbf8489c6b0e061f101987c0d1ddb028c636b8f602ee8d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/build-andhra-pradesh-coverage.py:148-159 | tools/build-punjab-coverage.py:143-154 | tools/build-tamil-nadu-coverage.py:156-167 | tools/build-telangana-coverage.py:149-160 | tools/statewide_boundary_builder.py:131-142 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0656ae33f7bdae34ac6fead6a93437058209cca99c6a6507676c8914bfa871c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/build-andhra-pradesh-coverage.py:163-169 | tools/build-punjab-coverage.py:158-164 | tools/build-tamil-nadu-coverage.py:171-177 | tools/build-telangana-coverage.py:164-170 | tools/statewide_boundary_builder.py:146-152 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c490b2a80ed41e58e02cd5b51f8748b7ee8d43235240432bff5bb370ea1b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/build-andhra-pradesh-coverage.py:259-286 | tools/build-punjab-coverage.py:256-284 | tools/build-tamil-nadu-coverage.py:268-295 | tools/build-telangana-coverage.py:262-289 | tools/build-top50-coverage.py:510-537 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d2bdb6fca69d7032f7998f6afbd5d314143326fe7f1ded9354124856a8c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/build-gepnic-road-notice-packs.py:152-168 | tools/build-highway-contract-packs.py:148-164 | tools/build-pmgsy-road-agreement-packs.py:175-191 | tools/pull-pmgsy-road-agreements.py:454-475 | tools/state_pack_tools.py:857-876 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b5b6dbb643a0303c5c03c55d16fa690ed017cdec98ca06af27440e26b6af73"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/pull-bihar-road-tenders.py:511-515 | tools/pull-chhattisgarh-chips-road-tenders.py:333-337 | tools/pull-gujarat-nprocure-road-tenders.py:124-128 | tools/pull-lakshadweep-road-tenders.py:136-140 | tools/pull-pmgsy-road-agreements.py:503-507 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"830248e3c36ff6dedddf9d73ac6ee627dce3a298791dc2019873cd5f6d9d0fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/state_pack_tools.py:1357-1443 | tools/state_pack_tools.py:1452-1539 | tools/state_pack_tools.py:1548-1636 | tools/state_pack_tools.py:1646-1880 | tools/state_pack_tools.py:1890-1963 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"280c55708cf664ec6b53219f3ce0051b55391f8bd86d0e67041ed2ca29585067"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/build-andhra-pradesh-coverage.py:80-95 | tools/build-punjab-coverage.py:76-90 | tools/build-tamil-nadu-coverage.py:88-103 | tools/build-telangana-coverage.py:81-96 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"76945fc385455de3decd10607ed62a7ae0f9b2e388c7a82a4b9c63515060907b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/build-andhra-pradesh-coverage.py:173-178 | tools/build-punjab-coverage.py:168-173 | tools/build-tamil-nadu-coverage.py:181-186 | tools/build-telangana-coverage.py:174-179 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36e537e45788e08d41ec181b2d170aab3cd48e79ab45ce9bdc108974c9cc21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/build-andhra-pradesh-coverage.py:182-217 | tools/build-punjab-coverage.py:177-214 | tools/build-tamil-nadu-coverage.py:190-225 | tools/build-telangana-coverage.py:183-218 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ac38f0dd1598183b219ed91875b658e2733d4bca437ecf486959721cd78cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): tools/build-gepnic-road-notice-packs.py:235-294 | tools/build-gepnic-road-notice-packs.py:395-449 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd002f65af29870d46f217651e54406d751cd60625f6d0792aeca407bbc34a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): tools/build-maharashtra-coverage.py:70-110 | tools/build-west-bengal-coverage.py:81-130 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"08644265bc11bef53cfb076e9104796ea14c12373da6212106761c5f82c938d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): tools/pull-chhattisgarh-chips-road-tenders.py:425-457 | tools/pull-gujarat-nprocure-road-tenders.py:305-328 | tools/pull-lakshadweep-road-tenders.py:213-241 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-chhattisgarh-chips-road-tenders.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aed47d83bc3c2cf4fad655339d1655157ea10a3f33ce4edd8acc0aadae87609"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): tools/cloud/ci.py:85-104 | tools/cloud/eval_prompt.py:77-103 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/ci.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d6ce06094c846dc4e58091229812c16edb74868f4fa0108441f82ffd10a659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tools/prune-catalog-packs.py:177-198 | tools/prune-catalog-packs.py:353-370 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/prune-catalog-packs.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be306f5c459c0a8b65f04826c60fc48c089499d52205779649264ee8f8a78fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): tools/build-gepnic-road-notice-packs.py:1027-1042 | tools/build-highway-contract-packs.py:481-496 | tools/build-pmgsy-road-agreement-packs.py:545-559 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"528f3c6eb2e20659e5bef9819c01203deff993c64ed78f502fec2a702f308636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): tools/build-gepnic-road-notice-packs.py:1046-1066 | tools/build-highway-contract-packs.py:500-516 | tools/build-pmgsy-road-agreement-packs.py:563-580 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"01509eaa307d524de5fb81275342035a1d55be131fa04f18b04a329bf39eaab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tools/build-delhi-coverage.py:133-141 | tools/build-metro-coverage.py:142-148 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4a39c08db26a7422fe352c90e96f7604ed648ae3c6e99fac5f0af96a1d2db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tools/build-gepnic-road-notice-packs.py:1070-1087 | tools/build-pmgsy-road-agreement-packs.py:584-597 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17d934a659a361e5abf9feaa7c3f260f4273ea783ebdd18bb3f03197f747a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tools/cloud/cb.py:20-27 | tools/cloud/device-farm/run.py:35-39 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/cb.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2733929b1842f576dcdf99ce946b985923baf7d5a0f400fe3f8751f08981f70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/build-top50-coverage.py:241-249 | tools/statewide_boundary_builder.py:60-74 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-top50-coverage.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fcfee0e1cce5202b797d316b6609d3bee27f821ae22cb798ed9128a947e981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tools/pull-kppp.py:347-351 | tools/pull-telangana-road-tenders.py:515-519 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-kppp.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebc757fc3d3bc7030a5fc18ebdc79549db33cfcf08039a28990f1d54bd61014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tools/pull-bihar-road-tenders.py:86-90 | tools/pull-telangana-road-tenders.py:72-78 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41898cd3fdf687ccbc6faca25e2a0bdd5e613e46c84f816a249d8b652c367b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): tools/build-delhi-coverage.py:145-146 | tools/build-metro-coverage.py:152-156 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acdce998e9df1e6184622d06db417f356f01f7f7a84cc29dc0971870976ade9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 4\u002B corresponding lines): tools/build-andhra-pradesh-coverage.py:73-76 | tools/build-maharashtra-coverage.py:31-34 | tools/build-punjab-coverage.py:69-72 | tools/build-tamil-nadu-coverage.py:81-84 | tools/build-telangana-coverage.py:74-77 | tools/build-top50-coverage.py:207-210 | tools/build-west-bengal-coverage.py:34-37 | tools/statewide_boundary_builder.py:53-56 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5beec09bd0e1d0e3e80f4a2f6ce6ddf2a5fce18a0498802b1b19dbea18137f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 4\u002B corresponding lines): tools/pull-bihar-road-tenders.py:98-101 | tools/pull-chhattisgarh-chips-road-tenders.py:81-84 | tools/pull-emarg-road-contracts.py:83-86 | tools/pull-gujarat-nprocure-road-tenders.py:92-95 | tools/pull-kppp.py:82-85 | tools/pull-lakshadweep-road-tenders.py:62-65 | tools/pull-pmgsy-road-agreements.py:143-146 | tools/pull-telangana-road-tenders.py:86-89 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"07faa9dca8061afcfc75668cd7053f8ee763d840398a98c0b95293026be0e590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/build-gepnic-road-notice-packs.py:181-184 | tools/build-pmgsy-road-agreement-packs.py:210-213 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8f49c5c8f3e97249be39310455c077019061ed069c3bf76d1c60c27bc05024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): tools/pull-chhattisgarh-chips-road-tenders.py:88-89 | tools/pull-lakshadweep-road-tenders.py:69-70 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-chhattisgarh-chips-road-tenders.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76fc4157d3287f1ec135febfb837893f12606ad19491abe4325d9f427cd2e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/build-maharashtra-coverage.py:63-66 | tools/build-west-bengal-coverage.py:74-77 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea137653430140e2cc378df9f0b61c52e3a6cdc1086239da672d80fe50e1df52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/pull-gujarat-nprocure-road-tenders.py:103-110 | tools/pull-kppp.py:104-112 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-gujarat-nprocure-road-tenders.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b13047b368055d2a22c04348cb9b7e2b275c4fad16dd0be406e5205053095"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/pull-bihar-road-tenders.py:127-130 | tools/pull-telangana-road-tenders.py:119-122 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"74930df44e9240608ecfcb3bfd6751945232072eae3561ff9553187fabfe652f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 4\u002B corresponding lines): tools/build-andhra-pradesh-coverage.py:128-132 | tools/build-delhi-coverage.py:124-127 | tools/build-metro-coverage.py:125-128 | tools/build-punjab-coverage.py:123-127 | tools/build-tamil-nadu-coverage.py:136-140 | tools/build-telangana-coverage.py:129-133 | tools/statewide_boundary_builder.py:111-115 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f44b6775b8392c9a877ad91cb457dca90f3dde12c1f272c387d196839df231a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): tools/build-gepnic-road-notice-packs.py:135-138 | tools/build-highway-contract-packs.py:135-138 | tools/build-pmgsy-road-agreement-packs.py:158-164 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba819ac132ea7ea117ebd9e1516ec82e5d5bd13110cfef28ad742943d78f89f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tools/pull-emarg-road-contracts.py:90-96 | tools/pull-lakshadweep-road-tenders.py:74-80 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-emarg-road-contracts.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03c06abf82ae751c1bfa3ea7cdf858b343a2c82c7575d7d5f1a191b609d5860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 3): tools/state_pack_tools.py:1372-1409 | tools/state_pack_tools.py:1467-1504 | tools/state_pack_tools.py:1563-1599 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1372\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eeb3f268e1dc1764825a6a489169e3846f1e6bbe41a6010e4c51565372e2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201333 lines \u00D7 2): tools/build-gepnic-road-notice-packs.py:266-294 | tools/build-gepnic-road-notice-packs.py:417-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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d233f55f1212f9ff70eb8aeafdce67ea1bd0ca3bc219ba36ed6b2af92f67281e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 4): tools/build-andhra-pradesh-coverage.py:182-209 | tools/build-punjab-coverage.py:177-204 | tools/build-tamil-nadu-coverage.py:190-217 | tools/build-telangana-coverage.py:183-210 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"37838988df628a425bb2ab036bb4bc171398f594f727df17a530cb44488abf85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 3): tools/state_pack_tools.py:1117-1140 | tools/state_pack_tools.py:1228-1253 | tools/state_pack_tools.py:1309-1331 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97845c3710500b29e6f674753185bbdadbf7b449657d4461beeaf6eafba4755"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): tools/build-andhra-pradesh-coverage.py:260-280 | tools/build-tamil-nadu-coverage.py:269-289 | tools/build-telangana-coverage.py:263-283 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-tamil-nadu-coverage.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27d38d641b90caa0c2236e5663f3ab96a2f78f753e71481ac3a3e9f07de1fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): tools/build-maharashtra-coverage.py:70-90 | tools/build-west-bengal-coverage.py:81-101 \u2014 before extracting anything, compare \u0060tools/build-maharashtra-coverage.py\u0060 and \u0060tools/build-west-bengal-coverage.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbc6194e5d5e8375bd263788f4e79894c92bed992b6d3cffa6aef674fe0274c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): tools/pull-bihar-road-tenders.py:421-440 | tools/pull-telangana-road-tenders.py:444-464 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-bihar-road-tenders.py:421\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6bd01145c159b7a1bc7eaa507ce503d06252fabda8ce2a8e0c5d3a5a9a2616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4): tools/build-andhra-pradesh-coverage.py:102-124 | tools/build-punjab-coverage.py:97-119 | tools/build-tamil-nadu-coverage.py:110-132 | tools/build-telangana-coverage.py:103-125 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa18c2afee9e4cc1b2ba9ef38f2c184d1e4071c7e5aafd527b099535d160f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): tools/build-delhi-coverage.py:82-118 | tools/build-metro-coverage.py:83-119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/build-delhi-coverage.py:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060geometry\u0060 to \u0060dict\u0060 in one and \u0060dict[str, Any]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7098e5f781dc468466dacef9e787e292e6ab9846758431cfb3127b4c89923d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): tools/state_pack_tools.py:1815-1829 | tools/state_pack_tools.py:1894-1910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1815\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8f1bcdac4e12788e9b6046eea72d17d66c94738048c3b09276416e3f9c201b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): tools/build-andhra-pradesh-coverage.py:80-95 | tools/build-punjab-coverage.py:76-90 | tools/build-tamil-nadu-coverage.py:88-103 | tools/build-telangana-coverage.py:81-96 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c570989b53f3d86d568e289366b2d666a1974926e420570d091389e7e78079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): tools/state_pack_tools.py:1411-1426 | tools/state_pack_tools.py:1506-1521 | tools/state_pack_tools.py:1602-1617 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1411\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cd4245d2ddd8dcf234f92e60695656fcaf778baa074696280cb4a13925d917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): tools/build-gepnic-road-notice-packs.py:153-167 | tools/build-highway-contract-packs.py:149-163 | tools/build-pmgsy-road-agreement-packs.py:176-190 | tools/pull-pmgsy-road-agreements.py:460-474 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f702a1222c09d671135da3d01f247995ecef76fb7737ad9d42ed41ecb9b473d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tools/build-gepnic-road-notice-packs.py:1070-1084 | tools/build-highway-contract-packs.py:520-534 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aa731a41d4860905c37ef33e8b6e128b7a4e3f108e8da070e7e646a4a095f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tools/build-maharashtra-coverage.py:154-169 | tools/build-west-bengal-coverage.py:169-184 \u2014 before extracting anything, compare \u0060tools/build-maharashtra-coverage.py\u0060 and \u0060tools/build-west-bengal-coverage.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c2ea7f1f728bc58062ad7c56e5300fc250e7af401f6c98fa2d39ff3e846a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 6): tools/state_pack_tools.py:1079-1091 | tools/state_pack_tools.py:1158-1170 | tools/state_pack_tools.py:1278-1290 | tools/state_pack_tools.py:1357-1370 | tools/state_pack_tools.py:1452-1465 | tools/state_pack_tools.py:1548-1561 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1079\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78a9fd8bbea5f3480c0dc6a1fe55efe245ab5a266792c3aaa9ad935528471be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): tools/build-andhra-pradesh-coverage.py:259-272 | tools/build-punjab-coverage.py:256-269 | tools/build-tamil-nadu-coverage.py:268-281 | tools/build-telangana-coverage.py:262-275 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4130b19e9f4a0ee9e3cc567ea60f413ccc79fa61f38758504b17a375d6dac146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): tools/pull-chhattisgarh-chips-road-tenders.py:444-457 | tools/pull-gujarat-nprocure-road-tenders.py:316-328 | tools/pull-lakshadweep-road-tenders.py:228-241 \u2014 before extracting anything, compare \u0060tools/pull-chhattisgarh-chips-road-tenders.py\u0060 and \u0060tools/pull-gujarat-nprocure-road-tenders.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-chhattisgarh-chips-road-tenders.py:444\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-chhattisgarh-chips-road-tenders.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d47b1c31bc86ffde8c2666b5eff13ab7dd72083362b25ed857f02fdd5a4040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): tools/build-gepnic-road-notice-packs.py:1074-1087 | tools/build-pmgsy-road-agreement-packs.py:586-597 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/build-gepnic-road-notice-packs.py:1074\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a0d44b0fc9eae9289fc0ef10be940d6e6c61780b6bdaceb723f87888ac0060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): tools/build-maharashtra-coverage.py:90-98 | tools/build-west-bengal-coverage.py:104-117 \u2014 before extracting anything, compare \u0060tools/build-maharashtra-coverage.py\u0060 and \u0060tools/build-west-bengal-coverage.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/build-maharashtra-coverage.py:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/build-west-bengal-coverage.py:102\u0060 calls \u0060geometry_digest\u0060, \u0060BuildError\u0060 and \u0060tools/build-maharashtra-coverage.py:90\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28cbbf93979e0ed2db5dbc050a858be916af038afb66cf0fef29d934acfe451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/pull-bihar-road-tenders.py:336-362 | tools/pull-telangana-road-tenders.py:409-421 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-bihar-road-tenders.py:336\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d192d3ebd3fa835d2e834b0939a53547c50c7a4be2939ffa693873631840b168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 7): tools/state_pack_tools.py:1081-1091 | tools/state_pack_tools.py:1160-1170 | tools/state_pack_tools.py:1280-1290 | tools/state_pack_tools.py:1359-1370 | tools/state_pack_tools.py:1454-1465 | tools/state_pack_tools.py:1550-1561 | tools/state_pack_tools.py:1978-1988 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1081\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f460376e14b9bf82d957146c8653fa29f4e0a879b0e0409d507605ca2512685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): tools/build-andhra-pradesh-coverage.py:148-159 | tools/build-punjab-coverage.py:143-154 | tools/build-tamil-nadu-coverage.py:156-167 | tools/build-telangana-coverage.py:149-160 | tools/statewide_boundary_builder.py:131-142 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cfb55727504961d40423614ef62014e184ab880048ad22c9234f63376ead90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/pull-emarg-road-contracts.py:422-433 | tools/pull-pmgsy-road-agreements.py:573-584 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-emarg-road-contracts.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"036cd1555e51b71a35e32a11e197313c3f439e24390c7954976444ad6a89794a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/build-gepnic-road-notice-packs.py:1032-1042 | tools/build-pmgsy-road-agreement-packs.py:549-559 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b99f2079db15c9fb0edc65d91fdb2646166c88821b6fec14899f6fae9952324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): tools/build-gepnic-road-notice-packs.py:159-168 | tools/build-highway-contract-packs.py:155-164 | tools/build-pmgsy-road-agreement-packs.py:182-191 | tools/pull-pmgsy-road-agreements.py:466-475 | tools/state_pack_tools.py:867-876 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/build-gepnic-road-notice-packs.py:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"428af5e8a1522d145e1671c23ceedea7969a5c6ebb261a5198d9afa7121986a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): tools/build-andhra-pradesh-coverage.py:277-286 | tools/build-punjab-coverage.py:275-284 | tools/build-tamil-nadu-coverage.py:286-295 | tools/build-telangana-coverage.py:280-289 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3396a904eed741b3a20cf4b85eaaca7004bc17c03a0babbdc068072e426b25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): tools/build-gepnic-road-notice-packs.py:1072-1084 | tools/build-highway-contract-packs.py:522-534 | tools/build-pmgsy-road-agreement-packs.py:585-594 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/build-gepnic-road-notice-packs.py:1072\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1a98d9e6df099fe5f2b4ab8bb6c847846fdead5dd5312ca53712409c86275a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): tools/pull-bihar-road-tenders.py:373-382 | tools/pull-telangana-road-tenders.py:431-437 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-bihar-road-tenders.py:373\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"db01abc4d477692b8a816d62eb09eb0e6c7ebba6490883341e3e90fddc538852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 4): tools/build-gepnic-road-notice-packs.py:152-158 | tools/build-highway-contract-packs.py:148-154 | tools/build-pmgsy-road-agreement-packs.py:175-181 | tools/state_pack_tools.py:857-865 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/build-gepnic-road-notice-packs.py:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/build-gepnic-road-notice-packs.py:147\u0060 calls \u0060_report_json\u0060, \u0060_manifest_json\u0060 and \u0060tools/build-highway-contract-packs.py:144\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63ee80aeb37b8acdfcb8d3aa932113761a62cc0f8a7bf3bc23abe1dd5c4bb07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/build-maharashtra-coverage.py:38-46 | tools/build-west-bengal-coverage.py:41-49 \u2014 before extracting anything, compare \u0060tools/build-maharashtra-coverage.py\u0060 and \u0060tools/build-west-bengal-coverage.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d6f0e303fc0d92cca55f8969d2eb019e051add11f4078a22491ef716e6a6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/build-maharashtra-coverage.py:51-59 | tools/build-west-bengal-coverage.py:62-70 \u2014 before extracting anything, compare \u0060tools/build-maharashtra-coverage.py\u0060 and \u0060tools/build-west-bengal-coverage.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"90abb1eae3d8434e518a4ee7e114b263eaf8e0d410a9cbfaa794973d31a46416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): tools/prune-catalog-packs.py:403-409 | tools/prune-catalog-packs.py:423-431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/prune-catalog-packs.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"be566c7efd4d179702f6b1405e2b53ae1df02c2b754496d34b6ca42bf07f2275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): tools/build-andhra-pradesh-coverage.py:274-281 | tools/build-punjab-coverage.py:272-279 | tools/build-tamil-nadu-coverage.py:283-290 | tools/build-telangana-coverage.py:277-284 | tools/build-top50-coverage.py:525-532 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a832e05e451c482524da8ba8093e64c5fbe02a4eb3803c82dfe94174a17b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): tools/pull-chhattisgarh-chips-road-tenders.py:446-452 | tools/pull-emarg-road-contracts.py:420-427 | tools/pull-gujarat-nprocure-road-tenders.py:317-323 | tools/pull-lakshadweep-road-tenders.py:230-236 \u2014 before extracting anything, compare \u0060tools/pull-chhattisgarh-chips-road-tenders.py\u0060 and \u0060tools/pull-gujarat-nprocure-road-tenders.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-chhattisgarh-chips-road-tenders.py:446\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-chhattisgarh-chips-road-tenders.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8495a6d2569335802f886533f09e225d701e59da5dd4637b91bd86d6907d7442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/build-gepnic-road-notice-packs.py:298-305 | tools/build-pmgsy-road-agreement-packs.py:356-363 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab71affb71e830d697d329d01565baf3a1277e1a24ba62f9c599d5971eb14d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): tools/build-gepnic-road-notice-packs.py:1049-1055 | tools/build-pmgsy-road-agreement-packs.py:564-571 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84dd706048d2f7d3adef7a720e251689d6804e6e24fed59e9eb4b32ac6bfecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/prune-catalog-packs.py:178-185 | tools/prune-catalog-packs.py:354-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/prune-catalog-packs.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a59163624b5d619af7dc9441b9ffdc62290681684ec775a154a54cab1db850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): tools/state_pack_tools.py:1874-1880 | tools/state_pack_tools.py:1956-1963 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1956\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2bda727a4730578affaab7da93d1ccc369a6467862d975fb573f2e897b4e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): tools/build-andhra-pradesh-coverage.py:163-169 | tools/build-punjab-coverage.py:158-164 | tools/build-tamil-nadu-coverage.py:171-177 | tools/build-telangana-coverage.py:164-170 | tools/statewide_boundary_builder.py:146-152 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f2d9a58e635445473d66f44e0f111e8bd99faf35a6df39d625d693cb300f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 6): tools/build-andhra-pradesh-coverage.py:99-105 | tools/build-metro-coverage.py:60-61 | tools/build-punjab-coverage.py:94-100 | tools/build-tamil-nadu-coverage.py:107-113 | tools/build-telangana-coverage.py:100-106 | tools/statewide_boundary_builder.py:83-84 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"87515f7b6224efbe4c1d090af214849eafeff01d7ed56ec7f8b5d7176a1d99c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): tools/state_pack_tools.py:1594-1600 | tools/state_pack_tools.py:1859-1864 | tools/state_pack_tools.py:1945-1950 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/state_pack_tools.py:1594\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a64cb4cbfbc5e758ae1ee64036b350c153e2b568fb352337321372d489dfb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/pull-bihar-road-tenders.py:527-535 | tools/pull-telangana-road-tenders.py:533-541 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-bihar-road-tenders.py:527\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2d99ef2ae0f60baf905774d220518ca67b1e1c740b2115b3826f857933532e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): tools/pull-bihar-road-tenders.py:530-535 | tools/pull-chhattisgarh-chips-road-tenders.py:447-452 | tools/pull-gujarat-nprocure-road-tenders.py:318-323 | tools/pull-lakshadweep-road-tenders.py:231-236 \u2014 before extracting anything, compare \u0060tools/pull-chhattisgarh-chips-road-tenders.py\u0060 and \u0060tools/pull-gujarat-nprocure-road-tenders.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-bihar-road-tenders.py:530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d10924b37764b38969e8d8a8cb48027df78710df7b2e3eb01979df30ae84597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/pull-kppp.py:372-377 | tools/pull-telangana-road-tenders.py:536-541 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pull-kppp.py:372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-kppp.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef7b76014a6cbb67380212b3593e0e95dcea477b53ebb2514f8e7f3acc44a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): tools/build-andhra-pradesh-coverage.py:173-178 | tools/build-punjab-coverage.py:168-173 | tools/build-tamil-nadu-coverage.py:181-186 | tools/build-telangana-coverage.py:174-179 \u2014 before extracting anything, compare \u0060tools/build-andhra-pradesh-coverage.py\u0060 and \u0060tools/build-punjab-coverage.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"97de059dc94a3d6e8badceea30a85410b8706812515e72ce1989d6be98a3de09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): tools/build-gepnic-road-notice-packs.py:1030-1036 | tools/build-highway-contract-packs.py:484-490 | tools/build-pmgsy-road-agreement-packs.py:547-553 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"8344e01e85092cd2800bc3f18c1fc4d9904dae6e1441e3fb9a400f31817575a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/build-delhi-coverage.py:134-138 | tools/build-metro-coverage.py:143-147 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2eb2acede97228edb459e56dac83ebd6efa386ec3ef68b1b50c1e29f805869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/pull-bihar-road-tenders.py:454-459 | tools/pull-telangana-road-tenders.py:477-482 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0970f4139abfd1c40587d6216981845ff670321ba50bdefaefd7fc0b7690a3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): tools/build-bihar-coverage.py:51-55 | tools/build-chhattisgarh-coverage.py:51-55 | tools/build-goa-coverage.py:49-53 | tools/build-karnataka-state-coverage.py:50-54 | tools/build-kerala-coverage.py:50-54 | tools/build-madhya-pradesh-coverage.py:51-55 | tools/build-odisha-coverage.py:51-55 | tools/build-rajasthan-coverage.py:51-55 | tools/build-uttar-pradesh-coverage.py:51-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 9 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-bihar-coverage.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6061aaaf9ff46b870a64b7f407cbca8d99ea66f88f897a9fe7c0c07d915123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/build-gepnic-road-notice-packs.py:172-177 | tools/build-pmgsy-road-agreement-packs.py:195-200 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1089837bb4125c8baeb554fdf2c4aaaadaf098f48147368464349435e4b13b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/pull-chhattisgarh-chips-road-tenders.py:109-115 | tools/pull-gujarat-nprocure-road-tenders.py:114-120 \u2014 before extracting anything, compare \u0060tools/pull-chhattisgarh-chips-road-tenders.py\u0060 and \u0060tools/pull-gujarat-nprocure-road-tenders.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-chhattisgarh-chips-road-tenders.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"28907b82aa89c3e71207b444829accc6a63093e3a5b142a8aa103ac85cd2fdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): tools/pull-bihar-road-tenders.py:511-515 | tools/pull-chhattisgarh-chips-road-tenders.py:333-337 | tools/pull-gujarat-nprocure-road-tenders.py:124-128 | tools/pull-lakshadweep-road-tenders.py:136-140 | tools/pull-pmgsy-road-agreements.py:503-507 \u2014 before extracting anything, compare \u0060tools/pull-chhattisgarh-chips-road-tenders.py\u0060 and \u0060tools/pull-gujarat-nprocure-road-tenders.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2099ad5e655f5500fd3be5f52b954206e6d1d4556e49b786d11423a3b1b5427d"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: after the breaker closes the next lookup asks KGIS again: This test starts work it did not wait for (\u0060geolocator\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(60)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/test/geolocation.test.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e034e6b259ee661f7a717735a847eaf0f20e83aa751a97de8d869e2a693b0bc"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: an expired map answers from memory at once and refreshes behind the answer: This test starts work it did not wait for (\u0060blocked\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 5))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/test/speed.test.mjs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16a8fb02ffbc5fc0cc179fb2898776029135dc8089d55fbecba4ddf3ee4f674"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: infra/aws-central/::a packaged lookup is under half a millisecond warm and a tile loads in under 150 ms: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/test/local-address.test.mjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4362a95081864877a44e85997b81f7e87044a7662ae1792d9557bb5e8cee31a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: infra/aws-central/::outside Karnataka the ward file and the notices\u0027 bodies are worked out once, and a lookup stays cheap: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/test/speed.test.mjs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbff6235d3296e778e4495d189d486545b7e9760d3de37901778e0169724c55a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: ml/classifier/lambda/::yolo_then_openai: a frame the screen clears is answered by the screen alone: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/test/contract.test.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4334aa0821530a3803e7e828178dad83e7fee904c7939c8820035dab5d6d4b97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/www/standalone.js: android-app/www/standalone.js changed 120 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 297 in standalone.createReport at line 9590. 8 of those changes were fix/bug commits, and the other 112 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/www/standalone.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e111c53ac8970f34ce53bac18851a333eee12e1cd628202cb81e702acb40359"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: static/standalone.js: static/standalone.js changed 120 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 297 in standalone.createReport at line 9590. 8 of those changes were fix/bug commits, and the other 112 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- static/standalone.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2639b004dec22f5a38d1f47ee5043aae2016e78492ca16c8ab194a994ebc2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/standalone.js: docs/standalone.js changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 297 in standalone.createReport at line 9590. 5 of those changes were fix/bug commits, and the other 73 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- docs/standalone.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b2a34dffbc866ba947b3ec4fbf2c26c8c45105c77492484ab9c25b258f9dab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/www/index.html: android-app/www/index.html changed 130 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 162 in index.html.analyseFootage at line 8197. 14 of those changes were fix/bug commits, and the other 116 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/www/index.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8ab46e42157d9eba094f16f7c0f7a28875a990599c1556607993df88b5957d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: static/index.html: static/index.html changed 130 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 162 in index.html.analyseFootage at line 8197. 14 of those changes were fix/bug commits, and the other 116 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- static/index.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f71ec0e1f1afe7cc6343da4004e962f13b6145c1eb346da3ec8f049ab53ec0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/index.html: docs/index.html changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 162 in index.html.analyseFootage at line 8197. 10 of those changes were fix/bug commits, and the other 78 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- docs/index.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3e834e46cdf8636c1c4c3d15a433015644df8e01f006e49958c4ff48f125f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/assets/public/standalone.js: android-app/android/app/src/main/assets/public/standalone.js changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 297 in standalone.createReport at line 9590. 3 of those changes were fix/bug commits, and the other 37 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/assets/public/standalone.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908f8a02873c6cdc24a57408121b4b14b55899f8c469317e441d3e78466df39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/assets/public/index.html: android-app/android/app/src/main/assets/public/index.html changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 162 in index.html.analyseFootage at line 8197. 7 of those changes were fix/bug commits, and the other 44 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/assets/public/index.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/index.html"},"region":{"startLine":8197}}}],"partialFingerprints":{"codehealthFindingId/v1":"973eb12db639080063e42fd589d45360e1c5617afec47000c22e57979d5c0097"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/core.mjs: infra/aws-central/service/core.mjs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 293 in core.createService at line 307. 3 of those changes were fix/bug commits, and the other 19 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/core.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a134bc78c15f30717ab323221533f1f01b5034b90863443b925834b4951b75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt: android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in DriveModePlugin.reconcileNativeState at line 1641. 1 of those changes was a fix/bug commit, and the other 14 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92a409a1fa159a047d89c699496badeb84b1f1f901c7dea2768b33a091160ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in DriveForegroundService.stopDriveSession at line 2118. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece4538467d402695440d5c3b1f412b9dfdb7f7096d1b73635d52f2016322bf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/geolocation.mjs: infra/aws-central/service/geolocation.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in geolocation.createGeolocator.resolve at line 410. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/geolocation.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c45812b611d5c6296c37764984f9e6eded13b82842f4413bb33b74ded5adf76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/state_pack_tools.py: tools/state_pack_tools.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in state_pack_tools._validate_municipal_city_payload at line 2169. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- tools/state_pack_tools.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/state_pack_tools.py"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc7029990b31db6a743d24d9fe9e2947fe1864d8bf16ebc6061fa12f9db0a20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/harness/run.mjs: tools/harness/run.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in run.tasks at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- tools/harness/run.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/run.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"11848a938b6f2545d698190baba6773f8470125b04eae6d084ff474ea0d526e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: eval/run_prepared_eval.py: eval/run_prepared_eval.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in run_prepared_eval.load_event at line 45. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- eval/run_prepared_eval.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_prepared_eval.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51a7d94765065ddfe46445b79c88aeb8ec4c4d179984d30a28ca848064ab9ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/health/window.mjs: infra/aws-central/service/health/window.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in window.judgeWindow at line 42. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/health/window.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/window.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c09117288d0dc0a67a73270b4b0c94243f3abe9f46b3b6dc8c6206e10dbdf25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NativeDriveCameraManager.finalizeVideoSegment at line 927. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveCameraManager.kt"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"015fcf4d4822dfc9e8dec2fabe2f7c4b3b8dc78eaa9216438652660ba720eeed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/detectors.mjs: infra/aws-central/service/detectors.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in detectors.createDetector.yolo at line 391. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/detectors.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d8bfa3c0b44925cadbfa0a15bcf9f1bca26682adf2d0d79436981ee96d3707"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in NotificationHelper.buildNotification at line 66. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bde1477299fbc959f5077eac686d95049351d80989a0b12200c871a2ca76fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/tools/india-ward-coverage-report.mjs: infra/aws-central/tools/india-ward-coverage-report.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in india-ward-coverage-report.render at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/tools/india-ward-coverage-report.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"08794f1b1662862e14dccd68e9c6429393706666afbfa736080023c3ef99ce64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/ward-tenders.mjs: infra/aws-central/service/ward-tenders.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in ward-tenders.matchWardTenders at line 579. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/ward-tenders.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8178dde139a490c63f19d3d3a0d87aab250508b3cd9b5c18b74bd4674f1e8ddd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/tender_scope.py: tools/tender_scope.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in tender_scope.is_road_surface_contract at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- tools/tender_scope.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tender_scope.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"af16ebe75ffcdf4d6315f51cd9fa935a619fcea0970eea3099f4bddb1db2e86b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/india-ward-tenders.mjs: infra/aws-central/service/india-ward-tenders.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in india-ward-tenders.wardMarkersIn at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/india-ward-tenders.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f3cb21e420997d4a8c1fb4e6449d1dd89cd727d2767707faa796a81b1711ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/tools/ward-tender-experiment.mjs: infra/aws-central/tools/ward-tender-experiment.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ward-tender-experiment.main at line 42. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/tools/ward-tender-experiment.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ward-tender-experiment.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1076d133cc6de579a604eb507bc7c0819a35b8296b436aa60acb1e29f109676a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/tenders.mjs: infra/aws-central/service/tenders.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in tenders.matchTender at line 45. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/tenders.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/tenders.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefd499957210ee50bea5c2f9830df081e252f7073f47471894d4cf0976a974d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: server/src/index.js: server/src/index.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in index.reportCandidate at line 2353. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- server/src/index.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1bf68a64507dbe8a13fdcf00a1f968fc9346e57c370d59d300b578d045d218"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveLocationProvider.kt: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveLocationProvider.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NativeDriveLocationProvider.replaceRegistration at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveLocationProvider.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveLocationProvider.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66115965834afde12401e51437e8dbb9343a375f8605b6cb7b523ade3b6b320"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt: android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in UploadWorker.doWork at line 150. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/UploadWorker.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fd753a1c2596b38d2e1ff8e62f8b3077fbd058ca20d445d769c6f12bda2778"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ml/classifier/finetune.py: ml/classifier/finetune.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in finetune.main at line 141. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- ml/classifier/finetune.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/finetune.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed2a280ac9105eaf7eb02f1acf53c746f082da489c213b490c0c42412788597"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/geo-cache.mjs: infra/aws-central/service/geo-cache.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in geo-cache.createCachedGeolocator.resolve at line 54. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/geo-cache.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geo-cache.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"613b7e58a4cb9bbc761de5949209ffe4d0fab251c8f14387b6cf542442587422"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ml/classifier/evaluate.py: ml/classifier/evaluate.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in evaluate.markdown at line 205. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- ml/classifier/evaluate.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/evaluate.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"403a5f8df37ef2724b36906e71ffa1eea28ae785a7e0f3b021d9331b87753ae5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/service/health/canary.mjs: infra/aws-central/service/health/canary.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in canary.runCanary at line 23. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/service/health/canary.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/canary.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e6ae7e5483fa5542f6189c50a8f9ef5463d828f7ef667e7201d6eb1c337dae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/build-top50-coverage.py: tools/build-top50-coverage.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in build-top50-coverage.validate_catalog at line 267. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- tools/build-top50-coverage.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-top50-coverage.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f6d6ca5d3219f6460ad051acea3a0fa47759d9e30588f6045c5a56f61b1e3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/tools/ward-tender-vocabulary.mjs: infra/aws-central/tools/ward-tender-vocabulary.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ward-tender-vocabulary.main at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/tools/ward-tender-vocabulary.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ward-tender-vocabulary.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf41dcbd358b6002985728d2d29ded3c32c9e28c9b0e83782ccce0e7153408b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt: android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NativeDeduplicationEngine.checkAndCommitReport at line 144. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1453c239352f2ff58e561b3f4e7d16add18e495a95b89bc8a3f4167e117fb566"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/pull-india-gepnic.py: tools/pull-india-gepnic.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in pull-india-gepnic.main at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- tools/pull-india-gepnic.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-india-gepnic.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"979abb2dc00bb00072d248bd4cf399c115073d01baafd61ea8226469e1ea0694"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: infra/aws-central/tools/build-street-index.mjs: infra/aws-central/tools/build-street-index.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in build-street-index.prepare at line 1463. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- infra/aws-central/tools/build-street-index.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5310f68e01c35f1cdf041c7cfa3545927f8e8e84670466039da72f5aa81f526b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ml/classifier/build_manifest.py: ml/classifier/build_manifest.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in build_manifest.main at line 111. 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-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 18:18:09 \u002B05:30\u0027 --until=\u00272026-10-14 18:18:09 \u002B05:30\u0027 --full-history --no-merges -- ml/classifier/build_manifest.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/build_manifest.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a973fce6424186ff7f2d6301c385fa995bb24b0b56f285a16e01e8c5adaa8adf"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060android-app/android/app/build.gradle\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/build.gradle"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"465451b752a9f80932f8bd15922fd2d47a21087b44db7badbbe109ef16034774"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0022Ward No.256, Moosapet Circle-53\u0022: Moosapet is the circle, the ward is Mothi Nagar.\u0022 repeats the code it sits on: 8 of its 8 words (ward, no, 256, moosapet, circle, 53, mothi, nagar) are already in \u0060assert.deepEqual(names(\u0022Recarpeting of BT Road from Babbuguda Culvert to Neelima Hospital in Mothi Nagar, Ward No.256, M \u2026\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":"infra/aws-central/test/india-ward-tenders.test.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aaf8e3565bba9c6e1b1cee1331cada2ca3e832adcb797da4fb368964194077"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (56353 LoC, 163 module-visible types across 13 directories) overshoots its size bounds. 2 of 11 build unit(s) (Gradle, Python, npm) overshoot their size bounds, lowering Project Cohesion to 6.4/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"requirements.txt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5e6c5b01689366dfd955e9a5982baa6d1574c50f60c029ab1c2f9e36ca22e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060android-app/android/app\u0060 (32913 LoC, 300 module-visible types across 12 directories) overshoots its size bounds. 2 of 11 build unit(s) (Gradle, Python, npm) overshoot their size bounds, lowering Project Cohesion to 6.4/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/build.gradle"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"311baf1cad54709a1c106deb92a31f069d56f143676c83b1d73b57a9f1038eb0"}},{"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":"516f1a5d510403417f1bf139489e1b81f5440ebc04e8196d022c76c2b727c373"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"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":"112d06d64db65acf6469c73db2963be1352c9eb7dfae0a639af464bc74704d65"},"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":"62493dcdb82bb288203d1aff45bfe7609c187405447c7c630eb40a0c3784de17"},"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":"9015878bae64a49fcf2d18632d77e1c8a5c7323a0387342d1a35e5082cfa78b8"},"taxa":[{"id":"CWE-326","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"962a73b16c80104454630dbef8e92738d74637d2a88ca4861dc6560edb4393b7"},"taxa":[{"id":"CWE-611","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":"85311d5f4300c3f4620201b20fade7b4dfa8d0a0aed6747eedf9e1a32c8a86ae"},"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":"34a372a9107275f050a817868008d8fbd1989df86f8abc0d1d1c1260c03680cb"},"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":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd8d0913bc20cd7181c5a4344f7cf750705da2d1764733bba39eb9cbfea2f545"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0df3e9b6cc700c90dc7887752464c7d907995ceb185a91189ab7e76c37833b3e"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d00f7cbe4df3962cb69603a5f4b406796ad3cf9ce12730df9d00ee9cf0068ee9"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23d8d99f9e194aa6c8b729215c2e9cfdf27a90406936cff077487a2e00886dfd"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"557c02b6267318d27cca6d81ad51b5f7712d570bdab0373850ee011b4b3c8a58"},"taxa":[{"id":"CWE-778","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0bd7aafe3aad583df4514aa5758ef4b8a731e7112d0b6cc0ea6bee0740ccfe8"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29de52a562d59768c8b345eb0b700bf34a43fe77582352684f704d1981b2a62c"},"properties":{"dependency":{"package":"pillow","version":"11.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112899","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-112902","BIT-pillow-2026-114501","BIT-pillow-2026-25990","BIT-pillow-2026-40192","BIT-pillow-2026-42308","BIT-pillow-2026-42309","BIT-pillow-2026-42310","BIT-pillow-2026-42311","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-165","PYSEC-2026-2249","PYSEC-2026-2250","PYSEC-2026-2251","PYSEC-2026-2252","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-2874","PYSEC-2026-3451","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","relation":"direct","declaredRange":"11.3.0","reachability":{"kind":"production","file":"infra/aws-yolo/service/detector.py","line":376}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82db4a716590bcee770387baacaed9fed506baa07386b3fb76c6d472b8a9c84e"},"properties":{"dependency":{"package":"pillow","version":"11.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112899","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-112902","BIT-pillow-2026-114501","BIT-pillow-2026-25990","BIT-pillow-2026-40192","BIT-pillow-2026-42308","BIT-pillow-2026-42309","BIT-pillow-2026-42310","BIT-pillow-2026-42311","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-165","PYSEC-2026-2249","PYSEC-2026-2250","PYSEC-2026-2251","PYSEC-2026-2252","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-2874","PYSEC-2026-3451","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8591ef996b9ddbc94f27ade973ad73d930235420ae2dae4fd8209a161220d83d"},"properties":{"dependency":{"package":"pillow","version":"11.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112899","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-112902","BIT-pillow-2026-114501","BIT-pillow-2026-25990","BIT-pillow-2026-40192","BIT-pillow-2026-42308","BIT-pillow-2026-42309","BIT-pillow-2026-42310","BIT-pillow-2026-42311","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-165","PYSEC-2026-2249","PYSEC-2026-2250","PYSEC-2026-2251","PYSEC-2026-2252","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-2874","PYSEC-2026-3451","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"028e8199a96f8cfb2f55b55b876f00c022e96c5f240c4dd2805f196829b977ce"},"properties":{"dependency":{"package":"@capacitor/android","version":"8.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"8.5.1","relation":"direct","declaredRange":"^8.5.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54d606201c6c18885e9a7cdfc550eb7572fc2b2885e37912a553908dedfeb160"},"properties":{"dependency":{"package":"torch","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["BIT-pytorch-2025-2999","BIT-pytorch-2025-3000","BIT-pytorch-2025-3001","BIT-pytorch-2025-55551","BIT-pytorch-2025-55552","BIT-pytorch-2025-55554","BIT-pytorch-2026-24747","BIT-pytorch-2026-4538","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-193","PYSEC-2025-194","PYSEC-2025-195","PYSEC-2025-203","PYSEC-2025-204","PYSEC-2025-206","PYSEC-2026-139","PYSEC-2026-1856","PYSEC-2026-2286"],"severity":"high","fixedVersion":"2.10.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a279bda69e4c16ecff3683a9a59590b600a1b92514a883a7cc3fd91de1746ac0"},"properties":{"dependency":{"package":"onnx","version":"1.19.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-103","PYSEC-2026-104","PYSEC-2026-2239","PYSEC-2026-2240","PYSEC-2026-2241","PYSEC-2026-2689","PYSEC-2026-3587","PYSEC-2026-3876"],"severity":"high","fixedVersion":"1.21.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"490ded7a7b9a892a3f5ab1d6541ec7635b1114ff70b625287d9191de55f0e9a1"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.0.10","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"380262753009a1975c70546f8d6baf2ce0898dafa68921cc34c3796dab75a3c0"},"properties":{"dependency":{"package":"picomatch","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"014bbd9b990c2f71af09463ee2bb6f0a439c2caa6f5a374c14f053e749f0e141"},"properties":{"dependency":{"package":"python-dotenv","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-2270"],"severity":"medium","fixedVersion":"1.2.2","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":"f8074281183d8faceb949a6723cf5ee9c1e774327515e85268f3e13981944ca8"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5489631a04e6843230241683bac0ac9a22e01909f1e0b6784fb574422f80b41"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e20d814287c983747c7e13beff772a5ace4f2911823da44780fb0e36ab9f1e0"},"properties":{"dependency":{"package":"uuid","version":"7.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"11.1.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c869634c083fe39b952e93ea80869d0217b19818c13466c8a48a0c6ba90b896"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17ec406d65b90d015d241660f5c3342fcb9ee6e60dea75030d2f530dba5aeb93"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cdd6d1604ac9afb8826873c95e6e4be9320c5677dea0bddd45d97ded2ed15a23"}},{"ruleId":"D31","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":"fbc659c808f311e08c9d0d78e94865879d7c31d57591d635dd89fa50e0bbc401"}},{"ruleId":"D31","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":"3b430d9e2879bc1ec68b6d88844d0a98acb5912306a77af659ddf0e6302bbaa2"}},{"ruleId":"D31","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":"6e2d31d49f0d68c05d329b9c954e13b55530af6efb45ba74e1c77642e5cb730b"}},{"ruleId":"D31","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":"245f007adeb1f4396318609a5c394a2c6192591cdac90be365f8f8c71fdb1560"}},{"ruleId":"D31","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":"2223a8b0c3de5baeb7e9889294aef78baf0f9b8c7008b2083076341071423a21"}},{"ruleId":"D31","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":"e55e5930614a754acbda1f8d7ecc8cc13b77346a905127279a41ca1a92e9ee81"}},{"ruleId":"D31","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":"3c058c15e4a0c3a72a30a04247e21400fb527203cf25c606a2ad4ae8f3931143"}},{"ruleId":"D31","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":"790cf5a52cfa815964daadcb38663bea158c01d49108ceba3157f12d2f85a85b"}},{"ruleId":"D31","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":"0851db62d349b4a380b2c7ad5816028ab076113e8219cb8628ca8cc48cf7c8c5"}},{"ruleId":"D31","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":"539b0992e98bdf7f088a83471c3b5b5ab54225c11223e4c5a55e4930fe8486c9"}},{"ruleId":"D31","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":"73e856b14dddacf41f31b3a82856c756a59a53d5a54b9d1116a357c150055fb9"}},{"ruleId":"D31","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":"a70c33f6ab7b0998eabd628b45f8f2a5833319b460da2c6cb4784d20d5e1073a"}},{"ruleId":"D31","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":"055a06763bdb8d5010daaf3f296039e0b7494d7d08bdabac18ee74fe2527d5ed"}},{"ruleId":"D31","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":"3b32df4d4b525bb14df54177f86ccde7a3de9f03ee8ab0524800b33b76d5d0bd"}},{"ruleId":"D31","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":"ae6cea35659a99f1b8dc7722d55e274e743b0828bf2dc46cfae12cb31e8fde9c"}},{"ruleId":"D31","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":"56b38a64d63c6d1a7d18c603ba4515c92f513c26611b19fc85f11663c77f0d5c"}},{"ruleId":"D31","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":"945dd896913a77350e539f25f4f2efd7c4a98e94d1ba0324ffca46caf01b88ba"}},{"ruleId":"D31","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":"05cd06db2b326ed85df130285517d3bab28005cbe12a5c14c05a822c1cd32d71"}},{"ruleId":"D31","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":"0b94ecb8b59b22c95cab24ae7d94c0ea04100ea82fa139f441ef48cac9f47092"}},{"ruleId":"D31","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":"8e3a07e6ed3a8d8af6b71fbe0760e35c8ebf7339ef7ea55a5efbe6e51cef3003"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"191b839394e785569aec2094ec371786ae7935f5d1860d7c0b286c56032cbf30"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6444a82db137807cc0fed44c98986ed40bf636e29640d4f9825973e681a84e8e"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"684f6c1b811ee174afa51489f65216ed3ac7cb534caf0d0fdfba8fd73c29f708"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6afd89d8fcf655697eaead122ef3de805e9b6df78a2095b512e1c15d87c9459c"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e19c4a72f28b8117bc862586f736145ffaddf522a3880d9d6d80209ebe08cb0"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9895953aafc0462aef134d29d3315b8b2c1919f827b13bbc7b761757b9a1d0f0"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5e7c010afa01ebc93d4513884d28cfe544880154da9bf4c1f1fba807336998b"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22e35ed7875bcaad9c0b478ee47bc1defaa2e7dc0ee424a18f76cc7d7f0d5796"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21f12fdd4b07e412093a8158deb32bcd70d277a985272b3f484e94f77cd41490"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00a7a7340583cffdbe561a38aa7cdca750f45adea33b10c101ec69ec97b9a081"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a777b5737ae199cc81e861bacb8a91c29b8c5f95ac014ef349c41076e5573e6"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d872cefe57e65c2c408a32f91ccd10e1734eb3cc918c68d5418084a3e7af314"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c5f7e39ee2e5bd17191b56919b5d505509dfab8f83c7d88c5bafff4d042c492"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"972f15da26318b4cb4049f5262883f2873dd773a575c4fe9dbe298235146c03e"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cee9ed585b77e1fc8181b53c7ffd05a03f105fa2d01de8dfe65584737b3ad4ed"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5499875d8e20993fd729963fb67f6cf591bbec7e46e0041b759623dd4c1037f1"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"416b6250f3126e9c3be437b7baf5efbccd303862d5f3e41038e39572accf38e4"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1409ae9ec474c3dbb6767b8c71cb5a8930a4930c4a4915a10ce1fa50e11a07d"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cd71e9aaa4cc16788f96e8f1de4c8b1b07c29fe4e4a80acd526720e913ad32"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab1dd7b2dab5015fe8bc5414032edbafa494fff72e26718795a70ff33dd9f37"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0708d54d172d4a6b85d32686d9056934d440064756faae62561c752ab2628344"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060details.more summary::before\u0060 moves (\u0060transition: transform .15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cafbb667edfb53562758262fa2a48d2c538621156ea2a21085653388fb472ff"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.group-head .caret\u0060 moves (\u0060transition: transform .15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5498aa41035379c80d5b6567daf5fd9eaabed277f0f06f12e399060cd781ea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.ward-tenders summary::before\u0060 moves (\u0060transition: transform .15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fce882e5e495ca86527e59397240220bc9ddbf781b294c8ecfac6d12455777"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spin\u0060 moves (\u0060animation: s 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/index.html"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44d51ba2ac5b215c77adf18ed9250124ec51c1cef3d545cae51d3ebd9f47326"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060details.more summary::before\u0060 moves (\u0060transition: transform .15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2fdd9d8ca00bd6a93763bd2f9cbc3a7e19b31ef4c8e5364abfa79d19398678"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.group-head .caret\u0060 moves (\u0060transition: transform .15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da2275c2f64b2cd440f7a6b14bc82654a387817983eab7e0e9458dfcc0c2d39"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.ward-tenders summary::before\u0060 moves (\u0060transition: transform .15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a45adbf31f844b695f71a971171a226d8ca986d602a873c89bdeb28003a984"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spin\u0060 moves (\u0060animation: s 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/index.html"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f7947737e51efd4bea27c99f7689dfd51820fed148fa88db0f91e3a4b0e831"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ReportDao (18 abstract methods): \u0060ReportDao\u0060 declares 18 abstract methods: \u0060insert\u0060, \u0060update\u0060, \u0060getAll\u0060, \u0060getAllIds\u0060, \u0060listForHome\u0060, \u0060getById\u0060, \u0060getThumbnail\u0060, \u0060getFullPhoto\u0060, \u0060exists\u0060, \u0060getByServerPotholeId\u0060, \u0060centralWorkIds\u0060, \u0060deleteById\u0060, \u0060getByDriveId\u0060, \u0060findInLatBand\u0060, \u0060findAcceptedByDriveId\u0060, \u0060findBySightingDriveId\u0060, \u0060count\u0060, \u0060deleteAll\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/db/dao/ReportDao.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c5b963362a54dd4f863c8f3426a6383c9e6133b42236f51fb12fd4961478b"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ReportDao (17 abstract methods): \u0060ReportDao\u0060 declares 17 abstract methods: \u0060insertReport\u0060, \u0060updateReport\u0060, \u0060getAllReports\u0060, \u0060getReportById\u0060, \u0060getAllReportMediaRefs\u0060, \u0060getReportMediaRefs\u0060, \u0060getNewestReportMediaId\u0060, \u0060getReportMediaRefPage\u0060, \u0060getUnsyncedReportCandidatesAfter\u0060, \u0060getUnsyncedReportPhotoDataUrl\u0060, \u0060countUnsyncedReports\u0060, \u0060markReportsSynced\u0060, \u0060acknowledgeAndReleasePhotos\u0060, \u0060getCandidateReportsInLatitudeBand\u0060, \u0060getReportsForDrive\u0060, \u0060clearAll\u0060, \u0060deleteReport\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/Daos.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"19840f916d9f184579d226539081732b4dec85f0c41887098e3367155d355d63"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: DriveKeyframeDao (17 abstract methods): \u0060DriveKeyframeDao\u0060 declares 17 abstract methods: \u0060insertKeyframe\u0060, \u0060getKeyframe\u0060, \u0060getBySessionAndCaptureSeq\u0060, \u0060getForSession\u0060, \u0060getPendingForSession\u0060, \u0060countPendingForSession\u0060, \u0060getSummaries\u0060, \u0060getNewestOwnershipId\u0060, \u0060getOwnershipPage\u0060, \u0060getOwnershipPageForSession\u0060, \u0060getPendingSessionPage\u0060, \u0060getMissingSessionPage\u0060, \u0060markAnalyzed\u0060, \u0060markPending\u0060, \u0060deleteKeyframe\u0060, \u0060deleteForSession\u0060, \u0060clearAll\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/db/Daos.kt"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf352162302aff0d6f0751980341d50ad5de04c51d022f9dac98ac6679328e56"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060warn\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/check-package.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff234d72d5425c4891a23ba65b9150616d02775f979daee31d1236318d7d942e"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060log\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/check-package.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a1b4d81783965b6ca1e2c9cb8bab231569cffc8be3fa91f7c8116129e8a5e1"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060info\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/check-package.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e373979a3c614a302bfe3363369defeaa216cb3d3c8c06f0ef2a55beebc8fb6"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060error\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3204b8e32c93eff5083647ccd3429fef1230943423addf103a6dbf389fa4f0"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060log\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a1e486b3927fdce01c183eb52fa16ea26feb9505034fd1e190ac55e86c18fe"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060infra/aws-central/service/health/handler.mjs\u0060 reports through \u0060console.*\u0060 at line 33 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":"infra/aws-central/service/health/handler.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afad7bea73593f9831a352190563f1406ccbaf6a26e7813c30d42eaefd021e4"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060android-app/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/package.json"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"998b1c8ac9bfc57f57d4ca6316f72f67eb39f6069c874032afb897406db434a9"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060wardsFor\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":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"34264c91e10d30edcde84c43c17cb3c96c9a40fbf2ff84b03c3564229bcc7222"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060wardsFor\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":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e35a041788bce0ddf3fd22fc97bb7bdb927b00579478c0d5453bddb4c66829"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060wardsFor\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":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d153a3f5427de2b70c7dfb1f96b437d28c9ff780580828df389ab1aab468c02d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060createScorer\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":"ml/classifier/lambda/scorer.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c49124d477c0e2924e00757a926cc4cdba0fbf3a732f22fd97f7294d4a82d67"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060createScorer\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":"ml/classifier/lambda/scorer.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ec9b7c851ca9bf1ed645538b8d0bfbc3a1a6618302b7d7caf59751e8462009"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060createLocator\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":"ml/detector/lambda/locator.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee2557c3f08e7952d233cf62e4ebf9c05ca9ff4eb492bc8cb56483d71974c96"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060createLocator\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":"ml/detector/lambda/locator.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa916f48b4ddc29c0dcdc8572555f478556fc85943b548be95d8004c5b84694b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"293924cd4dbfe884ffbc13458f72d0218bab530fae0247b15b9b4ff216b90ace"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1506d2e2576808529e02bb91c04840b64d33318fd5f46be7c77c148c40a84ffd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f856695b492f5fc21b314ecb4ae293472a63ef23efc5ae6ac5dc5b6ed591795"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"75751e2f9b3214954d78854a5629174520e93faedf8c81c94a8dfc16ece53298"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060appendFileSync\u0060 in \u0060judge\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":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cd97ce198060aa7724e923aec5fe0edf9cad42a6bb4f6001a2bcce0662b342"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to Array.from\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":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6c0833d385802180031a2123157fca3bdecf4ae6929e19ee0c84417371947e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"864e1081a187b8175823ed38df179485eedde02d2f9833cc3b3cbd3fafb36d9c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2aa1ed95055f3b907cd4f4e861c334168e87d9bb47670b0a02ce5e35c95c8f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e0e76191c42a277ad1702812d29efd45f9fe8c7d613b1f3f31ed07148061b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060once\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":"tools/harness/run.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02be6536b6ea8162e1030947d9e443793cd0f48f9dc31bb5611122b7d6541b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060once\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":"tools/harness/run.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8151f897584c1b1e5db5aed7eab6b9413ce08e1592508ebb21d2a76793d1b78b"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 141 plain JS \u2014 the untyped files are android-app/www/standalone.js, eval/audit_tender_coverage.mjs, eval/tender_coverage_gate.mjs, infra/aws-central/service/auth.mjs, infra/aws-central/service/canary-install.mjs, infra/aws-central/service/core.mjs (\u002B135 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Forked directory tree (17 identical files, ~31534 lines \u00D7 2 trees): android-app/www/ and docs/ are near-verbatim copies of each other: 17 files are byte-identical under the same relative paths (~31534 lines; the trees hold 17 and 467 files). That is one structural fact, not 17 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) \u2014 or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe6b4a407dcb32984f20c83f998cc24157142be2985ffc58f7cf94f12024b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Forked directory tree (17 identical files, ~31534 lines \u00D7 2 trees): android-app/www/ and static/ are near-verbatim copies of each other: 17 files are byte-identical under the same relative paths (~31534 lines; the trees hold 17 and 17 files). That is one structural fact, not 17 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) \u2014 or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d27eb91e67fda6e4e558357973fc477b6fe71851c734fe09d09c0cbea2a9876"}},{"ruleId":"R10","level":"warning","message":{"text":"Forked directory tree (17 identical files, ~31534 lines \u00D7 2 trees): docs/ and static/ are near-verbatim copies of each other: 17 files are byte-identical under the same relative paths (~31534 lines; the trees hold 467 and 17 files). That is one structural fact, not 17 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) \u2014 or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"702d2d99d48c99467c7c348ea85e4619e71d958af0ca1f2be0c64212b7aa7138"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (81 clone groups): 81 duplicated blocks under the repository root have copies in at least two of the sibling directories android-app, infra, ml, server, static, tools \u2014 75 of them are reported below, and 6 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 81 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 81 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 81 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":"android-app/www/standalone.js"},"region":{"startLine":8399}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da513b7ea0f0b23764ee3289f36b1639c9da612c5f9df3bbb0b8d14f0e9937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (1246 lines \u00D7 2 locations): android-app/www/standalone.js:8399 \u00B7 static/standalone.js:8399 \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":"android-app/www/standalone.js"},"region":{"startLine":8399}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb94e2e3d7cad1b67794098043852baf341037c312c3f28efc4c0fc0561ed12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (586 lines \u00D7 2 locations): android-app/www/standalone.js:569 \u00B7 static/standalone.js:569 \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":"android-app/www/standalone.js"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b7eeff0064fe18a5643d37edc6c20f805eaf95ca5e7009f27d740c7b9f7d8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (579 lines \u00D7 2 locations): android-app/www/standalone.js:4870 \u00B7 static/standalone.js:4870 \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":"android-app/www/standalone.js"},"region":{"startLine":4870}}}],"partialFingerprints":{"codehealthFindingId/v1":"706d2327afc8f13cc31ef1c6f9b37d1f84f0571f420dfcb346d5b872f9a2401a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (471 lines \u00D7 2 locations): android-app/www/standalone.js:7197 \u00B7 static/standalone.js:7197 \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":"android-app/www/standalone.js"},"region":{"startLine":7197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d919cbfa3f0e789cccc5d11059066130088978b6480674589b82387bddfa0e26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (457 lines \u00D7 2 locations): android-app/www/standalone.js:9964 \u00B7 static/standalone.js:9964 \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":"android-app/www/standalone.js"},"region":{"startLine":9964}}}],"partialFingerprints":{"codehealthFindingId/v1":"9663ed7b7bb3af2eac9b80446daaff9896224f7522c476a357ae54885c2237ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (411 lines \u00D7 2 locations): android-app/www/standalone.js:6696 \u00B7 static/standalone.js:6696 \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":"android-app/www/standalone.js"},"region":{"startLine":6696}}}],"partialFingerprints":{"codehealthFindingId/v1":"c564db6d515101d25dbbcaa1085d892a19428e8e6ea1ad6f3e2522612a822abe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (362 lines \u00D7 2 locations): android-app/www/standalone.js:10908 \u00B7 static/standalone.js:10908 \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":"android-app/www/standalone.js"},"region":{"startLine":10908}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1a799bd1c61c6fbf5d576274a53180dfc7fb3d9ce0ae649dbbc2871c157ec8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (340 lines \u00D7 2 locations): android-app/www/standalone.js:7987 \u00B7 static/standalone.js:7987 \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":"android-app/www/standalone.js"},"region":{"startLine":7987}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d5f5295ae64314a7fa1105e7d8df8e0ce9e8e2bacc104392dab677535fe947"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (337 lines \u00D7 2 locations): android-app/www/standalone.js:5946 \u00B7 static/standalone.js:5946 \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":"android-app/www/standalone.js"},"region":{"startLine":5946}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcc0da7e526f2459a77b3f78f7ff0b7a48df59ccc8c9a10ca04cfdefd771da0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (329 lines \u00D7 2 locations): android-app/www/standalone.js:11555 \u00B7 static/standalone.js:11555 \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":"android-app/www/standalone.js"},"region":{"startLine":11555}}}],"partialFingerprints":{"codehealthFindingId/v1":"804527d9de1e3a5b662ceb8b582726b70b3828be2c017ba812a53c6bdf539ef5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (290 lines \u00D7 2 locations): android-app/www/standalone.js:13182 \u00B7 static/standalone.js:13182 \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":"android-app/www/standalone.js"},"region":{"startLine":13182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bee600452c64ec9589a6520e1c403f049e4520b5ad45d127bb8fb420388e996"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (217 lines \u00D7 2 locations): android-app/www/standalone.js:11930 \u00B7 static/standalone.js:11930 \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":"android-app/www/standalone.js"},"region":{"startLine":11930}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0004434e75f96a9267be39ef2698dd0a97e211236df0b886172242f19589d18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (213 lines \u00D7 2 locations): android-app/www/standalone.js:279 \u00B7 static/standalone.js:279 \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":"android-app/www/standalone.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"56092fa277193a21836f9edf3ccf2dba0df5d43f025234b7b35be8d3f0233c57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (210 lines \u00D7 2 locations): android-app/www/standalone.js:10647 \u00B7 static/standalone.js:10647 \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":"android-app/www/standalone.js"},"region":{"startLine":10647}}}],"partialFingerprints":{"codehealthFindingId/v1":"826cfb50a249176209d43e111024727ac259f780498aa2fad720324bfb0ffcc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (208 lines \u00D7 2 locations): android-app/www/standalone.js:12644 \u00B7 static/standalone.js:12644 \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":"android-app/www/standalone.js"},"region":{"startLine":12644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28178460f9563def0834e41f40b1555193cbe711f015eaac4c787acc7506f84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (200 lines \u00D7 2 locations): android-app/www/standalone.js:4143 \u00B7 static/standalone.js:4143 \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":"android-app/www/standalone.js"},"region":{"startLine":4143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7547e91885fb28f4094fdebf5af56b7f3bd30332380530713e6506b8a267e827"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (182 lines \u00D7 2 locations): android-app/www/standalone.js:70 \u00B7 static/standalone.js:70 \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":"android-app/www/standalone.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6ff7dccad72113a3c49d7a1233e703885d4cfca2632971379a8a08ac7de2cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (182 lines \u00D7 2 locations): android-app/www/standalone.js:11346 \u00B7 static/standalone.js:11346 \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":"android-app/www/standalone.js"},"region":{"startLine":11346}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bbe965c50b452aa15a64dd176159e708686fe08447b869810898cbcc74497f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (176 lines \u00D7 2 locations): android-app/www/standalone.js:2709 \u00B7 static/standalone.js:2709 \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":"android-app/www/standalone.js"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c906ddbb9dbda735f508ea7ae93f53055360d9f1ecb16dfc15b2b4501bcf6bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (176 lines \u00D7 2 locations): android-app/www/standalone.js:3809 \u00B7 static/standalone.js:3809 \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":"android-app/www/standalone.js"},"region":{"startLine":3809}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a50ea1edc0c73b0d4853ff36d41adb1961016be8fcd7acceffce5795aa4be6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (173 lines \u00D7 2 locations): android-app/www/standalone.js:1713 \u00B7 static/standalone.js:1713 \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":"android-app/www/standalone.js"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff0eb61fc4e2c209981a9344219e1f357bb7bf7289ac8cb43cdca186deb62e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (171 lines \u00D7 2 locations): android-app/www/standalone.js:7800 \u00B7 static/standalone.js:7800 \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":"android-app/www/standalone.js"},"region":{"startLine":7800}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7de0ed01ea3c2f70c50a3e5a5aee1cb7e766bc615b14252142d86636bee8dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (171 lines \u00D7 2 locations): android-app/www/standalone.js:12982 \u00B7 static/standalone.js:12982 \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":"android-app/www/standalone.js"},"region":{"startLine":12982}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1d87ddf200e127273f0b238ef5e00d324925788ae760f70c1c78a5ae40b388"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (168 lines \u00D7 2 locations): android-app/www/standalone.js:12222 \u00B7 static/standalone.js:12222 \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":"android-app/www/standalone.js"},"region":{"startLine":12222}}}],"partialFingerprints":{"codehealthFindingId/v1":"39787e765a5d5c91f9b54826481863fbee9f51313d6579cb59caef3198750c93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (167 lines \u00D7 2 locations): android-app/www/standalone.js:5623 \u00B7 static/standalone.js:5623 \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":"android-app/www/standalone.js"},"region":{"startLine":5623}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff000e7365193c1bc1b970c0c5aabed020ecd142a799af034841578a0b59902"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (143 lines \u00D7 2 locations): android-app/www/standalone.js:1907 \u00B7 static/standalone.js:1907 \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":"android-app/www/standalone.js"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"043b1b90bc05e6f201505b5fc61ae1d2dd60a8504e657ecc71338cebf9d05f2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (140 lines \u00D7 2 locations): android-app/www/standalone.js:3585 \u00B7 static/standalone.js:3585 \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":"android-app/www/standalone.js"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"55edcca0519a6cc15abe70c56e612b011e042cbcc992121787f8fa36f29178d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (138 lines \u00D7 2 locations): android-app/www/standalone.js:6445 \u00B7 static/standalone.js:6445 \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":"android-app/www/standalone.js"},"region":{"startLine":6445}}}],"partialFingerprints":{"codehealthFindingId/v1":"52196c1803cf5daf9a5d1932a0efd5f8a89d3183ab2e0cbdb1473b40df1206e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (116 lines \u00D7 2 locations): android-app/www/standalone.js:10509 \u00B7 static/standalone.js:10509 \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":"android-app/www/standalone.js"},"region":{"startLine":10509}}}],"partialFingerprints":{"codehealthFindingId/v1":"109aaf2056b44d37713f75ebbe01e61eec1f621d4be1b3fa3cfde2f13a2c4576"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (113 lines \u00D7 2 locations): android-app/www/standalone.js:2415 \u00B7 static/standalone.js:2415 \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":"android-app/www/standalone.js"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41436dfb28c78655a729481becd383123795c64e0fc33e4b143b9726c736473"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (103 lines \u00D7 2 locations): android-app/www/standalone.js:2539 \u00B7 static/standalone.js:2539 \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":"android-app/www/standalone.js"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a460501e09b3d27c68964d1a6f07506e54d43e0a97a8da761f5faef3b6b59eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (98 lines \u00D7 2 locations): android-app/www/standalone.js:4426 \u00B7 static/standalone.js:4426 \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":"android-app/www/standalone.js"},"region":{"startLine":4426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b676d21a12e667b902ae9ceb1a096a59f74fc1af8f40003df0db31ae302233"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (95 lines \u00D7 2 locations): android-app/www/standalone.js:2110 \u00B7 static/standalone.js:2110 \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":"android-app/www/standalone.js"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de14c351ac981b866e642a893396bd16564746534fbaaf7c687470da938e4d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (82 lines \u00D7 2 locations): android-app/www/standalone.js:12469 \u00B7 static/standalone.js:12469 \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":"android-app/www/standalone.js"},"region":{"startLine":12469}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fea8a8046f14c24576472cb6aeb799e93643af2b82c06eea78b196670e82ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (80 lines \u00D7 2 locations): android-app/www/standalone.js:4027 \u00B7 static/standalone.js:4027 \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":"android-app/www/standalone.js"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"703cbc076e24da9de28e8caf58f497f62b7479683d1ac4d1136899dcbfb6b5fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2 locations): android-app/www/standalone.js:1629 \u00B7 static/standalone.js:1629 \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":"android-app/www/standalone.js"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb22d19a6a3b5d33cb3b17d8012c10d1f399cd3d08b8ac60b32b9f19fd48ea0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2 locations): android-app/www/standalone.js:12910 \u00B7 static/standalone.js:12910 \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":"android-app/www/standalone.js"},"region":{"startLine":12910}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9810b8bb1c6d1e9783d33876996d08c570914377b07466d15d5eefc5f13ecb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 3 locations): android-app/www/standalone.js:6375 \u00B7 infra/aws-central/service/tender-scope.mjs:24 \u00B7 static/standalone.js:6375 \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":"android-app/www/standalone.js"},"region":{"startLine":6375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd984e61c40d3fe420b49c01f3d6d4ddf3abc8f720cf2900178e2dee50aa49b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 6 locations): android-app/www/standalone.js:3189 \u00B7 android-app/www/standalone.js:3444 \u00B7 android-app/www/standalone.js:3768 \u00B7 static/standalone.js:3189 \u00B7 \u002B2 more site(s) not listed \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":"android-app/www/standalone.js"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8116690d0b031ea2453ff337c486eab33c41544e771c2340e80d0a4efd8470"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): android-app/www/standalone.js:4 \u00B7 static/standalone.js:4 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9c50fbb362baf6dfe52d72c38257e26f371c5bdd8c291ecaffaf8c926cde88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): android-app/www/standalone.js:4560 \u00B7 static/standalone.js:4560 \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":"android-app/www/standalone.js"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa126121b6817c5a3ac6ee0b2d7bf3a614852648e553759f9a40dd570e308a26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2 locations): android-app/www/standalone.js:3320 \u00B7 static/standalone.js:3320 \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":"android-app/www/standalone.js"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4856c8ebcc76c7fb6656446f8956f6c6e56b133d9ce460e6d28a3414c00674b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): android-app/www/standalone.js:4811 \u00B7 static/standalone.js:4811 \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":"android-app/www/standalone.js"},"region":{"startLine":4811}}}],"partialFingerprints":{"codehealthFindingId/v1":"e331a83390cd3d681032b77c6647ba987a14c8d2bb3f9f8a37aaa250b4520f86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): android-app/www/standalone.js:2229 \u00B7 static/standalone.js:2229 \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":"android-app/www/standalone.js"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4583958c31ea9dce002994a2a2d39c4721c31b72dcf0954e082903f84da10648"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): android-app/www/standalone.js:1587 \u00B7 static/standalone.js:1587 \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":"android-app/www/standalone.js"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4165dbb963597fec6cba1ca81aec5037fb13ffd27e2517085816df4325ed747b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): android-app/www/standalone.js:7742 \u00B7 static/standalone.js:7742 \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":"android-app/www/standalone.js"},"region":{"startLine":7742}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fb8726b80f8c2fbb8dad2994f259daf1536ebf807ee26180c62a65ab1cf601"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): android-app/www/standalone.js:5576 \u00B7 static/standalone.js:5576 \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":"android-app/www/standalone.js"},"region":{"startLine":5576}}}],"partialFingerprints":{"codehealthFindingId/v1":"407031ea28add9b58b1605bfcf15dd63d05671511ea2f300bad148e5656cdc22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): android-app/www/standalone.js:3484 \u00B7 static/standalone.js:3484 \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":"android-app/www/standalone.js"},"region":{"startLine":3484}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0daf4046e3a484f5b7e2794bb844a7f94293a27a24edd18a68b57f2870239e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 8 locations): android-app/www/standalone.js:4624 \u00B7 android-app/www/standalone.js:4675 \u00B7 android-app/www/standalone.js:4726 \u00B7 android-app/www/standalone.js:4777 \u00B7 \u002B4 more site(s) not listed \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":"android-app/www/standalone.js"},"region":{"startLine":4624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b572296e43480474ef587b6872d89c36433f94304ef2b6232f650f59ab544b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): android-app/www/standalone.js:4114 \u00B7 static/standalone.js:4114 \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":"android-app/www/standalone.js"},"region":{"startLine":4114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3d622673c43d04439eb9dd0347839208d4f1cd7c7905b5cf0242345ffa6e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): android-app/www/standalone.js:2074 \u00B7 static/standalone.js:2074 \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":"android-app/www/standalone.js"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"5070210decb5859086f9466767f1f31a7603a04533561df29c76745f8a20a062"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): android-app/www/standalone.js:3132 \u00B7 static/standalone.js:3132 \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":"android-app/www/standalone.js"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6817de2581e978e9ddd996aae9f663bf31585090745c0ca50b8b4fe89e6005b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): android-app/www/standalone.js:6651 \u00B7 static/standalone.js:6651 \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":"android-app/www/standalone.js"},"region":{"startLine":6651}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e2459319f95be61fe8c0beacdba5ca68bb5d63cc63646376c44ea11a88aca1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): android-app/www/standalone.js:3287 \u00B7 android-app/www/standalone.js:3547 \u00B7 static/standalone.js:3287 \u00B7 static/standalone.js:3547 \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":"android-app/www/standalone.js"},"region":{"startLine":3287}}}],"partialFingerprints":{"codehealthFindingId/v1":"79650fac5747b9199ad41a6dc017acaf648e80b67e3d0a71509162beeb248c2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): android-app/www/standalone.js:3998 \u00B7 static/standalone.js:3998 \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":"android-app/www/standalone.js"},"region":{"startLine":3998}}}],"partialFingerprints":{"codehealthFindingId/v1":"d475208b052c234790895fd0a4d324524c5f72d1039a0c6af9903b588ca2868c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): android-app/www/standalone.js:10888 \u00B7 static/standalone.js:10888 \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":"android-app/www/standalone.js"},"region":{"startLine":10888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3167ee475504328fcc7277098543bb7eebc35de2385068b0c238891d6c5ebdbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ml/classifier/lambda/scorer.mjs:30 \u00B7 ml/detector/lambda/locator.mjs:89 \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":"ml/classifier/lambda/scorer.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d50db5d5cb4615745394d80eaac814b87e28a694ad372b73988ee4c6b666520"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 8 locations): android-app/www/standalone.js:4654 \u00B7 android-app/www/standalone.js:4705 \u00B7 android-app/www/standalone.js:4756 \u00B7 android-app/www/standalone.js:4807 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"android-app/www/standalone.js"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ba997d9ba8baee5a3fa0259ab4f87c5718de99be722a041b283cbe00d92a4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): android-app/www/standalone.js:3562 \u00B7 static/standalone.js:3562 \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":"android-app/www/standalone.js"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01c3dc7cfad5235973d881241d52bf8b401d6843df7930903a758e8b34dc282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): android-app/www/standalone.js:6676 \u00B7 static/standalone.js:6676 \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":"android-app/www/standalone.js"},"region":{"startLine":6676}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce8060dc784532d51221444117d1f6a574d0b1386bfda975ade19d7efba89a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): tools/harness/run.mjs:73 \u00B7 tools/harness/serve-docs.mjs:23 \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":"tools/harness/run.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac205e1912914c9fcef6b56b51a8ec01245c59df90859b787f2dfdaf4daa06e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6 locations): android-app/www/standalone.js:3171 \u00B7 android-app/www/standalone.js:3426 \u00B7 android-app/www/standalone.js:3750 \u00B7 static/standalone.js:3171 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"android-app/www/standalone.js"},"region":{"startLine":3171}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa58dd9e300e68327862f8e3c23d5bb0c11013440150a3b9366cfbcab69ebd1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): android-app/www/standalone.js:12630 \u00B7 static/standalone.js:12630 \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":"android-app/www/standalone.js"},"region":{"startLine":12630}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aa1a17947b5d0475e86a3c2ab3c851db16d13807ef0e4ee5d31f8ba26ca9b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): android-app/www/standalone.js:2398 \u00B7 static/standalone.js:2398 \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":"android-app/www/standalone.js"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d67dfd05a3adda26264de2c835cc9c084a584786f90c9be6da44d52f4fe339c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): android-app/www/standalone.js:4714 \u00B7 static/standalone.js:4714 \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":"android-app/www/standalone.js"},"region":{"startLine":4714}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6e6926a7c9450a4c1723218cf1aac789fcfa3705191ced47e92725599cf324"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): android-app/www/standalone.js:4765 \u00B7 static/standalone.js:4765 \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":"android-app/www/standalone.js"},"region":{"startLine":4765}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b34179c4f7569f7e71b523ca0acd22f72f771d9de019570863ed75d0cc80ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): infra/aws-central/service/core.mjs:168 \u00B7 server/src/index.js:1591 \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":"infra/aws-central/service/core.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"384bddd19f59302f8d42b38521a999bd201897247957c24260bbf8d95c32bc17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): infra/aws-central/service/local-address.mjs:161 \u00B7 infra/aws-central/service/local-address.mjs:219 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46ce88b14891c1245474d94e4ac3af73864d8fec84808a2cd03034c0c0a88be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ml/classifier/lambda/handler.mjs:12 \u00B7 ml/detector/lambda/handler.mjs:13 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/handler.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed00d4ea7baf652982ae7ca94fa6090ba3397b46cfd5de27c02c785ae7a3e1cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): android-app/www/standalone.js:2098 \u00B7 static/standalone.js:2098 \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":"android-app/www/standalone.js"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e196fbf9504408faf05c00e2fce5d9a2edf4e4c6a47859ef3b1e76625eaa0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): infra/aws-central/tools/verify-local-address.mjs:64 \u00B7 tools/cloud/eval/prompt_eval.mjs:81 \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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feaae9d91e82b3412eea300908d78bbc05ad87bbc73bef2be8afaae2973ca62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): server/src/index.js:2570 \u00B7 server/src/index.js:3437 \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":"server/src/index.js"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d061a80c0f59a4c04d3fb5a0c77877053c4af4f2ffcb5f77f5bb1a4b984670f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): android-app/www/standalone.js:3535 \u00B7 static/standalone.js:3535 \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":"android-app/www/standalone.js"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b84267e20d0d6b455a29d5d6faadb1fd2957b4fde418d85ec0c84a67402c2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): infra/aws-central/service/core.mjs:159 \u00B7 server/src/index.js:1580 \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":"infra/aws-central/service/core.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"774bbfc46376e4c4fb692f68d20ea156e1795b210bc2ae433d178df88699f778"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): infra/aws-central/service/india-ward-tenders.mjs:208 \u00B7 infra/aws-central/service/india-ward-tenders.mjs:300 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"521ec90d54c502747eed22471ac793dd738d95879aa177672478946d6ae02619"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): infra/aws-central/tools/build-karnataka-geometry.mjs:284 \u00B7 infra/aws-central/tools/india-notice-bodies.mjs:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 117 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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab9928c92e0b4d38a990c28c654d3482775600acf0a3c14ae0f80da0ed50b67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): server/src/index.js:2958 \u00B7 server/src/index.js:2974 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2958}}}],"partialFingerprints":{"codehealthFindingId/v1":"c276f657a6c021f2538fab61bc1b25f6b1627e9f2d9112599c2125e14278ffd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): infra/aws-central/service/core.mjs:185 \u00B7 server/src/index.js:1875 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cef65dbd573087198b4bc98e8cdbd816311a880ff1b8fffdbcd5a4c6b6ce30f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): infra/aws-central/service/core.mjs:762 \u00B7 infra/aws-central/service/core.mjs:804 \u00B7 infra/aws-central/service/core.mjs:848 \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":"infra/aws-central/service/core.mjs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc2a89d44f70bfec853dec26883f96e33a577b48ecdac8d8946afbec85973d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): infra/aws-central/service/health/rules.mjs:29 \u00B7 infra/aws-central/service/health/rules.mjs:426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"710b299227854d5526eedd1b66adb5b297ecfd50c61a0a99021c36176d3df524"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): infra/aws-central/service/spatial.mjs:14 \u00B7 server/src/index.js:1807 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/spatial.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"67202f3d5478b0ab3c1661fe5b160cf40dc284bd0a8a33ff47cdceca3e8e442b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): infra/aws-central/tools/build-street-index.mjs:1216 \u00B7 infra/aws-central/tools/build-street-index.mjs:1224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a0eff5c0dcf34801fa6d220914571ef079a968a140bc9d57c19cf87615255a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): infra/aws-central/tools/check-package.mjs:51 \u00B7 infra/aws-central/tools/check-package.mjs:61 \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":"infra/aws-central/tools/check-package.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"27710dd45ac4aa7000d226c05bb504b92865157f662f33797b220eedfeed1d97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): infra/aws-central/tools/prove-health-function.mjs:59 \u00B7 infra/aws-central/tools/stage-national-tenders.mjs:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"infra/aws-central/tools/prove-health-function.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8056a521249680131bb69738132589210a8cc235e4dfab5e8afe3cf0138298c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): infra/aws-central/service/geolocation.mjs:455 \u00B7 infra/aws-central/tools/verify-local-address.mjs:83 \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":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ed4cd6424cc8f7a8d55a2015231d6c9d741f01e3a89a4acd9f6d1672b974d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): infra/aws-central/service/local-ownership.mjs:175 \u00B7 infra/aws-central/service/local-ownership.mjs:252 \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":"infra/aws-central/service/local-ownership.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25cd7e41dba961ef5f01a9ef33ba608e1f326b7f352f6c581afffb42c4282fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): infra/aws-central/tools/production-health.mjs:30 \u00B7 tools/harness/run.mjs:30 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/production-health.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac07199c653d1414b6b981bd194924f768a5c9b974c65834e703541e69efcf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): infra/aws-central/tools/prove-health-function.mjs:59 \u00B7 infra/aws-central/tools/stage-india-wards.mjs:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/prove-health-function.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c36ad80590370bc0b9bde120c45ebc4432abcfeb2f0612da7ff5554bbe4270d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): server/src/index.js:1874 \u00B7 server/src/index.js:3560 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ff1dce06712fc814b168010aa027f0f4c983f42d4695724785296d14d3590c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): infra/aws-central/service/core.mjs:120 \u00B7 ml/classifier/lambda/service.mjs:95 \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":"infra/aws-central/service/core.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bfbf12ce992e2e1c6c8c941ea71e9798271a79867c7ab821c6d06247202f93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): infra/aws-central/service/core.mjs:483 \u00B7 server/src/index.js:1119 \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":"infra/aws-central/service/core.mjs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b162fb0e6364ec3f8cc829bfa3202f8a31f62b8d6ea61651966f8ec68db30a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): infra/aws-central/service/ward-tenders.mjs:244 \u00B7 infra/aws-central/service/ward-tenders.mjs:429 \u2014 the two spans are one implementation copied and then locally edited \u2014 123 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad4e12463822fc59a1ccba8b605ee6f3e1d1ea7cd58a2677cdba98b9c66fd09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): infra/aws-central/tools/build-street-index.mjs:824 \u00B7 infra/aws-central/tools/build-street-index.mjs:833 \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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e326c13bebbc75eda8a3b24a0038de999ce8aa40b378e7207c161c5c7312644"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): infra/aws-central/tools/build-street-index.mjs:1601 \u00B7 infra/aws-central/tools/verify-local-address.mjs:372 \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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acf95d2d7edd848da63a5153f9d8f95fc9a9c6437251ea336f5c43a582dbdc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): infra/aws-central/tools/verify-local-ownership.mjs:143 \u00B7 infra/aws-central/tools/verify-local-ownership.mjs:172 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"infra/aws-central/tools/verify-local-ownership.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84caea19e55ba1ff9d252f00342493f859dce61c2f26c0806744f662d1e447c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/service/health/rules.mjs:367 \u00B7 infra/aws-central/service/health/rules.mjs: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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8aae9612e8550c0453ba027c3a968b034bcb0a3eb9f525c4b7e8b304ba5a17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/service/health/window.mjs:87 \u00B7 infra/aws-central/service/health/window.mjs:93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/window.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8215d4adeb608b36087c27b26a9972bf44c6524be7c6f9136ce807af8eb85fb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/tools/build-india-localities.mjs:55 \u00B7 infra/aws-central/tools/india-ward-coverage-report.mjs:121 \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":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d423d88d2754c6622880eddde90a7d39edf62139e5da9f45a1adcc8b18f2bca0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): infra/aws-central/tools/build-karnataka-geometry.mjs:107 \u00B7 infra/aws-central/tools/snapshot-india-wards.mjs:797 \u00B7 infra/aws-central/tools/verify-local-ownership.mjs:334 \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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c952aaed84bdfe9ec3b88d7dd8b32d56acf86c7574cb386e2e1f980fb62dd52b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): infra/aws-central/tools/build-karnataka-geometry.mjs:164 \u00B7 infra/aws-central/tools/build-karnataka-geometry.mjs:206 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c61d39a83eaad23ee87d6d79242c4930e229596edb388e00d6aa7d717177d82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/tools/build-street-index.mjs:366 \u00B7 infra/aws-central/tools/build-street-index.mjs:673 \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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"071a68bd6bf41ae017a7617cff1305cc0e1f7dea9d13190898b61a86b730bb8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/tools/build-street-index.mjs:469 \u00B7 infra/aws-central/tools/build-street-index.mjs:490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfbfc91a8dd35bb62813ad46240536cfb5e8c48ab323549016870e973dac024"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): infra/aws-central/tools/build-street-index.mjs:1602 \u00B7 infra/aws-central/tools/verify-local-address.mjs:373 \u00B7 infra/aws-central/tools/ward-tender-experiment.mjs:155 \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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa7be702dc0e626f17e2ad14a66decc63e88011c7997e636d5ce79e834cd988"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): infra/aws-central/tools/india-notice-bodies.mjs:31 \u00B7 infra/aws-central/tools/stage-national-tenders.mjs:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"infra/aws-central/tools/india-notice-bodies.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8158ea5e91c7cf6ee0a280b2911edc39d6ee2fa3d134311fb5642492d0d9c8c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/tools/india-ward-coverage.mjs:73 \u00B7 tools/cloud/eval/prompt_eval.mjs:98 \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":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d10850540b32833aaf49548ef56d2bc604c4c1fc9b5f3ad13dd42d0f71fe90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/tools/india-ward-coverage.mjs:159 \u00B7 infra/aws-central/tools/india-ward-runtime.mjs:63 \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":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6986cc6a48b15bf78d7f99eea50f205e3c155a8fb9be766b61f7ad50419d20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): infra/aws-central/tools/india-ward-coverage.mjs:132 \u00B7 infra/aws-central/tools/india-ward-coverage.mjs:218 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5ce1d7d02d5bd68bb514a66d9c4a9133cdb3309d9824aef0846e310dc3601a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): infra/aws-central/tools/verify-local-address.mjs:218 \u00B7 infra/aws-central/tools/verify-local-address.mjs:318 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a723fee87dafcd8102ab09094edd018b9b0024492df20f91740f29731c5ff493"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): server/src/index.js:1330 \u00B7 server/src/index.js:1429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"095ade9705eac1a297ac6b3151a4b203af7c32265363070c484f7bf3223c760f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: infra/aws-central/test/tender-scope.test.mjs:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../tools/harness/release-verdict.mjs) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/test/tender-scope.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96028c1782cb587e67db024235c086ec53ea836269900299a473339ebdd27aa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: ml/detector/lambda/handler.mjs:11 reaches into another package with a relative path (./service.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/lambda/handler.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd67e9671b8ec6786b8c1f7ff604ff9dae0f515be902709b63f7209b59472c44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createReport (cyclomatic 298, cognitive 337): createReport has cyclomatic complexity 298 and cognitive complexity 337; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab57f6bbb7ecd08f3f8492740e805b2c3a80bdbcfdc0a2a5d870b7b591842ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createReport (cyclomatic 298, cognitive 337): createReport has cyclomatic complexity 298 and cognitive complexity 337; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9590}}}],"partialFingerprints":{"codehealthFindingId/v1":"054e7809555b61bea421184cd50b10178e0f5783cb4f82632efbb7ba179cef45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importNativeReport (cyclomatic 221, cognitive 208): importNativeReport has cyclomatic complexity 221 and cognitive complexity 208; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"android-app/www/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94d11b48c2bcac5d03aab0de2a8cbf043cbea83d2dd849be592596938e31cd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importNativeReport (cyclomatic 221, cognitive 208): importNativeReport has cyclomatic complexity 221 and cognitive complexity 208; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"static/standalone.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"639535337b3549f12dcd86e7f3aef5cc914a4b11217a8917cfb586891995b686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 164, cognitive 207): handle has cyclomatic complexity 164 and cognitive complexity 207; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"585c94d1efd23a40103c418ed88c4e486d7f0f94ea1a112b69cce7456180b97e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 164, cognitive 207): handle has cyclomatic complexity 164 and cognitive complexity 207; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bb10b4cec7324d77a692a630544bc53859314620a9fd9945733015ded38aea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareComplaint (cyclomatic 137, cognitive 142): prepareComplaint has cyclomatic complexity 137 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa7d5258bdf2e143ad370894a1ef1d90c0b53003f4575542c01f71f4a3d6d94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareComplaint (cyclomatic 137, cognitive 142): prepareComplaint has cyclomatic complexity 137 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0a95c82b7e4232095f9843f38c376e00e2440e6d78a5e88a515ab537639829"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoutingPack (cyclomatic 129, cognitive 98): validateRoutingPack has cyclomatic complexity 129 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"android-app/www/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"183bdf11ba32f39948d4978902d4f9605d29226c72d260e8c6cbc83ec93b101e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoutingPack (cyclomatic 129, cognitive 98): validateRoutingPack has cyclomatic complexity 129 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"static/standalone.js"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe1854d0ca1c67ea689a98a9869fc919862962755056cf7e48bece1c0bf140b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentOfficialRouteBinding (cyclomatic 126, cognitive 111): currentOfficialRouteBinding has cyclomatic complexity 126 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"android-app/www/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b71ad44cb495bdd8750229bf13cf07c942a35df954f7b722ba4e943eca708b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentOfficialRouteBinding (cyclomatic 126, cognitive 111): currentOfficialRouteBinding has cyclomatic complexity 126 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"static/standalone.js"},"region":{"startLine":12534}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aa94342f10e21d351eeedd8b7fb107f7a7a670c41613eee15620eaf8ed85e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedOfficialRouteBinding (cyclomatic 122, cognitive 86): savedOfficialRouteBinding has cyclomatic complexity 122 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"android-app/www/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae853b3569f395298e3f716b4915ec9e997149f3c5d55b58658a418f424d361"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedOfficialRouteBinding (cyclomatic 122, cognitive 86): savedOfficialRouteBinding has cyclomatic complexity 122 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"static/standalone.js"},"region":{"startLine":12333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7878e3b2fd091117dc87f0be32ba96a5182bdade2de14f61b6403249c1d10da2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeOfficer (cyclomatic 116, cognitive 167): routeOfficer has cyclomatic complexity 116 and cognitive complexity 167; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"9490529b1e9a4e1eec4a4fc06e78ebe449821fe641c4025568ebe69f2bce5cc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeOfficer (cyclomatic 116, cognitive 167): routeOfficer has cyclomatic complexity 116 and cognitive complexity 167; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"441a6a1030a0d932e1a25b9261d4526dd235aa22acacd9bce7605dbceb0e5882"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAddressModel (cyclomatic 107, cognitive 158): createAddressModel has cyclomatic complexity 107 and cognitive complexity 158; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4876cb0e288575968e8f815d7c9cb76db5025262e6af75054261fdcaf7de14c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedNonMunicipalLocationMatches (cyclomatic 85, cognitive 75): savedNonMunicipalLocationMatches has cyclomatic complexity 85 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"android-app/www/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ec989a5d79ebd2e1d3620c6221e42554eb0dd00c7cf8b67fff13f20b0da77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedNonMunicipalLocationMatches (cyclomatic 85, cognitive 75): savedNonMunicipalLocationMatches has cyclomatic complexity 85 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"static/standalone.js"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e14dabc4a24f88ef89079e04f493807f4f07ed97a346875f94ebfaee1e34b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadAgreementPack (cyclomatic 81, cognitive 27): validateRoadAgreementPack has cyclomatic complexity 81 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 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":"android-app/www/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dcc08e1893a28b1304a077a0fccc82742b6f0b4bdc91a789c57f2e78c7bd94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadAgreementPack (cyclomatic 81, cognitive 27): validateRoadAgreementPack has cyclomatic complexity 81 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 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":"static/standalone.js"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"909d87a4bfcea288f04b30fa7a0b4b98151e4c31bb7e7ad6c2484a4eeb121e0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCivicReport (cyclomatic 80, cognitive 78): createCivicReport has cyclomatic complexity 80 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"android-app/www/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ba927297885d23d3723a7d3cef5b3d7a38a69394caea6e29116306426b63a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCivicReport (cyclomatic 80, cognitive 78): createCivicReport has cyclomatic complexity 80 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"static/standalone.js"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcfb20b7e47fa1729e94ddf0a6514fce840f4050f12405f8c54c3e5b2bfb954"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openEmailDraft (cyclomatic 75, cognitive 74): openEmailDraft has cyclomatic complexity 75 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 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":"android-app/www/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb18b072d0c017bad532272e39fb4a13a4ca83a80900c7bbc3bc95e5d565c2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openEmailDraft (cyclomatic 75, cognitive 74): openEmailDraft has cyclomatic complexity 75 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 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":"static/standalone.js"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e67513ea274523b26c3d938067bb7743c1b585621bc49f96a05deb72746677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installRoutingAuthorities (cyclomatic 74, cognitive 96): installRoutingAuthorities has cyclomatic complexity 74 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":"android-app/www/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"615e68427ca3fd387e6bca4d22a1283f46dc82c42393c55cd6e91dda39fc8cfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installRoutingAuthorities (cyclomatic 74, cognitive 96): installRoutingAuthorities has cyclomatic complexity 74 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":"static/standalone.js"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bce07e56a1db35eb9f965cbce8c6ce6ca26fadc8ae68f3c7a66e0635e901648"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 71, cognitive 95): resolve has cyclomatic complexity 71 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"848de679e588b9b41171757d018ff9a9d9970fe000b812386fe5bac0b80dbf27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHighwayManifest (cyclomatic 70, cognitive 24): validateHighwayManifest has cyclomatic complexity 70 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 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":"android-app/www/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0476da7c60d8bbeafaa672cd463dbfd4c27d994d5be1e0b34ebb96d1d323b547"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHighwayManifest (cyclomatic 70, cognitive 24): validateHighwayManifest has cyclomatic complexity 70 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 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":"static/standalone.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48eb25eb9e14df7b9b17c79bf3cc070987e0b1fef9c5f1f62d9a6749ae996c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRegion (cyclomatic 67, cognitive 128): buildRegion has cyclomatic complexity 67 and cognitive complexity 128; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c665506676adcacf4a4f34271d5b069c7c54493dc6925f7d35002d0e289af1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMunicipalCityPayload (cyclomatic 67, cognitive 34): validateMunicipalCityPayload has cyclomatic complexity 67 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 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":"android-app/www/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ab5ecf0a18b7710ed21385dbd46556797ac07b114786f403c14420d86a4a86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMunicipalCityPayload (cyclomatic 67, cognitive 34): validateMunicipalCityPayload has cyclomatic complexity 67 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 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":"static/standalone.js"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"454afe3e39e39950a8a7241f1b224f6cf73213382b58f00c3451f6f403282e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrateLegacyComplaintRecord (cyclomatic 66, cognitive 86): migrateLegacyComplaintRecord has cyclomatic complexity 66 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53c2ad8e854a535142eb94748e2ed9f367fb62582830c66dcc0d551a96ad433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrateLegacyComplaintRecord (cyclomatic 66, cognitive 86): migrateLegacyComplaintRecord has cyclomatic complexity 66 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77be5a5013ca05c7b6abb2467eb66305d3558d53483261ebedbb7cfe281f189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadNoticePack (cyclomatic 64, cognitive 22): validateRoadNoticePack has cyclomatic complexity 64 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d5d0e5aefe10cf76e455e5d4b9e33b060d9d4d072ac790375543a51e5998ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadNoticePack (cyclomatic 64, cognitive 22): validateRoadNoticePack has cyclomatic complexity 64 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"57560d3d67ae990d2d3b388e97aee900028e14ed9134faa4592b1f9e01e158e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wardMarkersIn (cyclomatic 63, cognitive 81): wardMarkersIn has cyclomatic complexity 63 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c32ef1511034a4a84a7295922215eee42e00f967a2eae66f7badda54b28e7d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadAgreementManifest (cyclomatic 63, cognitive 14): validateRoadAgreementManifest has cyclomatic complexity 63 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":"android-app/www/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"375d3e2ef9b6a05f1dea5337f768ad53dfc1d7bc3dfd542b5ad80eb24b038793"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadAgreementManifest (cyclomatic 63, cognitive 14): validateRoadAgreementManifest has cyclomatic complexity 63 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":"static/standalone.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad265b40760ebd59030d66456127a260ea3a0c9a18872577d5c86a3e217eeb48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildComplaintOutputs (cyclomatic 62, cognitive 59): buildComplaintOutputs has cyclomatic complexity 62 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"android-app/www/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"917af1ae18f371a427ca16901aa17df420aa9b5a766430be2e1e01415ac840e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildComplaintOutputs (cyclomatic 62, cognitive 59): buildComplaintOutputs has cyclomatic complexity 62 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"static/standalone.js"},"region":{"startLine":7694}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fa5bd60bdcdfdc3654bf61b71f073de5824ef6f7e0cac127e16cd2dce8d649"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveJurisdiction (cyclomatic 60, cognitive 73): resolveJurisdiction has cyclomatic complexity 60 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcabbc2ad468c4e1165d0b7f83e0dd8bc23dbf091040a47d5765d777096c967d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 59, cognitive 55): report has cyclomatic complexity 59 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5252ddeca8b8b4a4c74bab36d3fd0faeebba553eb5d0111e2df91dd002ee25d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadNoticeManifest (cyclomatic 59, cognitive 14): validateRoadNoticeManifest has cyclomatic complexity 59 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":"android-app/www/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a449549458ef3888960049a299ebe34a4f8c20517d50219c866ad6dbfcdba16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRoadNoticeManifest (cyclomatic 59, cognitive 14): validateRoadNoticeManifest has cyclomatic complexity 59 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":"static/standalone.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7efb5939f3bb3c9b6b9e6743f040673790e292985b11fc16e8033cd967e623"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHighwayContractPack (cyclomatic 58, cognitive 29): validateHighwayContractPack has cyclomatic complexity 58 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 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":"android-app/www/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7b33aea5ff52988532660fd5521add759f9a936dc16b81dd1ddec7e19cbf42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHighwayContractPack (cyclomatic 58, cognitive 29): validateHighwayContractPack has cyclomatic complexity 58 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 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":"static/standalone.js"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"57216675949a55e1b4521989d3ebadd7bcaadcde4b6139700561b4e2eff5f539"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draftCivicComplaint (cyclomatic 57, cognitive 55): draftCivicComplaint has cyclomatic complexity 57 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"android-app/www/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33652121593088bc24517b2d173a3bc1981e96b6444537ad4a0a2588c2b4dd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draftCivicComplaint (cyclomatic 57, cognitive 55): draftCivicComplaint has cyclomatic complexity 57 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"static/standalone.js"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b4a71ed11a5b89e3794e56e4c4425891f84a65285d6dec5fe3e38c5b91e553"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normaliseTenderMatch (cyclomatic 57, cognitive 41): normaliseTenderMatch has cyclomatic complexity 57 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 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":"android-app/www/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7050b0ff86592fd3f32d873305f0974d240ffd272629232d84784fcdb5f73e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normaliseTenderMatch (cyclomatic 57, cognitive 41): normaliseTenderMatch has cyclomatic complexity 57 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 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":"static/standalone.js"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f974478c61e4417bea9c02568d1d42d0960a9ac8373fbcdb9048469efb597"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStatePackManifest (cyclomatic 53, cognitive 20): validateStatePackManifest has cyclomatic complexity 53 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a025e2511ec44ed5f9b351187cc8d36d3a001c6e588d3b9a7b1cf8be8e1e4b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStatePackManifest (cyclomatic 53, cognitive 20): validateStatePackManifest has cyclomatic complexity 53 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"f944ad7e511e9ea4194111443dd596daf2cb74fb40f066cc11b89e72c08ca202"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleProfiled (cyclomatic 48, cognitive 55): handleProfiled has cyclomatic complexity 48 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"02861f98d44951c376187616abbac806d667dacb6247a4451e07eecaa959f46b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeRepairEvidence (cyclomatic 48, cognitive 33): decodeRepairEvidence has cyclomatic complexity 48 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e522f78d95949501ee932019e351a91e493d25896be20e1e90c47ce301d6626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeRepairEvidence (cyclomatic 48, cognitive 33): decodeRepairEvidence has cyclomatic complexity 48 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"96605b4189cca3a086ac95ed44a59c33ec68218fc35c702c646472726be9f551"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContractPackManifest (cyclomatic 47, cognitive 14): validateContractPackManifest has cyclomatic complexity 47 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":"android-app/www/standalone.js"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9aa40f9dd5cf28ec13e321efa291341e746dea5b3ca3cb098c362744f979f68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContractPackManifest (cyclomatic 47, cognitive 14): validateContractPackManifest has cyclomatic complexity 47 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":"static/standalone.js"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e38a8ff27a4634fddb838c89003daa081771f6c561068f52955f8329ffb856"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 46, cognitive 79): render has cyclomatic complexity 46 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0630709ce5b06ccb66d8747655e6deb3d42d63add1b261bb0aab1b9b53c2ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function urbanBodyOf (cyclomatic 46, cognitive 58): urbanBodyOf has cyclomatic complexity 46 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/notice-bodies.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d08895778ec42dea8cec31876e3ff398447d8f9dfa99474b1d44d634031b4cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function titleNameKeys (cyclomatic 45, cognitive 103): titleNameKeys has cyclomatic complexity 45 and cognitive complexity 103; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"447213c405c2d7a402fe619544323bf358d909c8e866350c8ce0f34e7e07607d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryCivicRouting (cyclomatic 45, cognitive 49): retryCivicRouting has cyclomatic complexity 45 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":"android-app/www/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"45da036f384b2b6809fa9d5f5d2dea93b5b9909c3a4b7f3609cc6bd15be8a9bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryCivicRouting (cyclomatic 45, cognitive 49): retryCivicRouting has cyclomatic complexity 45 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":"static/standalone.js"},"region":{"startLine":11595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9010192ce735c44da219c69b403e0a99690e13ab318063b7e1708b6417b7bca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneStatePacks (cyclomatic 45, cognitive 48): pruneStatePacks has cyclomatic complexity 45 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"0326a6a965c5e4a7d18354e484c19c17e087fd1a8b02acffc5d6f587c5e724a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneStatePacks (cyclomatic 45, cognitive 48): pruneStatePacks has cyclomatic complexity 45 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd4ac7112ae2e6475a8bf488f668d7e91f5b516d820df5a2f6582e3d7296803"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowsOf (cyclomatic 44, cognitive 69): rowsOf has cyclomatic complexity 44 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae70f060a5406673d05be3b99e72427202afd604b0411cd8b1e98febb80fa01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeWindow (cyclomatic 44, cognitive 54): judgeWindow has cyclomatic complexity 44 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":"infra/aws-central/service/health/window.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c29b7f4a9cc8f66797238b4612f2b02d55774731cf3e2e4fa787c04dbe032a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roadEventMatch (cyclomatic 43, cognitive 34): roadEventMatch has cyclomatic complexity 43 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 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":"android-app/www/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d3be05a4ab12ebaa7e8e5e222c40afb9275d1293214fe3432af4309dcdb2fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roadEventMatch (cyclomatic 43, cognitive 34): roadEventMatch has cyclomatic complexity 43 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 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":"static/standalone.js"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82cbd2d0d3b000c8278f72c0c7aa6bcdf771aba3d2fd68ae604a84d41371953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMajorCityPayload (cyclomatic 42, cognitive 12): validateMajorCityPayload has cyclomatic complexity 42 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":"android-app/www/standalone.js"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3a05d7e15d365c283d8f0fd96c94f5477e24ba182d87ba819dd9b653315f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMajorCityPayload (cyclomatic 42, cognitive 12): validateMajorCityPayload has cyclomatic complexity 42 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":"static/standalone.js"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeb9cd7adb701ff29172aec124d18c706cc57a639b820f4baec2f64ba24e00e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCanary (cyclomatic 40, cognitive 52): runCanary has cyclomatic complexity 40 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/canary.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"155800eeba9e039913b50fd83546d4402e203ea0ef51d03732eb80bcb5b4eabb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function separateRoadResponsibility (cyclomatic 37, cognitive 31): separateRoadResponsibility has cyclomatic complexity 37 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f098b5cf98ad20f2f5528477cb901e9b403fc73f5febe2b574ec79ba57297470"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function separateRoadResponsibility (cyclomatic 37, cognitive 31): separateRoadResponsibility has cyclomatic complexity 37 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfed66a4ef2a69d82c526983645cfc193fc1f33fce0f457576fee6b019e9c51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureSnapshot (cyclomatic 36, cognitive 94): measureSnapshot has cyclomatic complexity 36 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"135d6c19e146eb8736200c33c10ccb10c1f0b0e634d458136727848377eeb649"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 36, cognitive 68): fetch has cyclomatic complexity 36 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":"server/test/worker.test.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"898132348327d6303636017f14cd02f6f5405b7c586daf3306c914484789489e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenderCoversCarriageway (cyclomatic 36, cognitive 49): tenderCoversCarriageway has cyclomatic complexity 36 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":"android-app/www/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1627c649a363fc8cd72775f7e4daebbb12eaa0df99a4185696543a29b08e3b92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenderCoversCarriageway (cyclomatic 36, cognitive 49): tenderCoversCarriageway has cyclomatic complexity 36 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":"infra/aws-central/service/tender-scope.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fc850318463a192980fbe651f96aa680b8a44844118021bdab574be20465d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenderCoversCarriageway (cyclomatic 36, cognitive 49): tenderCoversCarriageway has cyclomatic complexity 36 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":"static/standalone.js"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81c1cd4e8b132e97fa04b3454a7cf0dfb2e986dfa6380887795b0958e45e99f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openOfficialHandoff (cyclomatic 36, cognitive 42): openOfficialHandoff has cyclomatic complexity 36 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":"android-app/www/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"21be792559297ac56c2bc82f7806d070bef776bfffc78414d592f7e8971ecb57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openOfficialHandoff (cyclomatic 36, cognitive 42): openOfficialHandoff has cyclomatic complexity 36 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":"static/standalone.js"},"region":{"startLine":11976}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a659fcad6a61db711774a49c9b314dd9619ee75aacf76f49256b5db7a4eb2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generatedComplaintOutputs (cyclomatic 36, cognitive 36): generatedComplaintOutputs has cyclomatic complexity 36 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":"android-app/www/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d87abdb56bf002c77b8a5af18e8a1075a46957c3a46cfac9f574d2d94489078"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generatedComplaintOutputs (cyclomatic 36, cognitive 36): generatedComplaintOutputs has cyclomatic complexity 36 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":"static/standalone.js"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30d3c38c4a7b53ab824d3612e9a56bbda02f929c53a9d78c01a3399258533f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportCandidate (cyclomatic 36, cognitive 34): reportCandidate has cyclomatic complexity 36 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 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":"server/src/index.js"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f546d3b959269ac707f55289708022d1e93836186039dda747bc08e54fa6153c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryAssessment (cyclomatic 36, cognitive 32): binaryAssessment has cyclomatic complexity 36 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce82229621661a9132dbd4ae8ad6a0678e0e11cfd9fa4588030cb1c28edd9c36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryAssessment (cyclomatic 36, cognitive 32): binaryAssessment has cyclomatic complexity 36 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6f82af35fe8d0d3b4f870d35ff63861bc6699eafa9d438c463a16a0899b3b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 34, cognitive 45): main has cyclomatic complexity 34 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":"infra/aws-central/tools/ward-tender-experiment.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ab548b2532b235350345be69ad74975d22af6a263d1f80c06bbbccf9e0d851"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifiedContractForComplaint (cyclomatic 34, cognitive 20): verifiedContractForComplaint has cyclomatic complexity 34 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a0c2c7102a4c63f628a374fd620b64e2619931fc066c35ea229d3ec6f023af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifiedContractForComplaint (cyclomatic 34, cognitive 20): verifiedContractForComplaint has cyclomatic complexity 34 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7582}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0a6518ef4625ed47fe9713ffa03cf543c550f7463bc817dd349385c9ab7a5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchTender (cyclomatic 33, cognitive 38): matchTender has cyclomatic complexity 33 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":"infra/aws-central/service/tenders.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0302c9349ef8166512a6c008d4549562a793b6167d42960365cdbb0c662a22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairTargetMatch (cyclomatic 33, cognitive 17): repairTargetMatch has cyclomatic complexity 33 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"163cf713b62815b24facfd0d5bc8040dfcee7802d4be2d98f184777bb1ba9d23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairTargetMatch (cyclomatic 33, cognitive 17): repairTargetMatch has cyclomatic complexity 33 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16a367740705987d7d29d28f63819505bc4deb8c0344dba021368e25a5859d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function municipalCityRouteFromGeocode (cyclomatic 32, cognitive 51): municipalCityRouteFromGeocode has cyclomatic complexity 32 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":"android-app/www/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7bdfa16d1d43c00b5579f1f1b95c87bd75d532b61a512448a9f48e044a7136"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function municipalCityRouteFromGeocode (cyclomatic 32, cognitive 51): municipalCityRouteFromGeocode has cyclomatic complexity 32 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":"static/standalone.js"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbd1fd3bff1cc2c26509b21719331939579c33b5350ca2886e54b76fcdbc0d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signedServicePost (cyclomatic 32, cognitive 30): signedServicePost has cyclomatic complexity 32 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbded4863aa6da72fdc3963097fd563769fcc0f4db9752df3f722557fe84556c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signedServicePost (cyclomatic 32, cognitive 30): signedServicePost has cyclomatic complexity 32 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5d66b668fe88d23dcc45dbebffbcf99bf7f12d28bad91f7f3d716cecf00140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenders (cyclomatic 31, cognitive 57): tenders has cyclomatic complexity 31 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2721da27c1844d6ec3153037fcd22cc22284fcf70712cd56fb703deea4e1e492"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maharashtraRouteFromGeocode (cyclomatic 31, cognitive 43): maharashtraRouteFromGeocode has cyclomatic complexity 31 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9254e88beca6d449efb7b6072730a366f2d2d5d22afc91c81a971ef33e6a75c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maharashtraRouteFromGeocode (cyclomatic 31, cognitive 43): maharashtraRouteFromGeocode has cyclomatic complexity 31 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf1db78f79fb3f50c59d5184088ddc6a464f36452b45fb0cb55d6828cefb338"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 31, cognitive 39): onsuccess has cyclomatic complexity 31 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":"android-app/www/standalone.js"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a028bf0771162db94ad506e4eea89e63ae6c90df6d9aef76bd8621e8959bc83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 31, cognitive 39): onsuccess has cyclomatic complexity 31 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":"static/standalone.js"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad7dc17af45bad3c4d7d6c81d0428c47a7b5c7fe448d663638bf7ca03f6b3cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfficialHandoffRegistry (cyclomatic 31, cognitive 38): validateOfficialHandoffRegistry has cyclomatic complexity 31 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef51a87e55d85165d58e032150be4a6b3bd2ebd664d877a4d786cecfdb8da995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfficialHandoffRegistry (cyclomatic 31, cognitive 38): validateOfficialHandoffRegistry has cyclomatic complexity 31 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3c2b4b5d183efcd608e350cef644b00bbeb32bc2766e96bbdafdc65a44847b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 30, cognitive 60): compare has cyclomatic complexity 30 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1adf4872e1dd67dd124dbcfb670ec0db6e5c334a4fdf81a4301ed34814069f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tasks (cyclomatic 30, cognitive 43): tasks has cyclomatic complexity 30 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/run.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"186c525d5b05ba843a34c0d42918586a6ba79c4fe7c3e3f0a6563d2167a197c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchHighwayTile (cyclomatic 30, cognitive 30): matchHighwayTile has cyclomatic complexity 30 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":"android-app/www/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a233455127e18380baf6b1f40bd41dd2cb83e1a796dcf39ed439d1fc988c1cc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchHighwayTile (cyclomatic 30, cognitive 30): matchHighwayTile has cyclomatic complexity 30 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":"static/standalone.js"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca7b9e4db1288cef71427fb045df5b3b0bc3902f7475cebe6c93bf8bf3e71f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 29, cognitive 50): main has cyclomatic complexity 29 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":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d003e6a417bd7eb096d1eb494509a2e4bb625462d5cb9cda3f8a3aef00bcc6c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadLayer (cyclomatic 29, cognitive 43): downloadLayer has cyclomatic complexity 29 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/kgis-layers.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6304b38fc6bc25509a30a457042a34425af29a0d952ce24768387990b84daadd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 29, cognitive 32): detect has cyclomatic complexity 29 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dae5bdebab0804b5a45db979c3a4f3291d34c6e23ea2e79b24142ea5a859ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 10): (anonymous) has cyclomatic complexity 29 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":"android-app/www/standalone.js"},"region":{"startLine":3976}}}],"partialFingerprints":{"codehealthFindingId/v1":"c756c6c6df75a857813d93051e8bc08a1d9b8d7fadb5c0c4f0bdc0778be512a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 10): (anonymous) has cyclomatic complexity 29 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":"static/standalone.js"},"region":{"startLine":3976}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb182d3c3f179d5ab56a341b6ca73b6dec447a1e977c4ccc210c47d699261353"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addPolygon (cyclomatic 28, cognitive 68): addPolygon has cyclomatic complexity 28 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":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae684561a1cc0ced133d011042be6ab8017e5ad3ba86ecb35353c6dfb3818f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 28, cognitive 30): dispatch has cyclomatic complexity 28 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea2fb246bbca443520e6a05682847dd3b4f9a3842eee8f521d1a19af92a729"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeViaService (cyclomatic 28, cognitive 27): analyzeViaService has cyclomatic complexity 28 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 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":"android-app/www/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f24f3a8827587743927a2710a6e09f8c1ae8827bcd2e4576f9806b6fdc64fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeViaService (cyclomatic 28, cognitive 27): analyzeViaService has cyclomatic complexity 28 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 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":"static/standalone.js"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff020c7180e904957776da2efbca891f62933ca6c596da3a7d794503ee4ae878"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortlistFor (cyclomatic 27, cognitive 40): shortlistFor has cyclomatic complexity 27 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":"android-app/www/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"3767e37c23a24680e596a70711cca0671666dca7add357dc7ede91f5f6afe6c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortlistFor (cyclomatic 27, cognitive 40): shortlistFor has cyclomatic complexity 27 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":"static/standalone.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d8ece839fbdce19a3749370d5c90f77b423f4517e9af695abdbf07a027fdb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yolo (cyclomatic 27, cognitive 34): yolo has cyclomatic complexity 27 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":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0229621f74faf1c9f25d533754734300c5933a6fc59f74dfc0d6c7841a1e0ca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callOpenAI (cyclomatic 27, cognitive 32): callOpenAI has cyclomatic complexity 27 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc4fec356669680449155203ce664b1f3b78e80b9c709383ad1e3a12729b2fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function polygonsAt (cyclomatic 26, cognitive 64): polygonsAt has cyclomatic complexity 26 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-ownership.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf493fc8f3c5136aa31a3c2f7ae43bf0d7423a0373282999629f79149a8bbb35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenderShortlist (cyclomatic 26, cognitive 37): tenderShortlist has cyclomatic complexity 26 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd4bf557fbe744c00e76997ffe98e0d125e739d355dad59b48cef935680bca2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function placeFromFeature (cyclomatic 26, cognitive 30): placeFromFeature has cyclomatic complexity 26 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"de65ffadeb4d887005a48008b61d8594bd281b488d7eec0762c7aa31ed6d9250"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reverseGeocodeUncached (cyclomatic 26, cognitive 21): reverseGeocodeUncached has cyclomatic complexity 26 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb8755d3f29938590c5b76ff0dd4dbf24eabab8016292f05340ee20442c8ba5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reverseGeocodeUncached (cyclomatic 26, cognitive 21): reverseGeocodeUncached has cyclomatic complexity 26 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cb1838ef9035b96aa6c5d969a5ea8e399c491ed8b298a4176ba28c29704d44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRoadAgreement (cyclomatic 26, cognitive 20): matchRoadAgreement has cyclomatic complexity 26 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"55305b989c536066f7a8d1761742ff08201d0640ef00cb1fd680c06118077241"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRoadAgreement (cyclomatic 26, cognitive 20): matchRoadAgreement has cyclomatic complexity 26 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db62440dae9ad6b509daed826ec00aaa5bf989c8a7b6136a2613f775c25e1ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wardMarkers (cyclomatic 25, cognitive 49): wardMarkers 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7c18071d33b29e603ba7d0c2ed0100e996231e8d274d3fd82b61cb86b780fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evidenceForReport (cyclomatic 25, cognitive 24): evidenceForReport has cyclomatic complexity 25 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 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":"android-app/www/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"443336bde1a57489cc2d0502871693d30f49c02466f00a7f58272ab24a8d3bc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRequest (cyclomatic 25, cognitive 24): parseRequest has cyclomatic complexity 25 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 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":"ml/classifier/lambda/service.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"70474e92699afba4b0991b50e42a22945dab5ccdee3fea948aeab8f0b037aca6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evidenceForReport (cyclomatic 25, cognitive 24): evidenceForReport has cyclomatic complexity 25 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 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":"static/standalone.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8510bdc4312455b4525a5b7d0e631d79fcaecdfe9c472337feab65be1835836"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exactMetresToHighways (cyclomatic 24, cognitive 72): exactMetresToHighways has cyclomatic complexity 24 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-ownership.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e938b7f9306b99c75d202bd622739d6f872f649eabecb8e9753ec769260662c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pointOnSurface (cyclomatic 24, cognitive 50): pointOnSurface has cyclomatic complexity 24 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca5740d48c4e8c7118290cf955c11a1e310b25bb462faf7ccaf06ebdf022c4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answer (cyclomatic 24, cognitive 30): answer has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"8014d199ca879874d9617b78b6778e81830a5afc064db74e10b35c2a727a7430"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openai (cyclomatic 24, cognitive 28): openai has cyclomatic complexity 24 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":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea47ecff43b9384d69500d96fd82ccf2ac507c68dd5fe7b5a5e2d6bb865bb180"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serviceError (cyclomatic 24, cognitive 18): serviceError has cyclomatic complexity 24 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":"android-app/www/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddb33f3f1261eea638cd2604019a34670df8c47534d9494c8590f65b16d2b81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serviceError (cyclomatic 24, cognitive 18): serviceError has cyclomatic complexity 24 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":"static/standalone.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"3836445a9eaca8523650df08e89d87a0d80eb77618a0457b204839b7eaa1cb89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 23, cognitive 44): main 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":"infra/aws-central/tools/ward-tender-vocabulary.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"850562db6aa318071cc2ea94f01bf08865c27154f28df0ff129446f3287c6f70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexStreets (cyclomatic 23, cognitive 42): indexStreets has cyclomatic complexity 23 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f66057ff0ee7d6872f661915590a2df8d863b80e2d935871522d4f01c85a3a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function averagePostcodes (cyclomatic 23, cognitive 30): averagePostcodes 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4c75db906a84ef047277e6754d8def5087708146ca3833a82342b9a06c91b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordMetrics (cyclomatic 23, cognitive 22): recordMetrics has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce14ac4135e5b3b6a5a5f6b21425613a69dae12e821ec6a2759760f6f34c530f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 23, cognitive 22): dispatch has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"370dd41f952e0c31ee2c681f01941dd43a4b7042dc50b1ef8f065c624cb9ca80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySharedDetectionReceipt (cyclomatic 23, cognitive 21): verifySharedDetectionReceipt has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"0123c1948ac3eeb5b7c4f929cf344a849829998b746d853a4d2355affd067613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 23, cognitive 14): read has cyclomatic complexity 23 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefb9375dbf7c4821c679aaf85bf402de071e8a835cd2636544593fa7af070ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 11): (anonymous) has cyclomatic complexity 23 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":"android-app/www/standalone.js"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf6c64a522fe585f6e2c53e6aced1376dd321c4bddca7d52916552682adbd03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 11): (anonymous) has cyclomatic complexity 23 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":"static/standalone.js"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9aba97f253980d60e0fd398114dc39af0d392808eef8768261961c1d619fd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 22, cognitive 43): search has cyclomatic complexity 22 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c69a676996bc2f13fd49664e34f7b54b261ac67090d15605db38b931b1f8c3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 22, cognitive 33): prepare has cyclomatic complexity 22 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5142efa020aa89a94cb71e22d6f3d2c1c0be6503427fbc82f0f3c697636de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judge (cyclomatic 22, cognitive 31): judge has cyclomatic complexity 22 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":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2772c97d21d32a1fc7c919d965ada246e1983e35ce9c86269a8a8767c1978243"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSnapshot (cyclomatic 22, cognitive 23): buildSnapshot has cyclomatic complexity 22 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6979e23cd1a2291097900e02d51263cad1ef7c55e6b89676e4068bf8d10f941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedMunicipalLocationMatches (cyclomatic 22, cognitive 22): savedMunicipalLocationMatches has cyclomatic complexity 22 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":"android-app/www/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd9b139cf0ef7226381e3954606bdfae882181cd0495cdf29a2551c1f3462a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function savedMunicipalLocationMatches (cyclomatic 22, cognitive 22): savedMunicipalLocationMatches has cyclomatic complexity 22 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":"static/standalone.js"},"region":{"startLine":12827}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f55914ea6eb3a0c79278a507419524c95da8034328735e3063e1c1e32669b0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorityRoute (cyclomatic 22, cognitive 21): authorityRoute has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5886a29bee4a28fceb565e3122997f1eaf8e7be6524cc3bb9f03c48fd0ccb4f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function centralPotholeRequest (cyclomatic 22, cognitive 21): centralPotholeRequest has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1f8c46e9ac4d4c67c1f350137b1638f58fc988a9404b91b445052b0177b107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorityRoute (cyclomatic 22, cognitive 21): authorityRoute has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a83f9c7f49301657fd0056cc327ac8ea436798e4277784b096fc8afe9dbb37b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function centralPotholeRequest (cyclomatic 22, cognitive 21): centralPotholeRequest has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9021}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b9f50698e9796d284834a1114710160719a07eaff8ba1074b48595d87b206c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleImpact (cyclomatic 22, cognitive 20): handleImpact has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":3582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad1bf6d5baa0f1e5bf37cf6be1b7b83547d33c98789c7957ec55a1ecc1f549a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openBengaluruHandoff (cyclomatic 22, cognitive 13): openBengaluruHandoff has cyclomatic complexity 22 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":"android-app/www/standalone.js"},"region":{"startLine":12228}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4be58aa653d77784f1d4aa8cfc47ae6d96235b824dae6529d79ff76558847c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openBengaluruHandoff (cyclomatic 22, cognitive 13): openBengaluruHandoff has cyclomatic complexity 22 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":"static/standalone.js"},"region":{"startLine":12228}}}],"partialFingerprints":{"codehealthFindingId/v1":"260fdf368f581ca2e9bc0ef2ff0b9d6f9a9857441697ec6c24d73bbb9b57b784"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeTile (cyclomatic 21, cognitive 34): encodeTile has cyclomatic complexity 21 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe651041dd7c889082937c5ed8ae5e292a551ce1ab544030d691713cff4c7ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function highwayContractCandidates (cyclomatic 21, cognitive 27): highwayContractCandidates 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":"android-app/www/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2ecf53e83812c3ac04ebddd7870be2323590083f377bb76a6398811442c8ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function highwayContractCandidates (cyclomatic 21, cognitive 27): highwayContractCandidates 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":"static/standalone.js"},"region":{"startLine":12657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c25de352674e879e6a5399cc346b50a63f26c511a6bacaa91aceded63466a83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kgisJurisdiction (cyclomatic 21, cognitive 22): kgisJurisdiction has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fa88b5249588b2431112e9c1247ba6e70dec37e1fab297157409863a83cc14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 21, cognitive 22): handle has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/service.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad898e69eeca0dc5fbd888a1e466f33eeb932922482fd796c090b6c83ed65c43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kgisJurisdiction (cyclomatic 21, cognitive 22): kgisJurisdiction has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fbb0df13b2205d3a22a636c93aab1eb7d86039dc408cfe8be5fd0bd4284475"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTile (cyclomatic 21, cognitive 21): parseTile has cyclomatic complexity 21 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef08686617bd29e4273438db8998a00a6377fb9f935d3ef99f793c2b02d645"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roadNoticeCandidates (cyclomatic 21, cognitive 17): roadNoticeCandidates has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ee37a5b8906fd7f4aac3c24675aeeb67f407b01352943f13e12affe06e0415"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roadNoticeCandidates (cyclomatic 21, cognitive 17): roadNoticeCandidates has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a140f957ca1feda41863dd7c6bcdb38c35010d1cb7a759d7fb7076698ca6af2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTenderPack (cyclomatic 21, cognitive 14): validateTenderPack has cyclomatic complexity 21 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f2922228a9342ce753cb4e7157fda181bfd5a7cfe65ec370fabdee04a15e4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTenderPack (cyclomatic 21, cognitive 14): validateTenderPack has cyclomatic complexity 21 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf0f666a72d74f5923631263e20c8b62ada05350254fdb3617351a9d58c6fdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenderFromService (cyclomatic 20, cognitive 19): tenderFromService 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":"android-app/www/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b6c6f067baee5979fdb9b5fd7764d450294be7b2d7ebc4adf50dfbe1044a32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenderFromService (cyclomatic 20, cognitive 19): tenderFromService 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":"static/standalone.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"d359e284edc977ba280ea882ed4993017ef0552a288d698942b57f452903e487"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openOwnershipBundle (cyclomatic 20, cognitive 17): openOwnershipBundle has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-ownership.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"84125e420d7b54385ddb861aadafa54b38cf4e42d5a8ca2115f346ce915c2b79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadInstallationIdentity (cyclomatic 20, cognitive 16): loadInstallationIdentity has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61d184e8a0fece26bda5f81dd80753d1927cc1afff44676f1b7ef7dab1ef8b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadInstallationIdentity (cyclomatic 20, cognitive 16): loadInstallationIdentity has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df3ad26031c46edb959499ad6b15f9ef0786048fe827fd10ec5e4c17ce38884"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCentralPothole (cyclomatic 20, cognitive 14): applyCentralPothole has cyclomatic complexity 20 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":"android-app/www/standalone.js"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90050ef20e8fe5d9a0546bfb685290afc8f127765762c2b27c0dd4fabd48ef9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCentralPothole (cyclomatic 20, cognitive 14): applyCentralPothole has cyclomatic complexity 20 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":"static/standalone.js"},"region":{"startLine":8999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fb143d9f686e4edfbc782699f1426428d12dff464e62b8195e7f30e0be1c4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNationalHighwayHandoff (cyclomatic 20, cognitive 10): openNationalHighwayHandoff has cyclomatic complexity 20 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":"android-app/www/standalone.js"},"region":{"startLine":12277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d654c0a43864a33589e9f3218369e408bf50806ce1eeabefd414979db2ec0501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNationalHighwayHandoff (cyclomatic 20, cognitive 10): openNationalHighwayHandoff has cyclomatic complexity 20 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":"static/standalone.js"},"region":{"startLine":12277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9fba3379f345d6d4f6586824d410ea121e01af5bc7432d7f145886f3f1cd74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sample (cyclomatic 19, cognitive 30): sample 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":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6947b883b78dc7b226c6289925cb129ec375c214aeb92a352b2a711ff9a2a01d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function noticesOfBody (cyclomatic 19, cognitive 24): noticesOfBody has cyclomatic complexity 19 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"566b16bb1c74256bde02b827cbe0af8326b9e682c8ae8a29c07a1c8ba671dfd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeForIssue (cyclomatic 19, cognitive 20): routeForIssue has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f440c1d9db26abee505ae65724672d1fe475f7fdfb5b92d552cb9febc8bbbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 19, cognitive 20): onsuccess has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":9174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa909f55c2a5263f8aca8e439991dbd480f84e6be24c333b7aaf0c70f05d77b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeForIssue (cyclomatic 19, cognitive 20): routeForIssue has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b5c97c08b3884377e8b639c1b82948091f833cadca884bca4427772d93de37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 19, cognitive 20): onsuccess has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":9174}}}],"partialFingerprints":{"codehealthFindingId/v1":"46212133146995545d3244d86cb5ad1f328c1aca101a5916481c6bac4e00f5ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roadAgreementCandidates (cyclomatic 19, cognitive 18): roadAgreementCandidates 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":"android-app/www/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3693c1dbcbc7bfbcaf0cbb304280b9e00da44d4e379bf9fb5c6e43c6eca1a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roadAgreementCandidates (cyclomatic 19, cognitive 18): roadAgreementCandidates 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":"static/standalone.js"},"region":{"startLine":12972}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9ff6b42090ece5a040bfc8706c6431958f11cb90de98d42b7e6d2d80a2f8f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchTender (cyclomatic 19, cognitive 16): matchTender has cyclomatic complexity 19 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":"android-app/www/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0f90a7ff926e4abcbd19da11859c53d50b4a5c5f1ab4f6fdca63731e7da994"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchTender (cyclomatic 19, cognitive 16): matchTender has cyclomatic complexity 19 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":"static/standalone.js"},"region":{"startLine":6985}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91772bf9fdc8a19cac779f469c71c347ad30b81c12ba9d0e1f233de52e7af76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function junctionsOf (cyclomatic 18, cognitive 32): junctionsOf has cyclomatic complexity 18 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09d86d763b7e9284bf476a0185c4dd3e22b30318d333275ad9d793a903a728d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 18, cognitive 24): resolve 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":"infra/aws-central/service/geo-cache.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"271bf729fba2cfb78112843a044f81ea6ee05b26776bbc2405d4687ceaa0dca5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectionEnhancementPlan (cyclomatic 18, cognitive 19): detectionEnhancementPlan 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":"android-app/www/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"36369518e8ece4f0c5160ce8602fe71970ded3299127e4475e3dbb9847818511"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectionEnhancementPlan (cyclomatic 18, cognitive 19): detectionEnhancementPlan 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":"static/standalone.js"},"region":{"startLine":9282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0396754b5ba2209019017e5760ae3f16d9d1e796812383bf5ae05ac81461bec5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSharedDetection (cyclomatic 18, cognitive 17): prepareSharedDetection has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d24d87f4060bd556e227018ccf9a92971c946d1fc5bfb4ca1e0dc7bf761ae76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRoadNotice (cyclomatic 18, cognitive 16): matchRoadNotice has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9be512e2088157ff4936b69ea51269efa4ca02f51110e2cd60891e6f85e3f54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureProvenance (cyclomatic 18, cognitive 16): captureProvenance has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0829a1c88daf1c75eeb91a8f7ac741bc6b4918c082f5efdbefceb15941dab8eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRoadNotice (cyclomatic 18, cognitive 16): matchRoadNotice has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa0e0a27f29b261944e470727b3f009854c9cc09f6d05e5fbe2f92bae7994e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateVerdict (cyclomatic 18, cognitive 13): validateVerdict has cyclomatic complexity 18 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd16994814f3f822d73daf0308b886954fb8d4440249e97a94fe32e2af4d25c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDetectionVerdict (cyclomatic 18, cognitive 12): validateDetectionVerdict has cyclomatic complexity 18 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":"server/src/index.js"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"954f9f120b33f7a037437bd935c155d21553652dedb4461fc02d1dd825609533"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 17, cognitive 36): constructor 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a45597cc401af5d32ea56e8f0bb68f39a35c206e739b3ef78f27137b44919c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchWardTenders (cyclomatic 17, cognitive 29): matchWardTenders has cyclomatic complexity 17 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f187d87d88d80460362e479f3c4d077daa56ccb294117e48ca32b23bb0cb71f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 17, cognitive 28): scan has cyclomatic complexity 17 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/test/karnataka-geometry.test.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c984c45bc272d9809bed7cdc4bb65ddc3ece97102963f1f1edab7e935bb8db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeImage (cyclomatic 17, cognitive 23): analyzeImage 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":"android-app/www/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08ecbf88c48b8c78db9a4131a752a93647233c2119afb48dc56f46bb171ad71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeImage (cyclomatic 17, cognitive 23): analyzeImage 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":"static/standalone.js"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd3c35f2efa6dc3712d3a7a4a18c07503f4d93a1bfb4c4cc01e73352c93b7e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measure (cyclomatic 17, cognitive 20): measure has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"45534db086f8eb1d15f34c2690f3e4b545c3a6fa35a7c885d99f2cc26225e2c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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":"android-app/www/standalone.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a9cdb2f0d68167b90257e346878ab13bc307b1557c715b9dcaa37c88624d56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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":"static/standalone.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9006f0037732cc56dfd511aaf3311ff75e5345102d51f36c4860c9675ba726b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authenticate (cyclomatic 17, cognitive 17): authenticate has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"feecbb994b1f389594121ba24f4214a146720e44a4c90f052f967b9edfd267ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callHttpYolo (cyclomatic 17, cognitive 17): callHttpYolo has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"52462cb85b14a40f1f5bc4274a90c5dea8749e2c6ee1c339532e0e6a6e6e19b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeIndiaWardCanary (cyclomatic 17, cognitive 16): judgeIndiaWardCanary 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"574c005e7ef4805eeefe34db960b9dc072442d0fa73cac434c2a431539edcda6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streetFromFeature (cyclomatic 17, cognitive 16): streetFromFeature 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ff30fc0d03567b7db9d56bcd96f8da874f48dda7c566da9b29f0875c3c2724"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compatibleDraftRoute (cyclomatic 17, cognitive 14): compatibleDraftRoute 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":"android-app/www/standalone.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44d9041d980a4fac3d1d6b8632d906af715171d5148b51eb4904400635691ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compatibleDraftRoute (cyclomatic 17, cognitive 14): compatibleDraftRoute 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":"static/standalone.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db18a8fdd5ad7264ea3fb75daa4607133a6e1c751daa7ae9ed65d789647ebb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drainSSE (cyclomatic 16, cognitive 31): drainSSE 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":"android-app/www/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9674e786abac83509b018b455cb143efaf9372cf3830b179962d18a8ad119b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drainSSE (cyclomatic 16, cognitive 31): drainSSE 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":"static/standalone.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e46919f75a9e777f2fef6daa2fc7254bf70e87e3b1bbd26455012cb598fc106"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locate (cyclomatic 16, cognitive 28): locate 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":"infra/aws-central/service/india-wards.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"647eb448b971930b9fd523326d6e5d6880d313c9768a58c3f9e6ea28549b2479"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 20): main 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":"infra/aws-central/tools/seed-tenders.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6a24de5e88b8c48a3cd045b512c0faf19d8190d8224591cc11ad508db02e78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nearestPostcode (cyclomatic 16, cognitive 17): nearestPostcode has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d03f687b0540874be164c5747882140f3d392a2815db2a6f8044f8f019f44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 16, cognitive 17): finish has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a659f4e989febfab728960afec205ba33ee908ef394cbc9282524cf251b374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kolkataRouteFromGeocode (cyclomatic 16, cognitive 16): kolkataRouteFromGeocode 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":"android-app/www/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ccec03210a878dcd115feb47243137725ff9569bdb1dfc97a6bb46ef8546f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planUnreportedReminder (cyclomatic 16, cognitive 16): planUnreportedReminder 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":"android-app/www/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a12111b4f09677294140d93a976d76a675768fcf781e5ceab9639a993584bf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kolkataRouteFromGeocode (cyclomatic 16, cognitive 16): kolkataRouteFromGeocode 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":"static/standalone.js"},"region":{"startLine":4485}}}],"partialFingerprints":{"codehealthFindingId/v1":"983a06639beb9a9c6da28b73d09dcc18c4e0d73a7e7c369b669fa18deaeb5ec2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planUnreportedReminder (cyclomatic 16, cognitive 16): planUnreportedReminder 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":"static/standalone.js"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dffa906aed04ac35f4d82e06aba89180c0b3004cd4dbd1a42d9aa339173b05b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outcome (cyclomatic 16, cognitive 15): outcome has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6d77fe5b67f1ef4f4ad191b11515b3a62152ad39bef3763a51373457b13be2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function beyondKarnataka (cyclomatic 16, cognitive 14): beyondKarnataka has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4f4dbea7f5a10ec8d972c17c49c2cf8f08d632355d39850d616b1731f54732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"309769d1f201c70b7d37b55f52dac8c5ea8a95e63b286a024909e4793f332b8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function feedback (cyclomatic 16, cognitive 13): feedback has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaa441f035f054230115b994cb63c4f92850eb2ce7b72c4861195c1c3e37791"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partsFromGeocoder (cyclomatic 16, cognitive 11): partsFromGeocoder has cyclomatic complexity 16 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":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96d40c23672a435fa0755e363b015a50b0060224660adc0563252d3bacd1eb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfTest (cyclomatic 16, cognitive 11): selfTest has cyclomatic complexity 16 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":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9f3fff7e3cd7e1fdef544f887e402db82121d034ab9b2efe6902676d35cc8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 9): (anonymous) has cyclomatic complexity 16 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":"android-app/www/standalone.js"},"region":{"startLine":6173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9028044136d031a7ad3cb8c057e5f9c1cde524ac7b217f7a119b0c99a1d55aa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 9): (anonymous) has cyclomatic complexity 16 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":"static/standalone.js"},"region":{"startLine":6173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50f8c52d0a6b643859dbfa2e96ad7a67e472643a9f6e8c482177c0b2a395383"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oaiStream (cyclomatic 15, cognitive 26): oaiStream 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":"android-app/www/standalone.js"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8b37a90a54d9b1fee00bead46f98650e62911a3f7104c9cc874b6d2f701349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oaiStream (cyclomatic 15, cognitive 26): oaiStream 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":"static/standalone.js"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"002df37ea10d34a2185af71b4b9236ee92348276a35fec3ee62bc2ac8720b626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lineMeetsBox (cyclomatic 15, cognitive 25): lineMeetsBox has cyclomatic complexity 15 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"8782c4ab66365c186188bcceecb67f619d7c83196a5ccabe4214d6d16a9c09d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportShadowScreen (cyclomatic 15, cognitive 22): reportShadowScreen 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef1bbfabfd2b076dde3b79a9c78a06ca9d6b2cd202105e005ce7868309e8f74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAuthorityRegistry (cyclomatic 15, cognitive 20): validateAuthorityRegistry 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":"android-app/www/standalone.js"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb94fbd652b620ddad79ca47b66ca070de601df2e60efa04a666814b00341fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAuthorityRegistry (cyclomatic 15, cognitive 20): validateAuthorityRegistry 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":"static/standalone.js"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8edf49af542d96e048ab92bc12cada7af657a9e042c104b42dcc8b73a48c3c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 15, cognitive 19): onsuccess 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":"android-app/www/standalone.js"},"region":{"startLine":11101}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ce074b85c44e57f0f3f760bd87bdb0675ff843ed78107213869391890ca58e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 15, cognitive 19): onsuccess 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":"static/standalone.js"},"region":{"startLine":11101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e42e59a948bcc2103192e011a9db3f35a97ff8b4a2b59fb9d220ed529bf78fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchWithTimeout (cyclomatic 15, cognitive 18): fetchWithTimeout 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":"android-app/www/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dd49c856f567100943104c3d02b3d2c55f42a598157837451c25e221da956a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 15, cognitive 18): visit 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70f6dcb4bc14ce00da6d12649bf1220feec6bc97ed254dadc9574986c410260"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBack (cyclomatic 15, cognitive 18): readBack 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c30ca24178e5e4f8259729ae4f19de0ef1eced48364c52b40d7ef1eb8f389b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchWithTimeout (cyclomatic 15, cognitive 18): fetchWithTimeout 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":"static/standalone.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9c936d158525845ba4a47f7803f4e5fe869bc8d1f49407d49b2121d57dd901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streetRouting (cyclomatic 15, cognitive 17): streetRouting 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5f390bb813db103d5638ee6002853fca43167db70f103565a20416900fdc27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verdict (cyclomatic 15, cognitive 17): verdict 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":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04eb6eca1cdace56967c381d1f34e6363e50c37413c638a7ba2ce6b3ec91095"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nearbyPothole (cyclomatic 15, cognitive 17): nearbyPothole 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":"server/src/index.js"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3c60907f8e029cbcdf1428fdf1e1a70b05c7bd96a76bbe9d61e12988cccd56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchIndiaWardTenders (cyclomatic 15, cognitive 16): matchIndiaWardTenders has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8458468ec7bf1921e4cbc2d042e82fe8bbf8310c87684e8ee63cdbfd272f871"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeRing (cyclomatic 15, cognitive 14): encodeRing 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6f6a4726255b3eccb06895570183243a89ec050a54e32de4de30c21609a06c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitReportObservation (cyclomatic 15, cognitive 13): commitReportObservation 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":"server/src/index.js"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73fe4eb73be2259867a67349138a9e332bcfb15d5f0bc6cf873c9de5e424e62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRepairTargetBatch (cyclomatic 15, cognitive 12): getRepairTargetBatch has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11775}}}],"partialFingerprints":{"codehealthFindingId/v1":"9433c3410166ee3d7ce11a32d4692454adc6e11d9b36c6dcd80177a5bd1cb622"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reverseGeocoder (cyclomatic 15, cognitive 12): reverseGeocoder has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4143e5624d344b298389e4848b222a6d029c0213256ba675b6c695e029af2f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRepairTargetBatch (cyclomatic 15, cognitive 12): getRepairTargetBatch has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae54d0b4a95e539ce0b8ea289d5b0996fad510bd28ed50aad73bd299be6f2e67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureStates (cyclomatic 14, cognitive 29): measureStates has cyclomatic complexity 14 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":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddbadff647681ddebcff6c7fd70c263579744e2acf67a422021a99e981cc542"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piecesOf (cyclomatic 14, cognitive 28): piecesOf has cyclomatic complexity 14 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeae4853dfbbff50812ddc25d552ae13b9cb290fba16b16d6033ac8a2319da4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function positionCheck (cyclomatic 14, cognitive 25): positionCheck has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/india-ward-coverage.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab94f90b2fad6a41bd6c2e3cf4b9f567cadd15ea6edb2082aa3ded960011c0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) 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":"android-app/www/standalone.js"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ca5654230b3f5e0b5ef5337d71839fa73f2e2049aa22a4a79fb1fd886f4106"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localityKeys (cyclomatic 14, cognitive 19): localityKeys 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c26777c9c1871c8a02269f913ee985e61841f2143248792b332f786345e2e3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crossingTurns (cyclomatic 14, cognitive 19): crossingTurns 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8639a00aa9c49734d4f6593e9eb375dd961a2e4ad654b1a340d3206b3064aa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) 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":"static/standalone.js"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eaaddaf667da1fa171349a87f03330ec24107e2a75087de39bf411d76923f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitiseWardTenders (cyclomatic 14, cognitive 18): sanitiseWardTenders has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":6719}}}],"partialFingerprints":{"codehealthFindingId/v1":"6192b45067d5a5c260860934a3d67d09bafae4835f989141c64e926a91374da2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shadowScreenCurve (cyclomatic 14, cognitive 18): shadowScreenCurve has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ce561504de3dea42fe6fb70bec7dcd90c8c2cbfcf8d2aa804d178fe8c182f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simplify (cyclomatic 14, cognitive 18): simplify has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"26152537b1b77503a15105826101a861aa067f2f8c37b7ba1043e1be93121321"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitiseWardTenders (cyclomatic 14, cognitive 18): sanitiseWardTenders has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":6719}}}],"partialFingerprints":{"codehealthFindingId/v1":"469a6b2eddc470351a1e05dddc4ff0a15e93affed7ad3d9cdb1594751301311d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 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":"android-app/www/standalone.js"},"region":{"startLine":9227}}}],"partialFingerprints":{"codehealthFindingId/v1":"278b31b96365fe690e2d368769e45fe8435cda9435691e47e9b96e38dc096fd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tenderResult (cyclomatic 14, cognitive 16): tenderResult has cyclomatic complexity 14 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":"server/src/index.js"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eab4538adb8aa1871334973acd73868eab0f42717cf6bcdc0db881f0abbf1ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 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":"static/standalone.js"},"region":{"startLine":9227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9289cc22f5e81009ff69bd45efa99e78860b7cd0b8d496d6bf9937de7ef5b17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kgisCivicJurisdiction (cyclomatic 14, cognitive 14): kgisCivicJurisdiction has cyclomatic complexity 14 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":"android-app/www/standalone.js"},"region":{"startLine":5560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0029e7080b25587d654e2ca9ec71becac34c1f322f181757c265a82f5c2cb2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookup (cyclomatic 14, cognitive 14): lookup has cyclomatic complexity 14 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15dcade4d7cd9fbcad92ecaba204539168ffa1ab2ab3eb9a0fef71c036904e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kgisCivicJurisdiction (cyclomatic 14, cognitive 14): kgisCivicJurisdiction has cyclomatic complexity 14 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":"static/standalone.js"},"region":{"startLine":5560}}}],"partialFingerprints":{"codehealthFindingId/v1":"325daf40f395afca47017ad4a46ad156652936fcd9f5d894c02b05d5ef2700a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pinnedStateRoute (cyclomatic 14, cognitive 13): pinnedStateRoute 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":"android-app/www/standalone.js"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea78caacf18ad0def5dac23913753fa6b5de0dc46e0048ce338fdda0ec075d0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pinnedStateRoute (cyclomatic 14, cognitive 13): pinnedStateRoute 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":"static/standalone.js"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a5730689c719bca05777d306097dd70b93c95de535027e05e78601622c2a2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function urbanBodyAt (cyclomatic 14, cognitive 12): urbanBodyAt 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"18895fb6b2f2ec82c4028aa561762bc77c14d856b1def12cadb412c48bd62e06"}},{"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":"infra/aws-central/test/india-localities.test.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50ec54ea6ae73584af51e9cbc6e9bfe6129589415ce78dcb3119c4ab04eff0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifiedBdaResponsibility (cyclomatic 14, cognitive 11): verifiedBdaResponsibility has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c991c67058afc3f8960639c4ae68e88c78fb0dc7114358c4b8845a1011a34ae2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function complaintRoutingBlock (cyclomatic 14, cognitive 11): complaintRoutingBlock has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":7626}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac360ae69208bba30ed9f1735ab524722369a5abf1d9194efdba20877d22d65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchHighwayContract (cyclomatic 14, cognitive 11): matchHighwayContract has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":12130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb7026b50f96d794db7a318a0e4bf87187052bf6e6ea90c567bd9170ffb085e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function place (cyclomatic 14, cognitive 11): place has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/india-wards.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"929230836d391ab6c5efe7307c412840de632a73a23bbc1d02c74d5b494e6af8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifiedBdaResponsibility (cyclomatic 14, cognitive 11): verifiedBdaResponsibility has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeb15177a40562531932fa40dd0737d1814d63229f42c95422f41f8aec0d3be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function complaintRoutingBlock (cyclomatic 14, cognitive 11): complaintRoutingBlock has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":7626}}}],"partialFingerprints":{"codehealthFindingId/v1":"030aa9d0d1483714f3347d846a2e8076ffdf00f80146b6872d736a4f3d373dd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchHighwayContract (cyclomatic 14, cognitive 11): matchHighwayContract has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":12130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69ebac38da815e85a51780989577ea8b5ff7d2e5ecc2d6afdee98912384c44c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 14, cognitive 9): walk has cyclomatic complexity 14 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9230ab2c74b2b990e92d456f988d86e57943d3a6f9bbe03555b6e1103ab181ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStates (cyclomatic 13, cognitive 31): loadStates has cyclomatic complexity 13 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":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cf43964506c14748fd085998dc149ede468af5f89d968ce6591ab9b8a759de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function query (cyclomatic 13, cognitive 23): query 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35c6e6fe41e90d5cbbf6868079d5ad421278dd3cf6696b6b08f0a8cc1b6e5e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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":"android-app/www/standalone.js"},"region":{"startLine":9556}}}],"partialFingerprints":{"codehealthFindingId/v1":"9075aa0eef399227f7107801b470883949567373797813a63ac5ed826b31cd4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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":"infra/aws-central/test/india-wards.test.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e2f0e42120cebe4af6d6987b5a9acfa1d446249ddbbc9d51afa9f153b83460"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overlapPairs (cyclomatic 13, cognitive 21): overlapPairs 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e940a5a518dd847a70e14b8fc1fed51685d90c492df303f426bfa520ca5caa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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":"static/standalone.js"},"region":{"startLine":9556}}}],"partialFingerprints":{"codehealthFindingId/v1":"713aaf70549971721ca6b270b097926a35ae12a0b3fac74a32f67ee3d72f68a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bodiesOf (cyclomatic 13, cognitive 19): bodiesOf 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":"infra/aws-central/service/india-ward-tenders.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7869cab6c41ee057f6d914582369aa8dae1b603e9f6758e10e8e876074d5aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotOne (cyclomatic 13, cognitive 19): snapshotOne 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a0cc1d5428327dce0aedc2d6997e6f91bd3adcffdd39c5f41e38fabba3ddb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function footageSummaries (cyclomatic 13, cognitive 18): footageSummaries 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":"android-app/www/standalone.js"},"region":{"startLine":8615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2e1895cb676e0d4aac13ce5fcddbdf89d167e6c2f964dc8bb0f5d49a8fcaa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function footageSummaries (cyclomatic 13, cognitive 18): footageSummaries 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":"static/standalone.js"},"region":{"startLine":8615}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec20cc384e748d6358625a74b4f94e15278a1a487191076c604f6957d5be941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function file (cyclomatic 13, cognitive 17): file 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6053ee788cc6868a6dfd0031cc67c2f3684b3c1009073eb5e399006aed9f9bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tileOf (cyclomatic 13, cognitive 17): tileOf 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d46d950fe5e0e922bcded8e3c047271afd333d677c12d3d1b45c9b91e3e26fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function placesOf (cyclomatic 13, cognitive 17): placesOf 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2a48b715ad62d470c0209b0dfaff68311bb8fba8d404cb7254050319f02a72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function returnedPairs (cyclomatic 13, cognitive 17): returnedPairs 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":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee609accd4832bfb73cc5c13e81e5063e033d8a890feb12a4f84409e1340df8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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":"android-app/www/standalone.js"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d3c7cb3ecfff9ab5fd0814fa21fac93f24d0e944c73166859d369bd422717a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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":"android-app/www/standalone.js"},"region":{"startLine":3436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75256a4ce5494f79d99e443606e40f0f105d9eba3d1a3d2aed1b02845c6ee02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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":"android-app/www/standalone.js"},"region":{"startLine":3760}}}],"partialFingerprints":{"codehealthFindingId/v1":"946c5541e9b7ad603d1090aa233d287852d7b0d05cb122c6699a64fc417baf84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trustedContractStateCode (cyclomatic 13, cognitive 16): trustedContractStateCode 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":"android-app/www/standalone.js"},"region":{"startLine":6082}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0568c496341e822c9e37a78526bad6b428eeac13ec343c7a2546299a8c301e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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":"static/standalone.js"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd1eb7de50f231b9283bf05ef54ba8478cd68ec096ba4208442b4fe37ec076f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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":"static/standalone.js"},"region":{"startLine":3436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8c18046bdeacdb20de606fc5e06b25916e32e8f5a0d8faa3a6d2ffb7c88f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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":"static/standalone.js"},"region":{"startLine":3760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93b4554bfdf280c26f9365626ba7e778cf2c75c54ba092aeafac3f6170d0f4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trustedContractStateCode (cyclomatic 13, cognitive 16): trustedContractStateCode 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":"static/standalone.js"},"region":{"startLine":6082}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dba52abab3cf7310eb47d79b80843f4dd74e16b63cb8c30ad0bcfb31abe4954"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sliceObject (cyclomatic 13, cognitive 16): sliceObject 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":"tools/harness/check-i18n.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3844663d3ef2687d57c227f765353012ba3f3bf6af669707040bf42e3b791496"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function impact (cyclomatic 13, cognitive 15): impact has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/dynamo-repository.mjs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58e086763e5a014a554ae89e5a0686d6bb6fe18511f8d7da23faf7b39e986ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crosses (cyclomatic 13, cognitive 15): crosses has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57d77892d148adb2401a55374bb5c08a09e62347e4f0ab85746b448bd6d415e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function urbanPlacesNear (cyclomatic 13, cognitive 14): urbanPlacesNear 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a71334097754287b3c45ff5525ee11c925f0a56fca42a1873ec2d9028ce4bbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportDataset (cyclomatic 13, cognitive 13): exportDataset has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":10539}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dde9eef9090d5b46c1857b3384904fc4610fe160c89510862f053ea1e35cc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadRegions (cyclomatic 13, cognitive 13): loadRegions has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"481a33fdd39967ce7b664ecd4ef2da19ab41e0e38484cb1e4b41b24dc43a6567"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c18c00c3b3ec9d7d5b482342f027301aaa8f7d398a24fbd2d087c3dcf27cd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportDataset (cyclomatic 13, cognitive 13): exportDataset has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":10539}}}],"partialFingerprints":{"codehealthFindingId/v1":"681bbdb1829c64863d193a8d3890e1ee61c7788bc360eff014d41282b364bcdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeWhereFromCentral (cyclomatic 13, cognitive 12): routeWhereFromCentral 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":"android-app/www/standalone.js"},"region":{"startLine":5593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ea55ae42c225e7b094d3f93be8642b3c24bef8cd23d36850d971426ce7f825"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onupgradeneeded (cyclomatic 13, cognitive 12): onupgradeneeded 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":"android-app/www/standalone.js"},"region":{"startLine":8201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e29eff9019681b8e233ed43726144960aa448d0caf47c38b31c089b1a3845ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provenance (cyclomatic 13, cognitive 12): provenance 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18503584d18995f3087987505db22fc287bac7ed21dbde5ea69c19ad1f09d66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeWhereFromCentral (cyclomatic 13, cognitive 12): routeWhereFromCentral 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":"static/standalone.js"},"region":{"startLine":5593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbd008373a4ca2391d074e432c1e285e6cdcbb842d9be447f20845261c1419d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onupgradeneeded (cyclomatic 13, cognitive 12): onupgradeneeded 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":"static/standalone.js"},"region":{"startLine":8201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dda09ef8ce3d7edec91ea4eebae57f2969052dcd87786ab9b2a6112ce7153bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function delhiRouteFromGeocode (cyclomatic 13, cognitive 11): delhiRouteFromGeocode has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee710d88a46cbdfdfbc03a6ff20d9bb50d6d51c62d0805b7a5bb51e7aa41e52a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function delhiRouteFromGeocode (cyclomatic 13, cognitive 11): delhiRouteFromGeocode has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4417}}}],"partialFingerprints":{"codehealthFindingId/v1":"0040b37dfffabb901e3189a99fe80dc2b4ea73d43a066f56ae82b01ef84b383c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nationalHighwayRoute (cyclomatic 13, cognitive 10): nationalHighwayRoute has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":4173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc250faaade3b0fc6e5f3cf4beba12e9e74cde25721a53fb8b4d74aa470bde8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nationalHighwayRoute (cyclomatic 13, cognitive 10): nationalHighwayRoute has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":4173}}}],"partialFingerprints":{"codehealthFindingId/v1":"535860f703df6f36eccbff690cc085a21131d7f39e915b56ef9a3bf2401eb755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortAddress (cyclomatic 13, cognitive 9): shortAddress has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/src/index.js"},"region":{"startLine":2727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbc76b0eecc7f61a090aecb9cc474aa69f150f9c0af884787eb125d69626cc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function distanceTo (cyclomatic 12, cognitive 23): distanceTo has cyclomatic complexity 12 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"968e048bfd947db43fc06a008e1c7a998b9013160a7add457bc60d3947999071"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 12, cognitive 18): download 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"f750481b54b1e29e50f51ea99985f56911fbc53865c6887c8da88cf68d010022"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function candidateHasSpecificRoadIdentity (cyclomatic 12, cognitive 18): candidateHasSpecificRoadIdentity 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":"server/src/index.js"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19312f6c30a2e0425cfdae68c56cf56a811a7e5e3f997eb68ba8eac8bdec16a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) 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":"android-app/www/standalone.js"},"region":{"startLine":4035}}}],"partialFingerprints":{"codehealthFindingId/v1":"57576841455836ba57e02526291ff0d9e55306580ebda4bd48e2569d48c9e887"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneStoredHistory (cyclomatic 12, cognitive 15): pruneStoredHistory 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":"android-app/www/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32f5402822e28fe14a427dc0ab2f46f8cd6bef3db13dc8427caa698e509e38b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) 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":"static/standalone.js"},"region":{"startLine":4035}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eda488b360430b7d55c95185696249ee244af2782f606f500b5946f561dd01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneStoredHistory (cyclomatic 12, cognitive 15): pruneStoredHistory 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":"static/standalone.js"},"region":{"startLine":8695}}}],"partialFingerprints":{"codehealthFindingId/v1":"95760d8ab1babdbb4efc50a93214086176f3892b0fd5df28ba993add25c98e9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeP256Signature (cyclomatic 12, cognitive 14): normalizeP256Signature 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":"server/src/index.js"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b64908c24cbe8bc41a992b78bb588d56bfd7b1054fed33acf5016a9f548c3f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 12, cognitive 13): handle 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":"infra/aws-central/test/health-support.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"39910fffaeb4c76f13315d762001214381e8d4d0b966f6810a09a3cebea7272b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeIndiaWardSnapshots (cyclomatic 12, cognitive 12): judgeIndiaWardSnapshots 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab0775ac006ab7378a51946f26249672e5f073ad46cac2fde9fcd026259ba6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partsBeside (cyclomatic 12, cognitive 12): partsBeside 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"822f2268272abd9303aa33a041eb88e3c66ba5aca090f2c9aa0a7908716321a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tidyRing (cyclomatic 12, cognitive 12): tidyRing 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":"infra/aws-central/tools/ownership-bundle-writer.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8612ecab90192c50ee8527918501399d968449fdfaecd0420bbca50a3378b28f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTenderResolve (cyclomatic 12, cognitive 12): handleTenderResolve 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":"server/src/index.js"},"region":{"startLine":3443}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5ac2bec6fab9699335918bbbd9affbca2946169490feb9fba22eca55149bdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorityComplaintProfile (cyclomatic 12, cognitive 11): authorityComplaintProfile 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":"android-app/www/standalone.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4197bf813970181b1afd07a8ba567a4a136d2ba323fc3f56b6efe927feab79e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heldWardAnswer (cyclomatic 12, cognitive 11): heldWardAnswer 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":"android-app/www/standalone.js"},"region":{"startLine":6875}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae400138d7f543e2b1fb844435a2abd3c4e9ddf7000067b081d50f1fa94c02d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 12, cognitive 11): onsuccess 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":"android-app/www/standalone.js"},"region":{"startLine":8425}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d9becafa1587364421095fcfe291843bb4eb775205612bfd85ca3faff81c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keptOff (cyclomatic 12, cognitive 11): keptOff 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":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8dfd60ddb23fa881e17cda4072853d86c5a2d4de18a6e2c3d8d0d4b243b35f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorityComplaintProfile (cyclomatic 12, cognitive 11): authorityComplaintProfile 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":"static/standalone.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"38341b48cc3a6c97848c1892f4a67508ca62b35ae0151a6278ffa208dda0332b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heldWardAnswer (cyclomatic 12, cognitive 11): heldWardAnswer 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":"static/standalone.js"},"region":{"startLine":6875}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1446ac02bff26866511dcd928540f44805e339d064014c3ce221a651217186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onsuccess (cyclomatic 12, cognitive 11): onsuccess 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":"static/standalone.js"},"region":{"startLine":8425}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb88833d5b6e95cb6da85d2f44578f7ae2fe780114780c3790417610f289b494"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function image (cyclomatic 12, cognitive 10): image has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0ee3b942ecda92ec091fe88d5fd2ff1888d339467d73c747226a226d9ba3d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publicMap (cyclomatic 12, cognitive 10): publicMap has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"412738f31b15058623527eccb39edd62bf1d1edc8047618808c30fa38c5119dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRepairObservation (cyclomatic 12, cognitive 9): applyRepairObservation has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11068}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f00421aa10efe34c9ef25cf578732db07229c0d15c091b4b1f2c886d9219f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRepairObservation (cyclomatic 12, cognitive 9): applyRepairObservation has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11068}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc509e1c229ac58d3ae34d57199662d0062bd9b426eb6f6c1de1652a4fae8fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assembleRings (cyclomatic 11, cognitive 19): assembleRings 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"209707170f25ada4865b883bcc585d9fd60f18817714f54f36adc9b2ce155ec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 17): main 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f51a7be47bf8ed07b11f45a016256b763e27ec8931ebac9abf46f94c7ca81bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tendersFor (cyclomatic 11, cognitive 16): tendersFor 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":"android-app/www/standalone.js"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4d6fde474d2b113087cd52cabeb1f63471cd8ef87950b37e0c1863ef3a556f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coverage (cyclomatic 11, cognitive 16): coverage 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":"infra/aws-central/tools/india-ward-runtime.mjs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc27474bc0198372c826ceba51959e8bdd0cb17e15a7a70c683e1e076c55c12b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tendersFor (cyclomatic 11, cognitive 16): tendersFor 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":"static/standalone.js"},"region":{"startLine":6499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d427051c37e5e3fc1ac7e977c6d4cbd9b63202c9937a92bad00762e8d5971a18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 11, cognitive 15): walk 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":"tools/harness/restore-defs.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"24da27aa6635b7b1888d900539c1f8793f99a6435d68a80dcb34066bb99afe98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stateOf (cyclomatic 11, cognitive 14): stateOf 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":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f5b0744f8926dc6f64b37f9d9f21b562a532bc2c3b243c9b8b03aeb88e960b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/test/worker.test.mjs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d505b0d4ca7c77d57e6b10a36961c8d4c05dadaa0ac123cc131ced6096a99a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outerStateBoundaryGeometry (cyclomatic 11, cognitive 11): outerStateBoundaryGeometry 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":"android-app/www/standalone.js"},"region":{"startLine":5650}}}],"partialFingerprints":{"codehealthFindingId/v1":"c091f93f873d9c578e0a3636606ff12e5d7838b6fbb7aa67d709abdb57e038e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistReportCandidate (cyclomatic 11, cognitive 11): persistReportCandidate 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":"server/src/index.js"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"63974ae87b91bb20724f3fac0f0796dbc9925118ee81725f2d37b11ddcf24e1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outerStateBoundaryGeometry (cyclomatic 11, cognitive 11): outerStateBoundaryGeometry 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":"static/standalone.js"},"region":{"startLine":5650}}}],"partialFingerprints":{"codehealthFindingId/v1":"4500b9d0dbfacc2312e487c1b62ea1d1afb2e7360d1e838cce33f11036a4e4de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function punjabRouteFromGeocode (cyclomatic 11, cognitive 10): punjabRouteFromGeocode 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":"android-app/www/standalone.js"},"region":{"startLine":4646}}}],"partialFingerprints":{"codehealthFindingId/v1":"4307fb5e929a777bee49a9e289faed1149ec3e90c6753c4c85390c8f4faafda6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tamilNaduRouteFromGeocode (cyclomatic 11, cognitive 10): tamilNaduRouteFromGeocode 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":"android-app/www/standalone.js"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"000dc4f601ef2c955d53cbdfbf17eeaf5ff223e79aa6714f039d811cf5c7c113"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function andhraPradeshRouteFromGeocode (cyclomatic 11, cognitive 10): andhraPradeshRouteFromGeocode 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":"android-app/www/standalone.js"},"region":{"startLine":4748}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4abf0c2771486be07107321ddbc963aa4451ff02f46c24b2f31f42d52a2b49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function telanganaRouteFromGeocode (cyclomatic 11, cognitive 10): telanganaRouteFromGeocode 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":"android-app/www/standalone.js"},"region":{"startLine":4799}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3ceb1002f442428b4ae4d7ace8a05533b8f1833959b0dbdb845e5cd9cd92c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wardAnswerFor (cyclomatic 11, cognitive 10): wardAnswerFor 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":"android-app/www/standalone.js"},"region":{"startLine":6892}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e29e9b666073ca1209c61f93e51ff7e4a076a1f2998bc871b50b1938e95de4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addAnnouncement (cyclomatic 11, cognitive 10): addAnnouncement 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":"infra/aws-central/tools/send-announcement.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe948193249bd63455651a48d7f64f58392ed972230781cc40feace72cf4f28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authoritativeRoadOwnership (cyclomatic 11, cognitive 10): authoritativeRoadOwnership 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":"server/src/index.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72da99013dc3c6f453e88a99914d5866f2294c3270d9c98af52322f873475a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function punjabRouteFromGeocode (cyclomatic 11, cognitive 10): punjabRouteFromGeocode 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":"static/standalone.js"},"region":{"startLine":4646}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc480e67221a7abac95d76f8ab295967a6f9a15b340efec4fa89d7e882a0eb61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tamilNaduRouteFromGeocode (cyclomatic 11, cognitive 10): tamilNaduRouteFromGeocode 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":"static/standalone.js"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6867bc6c3a131e3371859d5ae1df37f7c1fac59dc85dc954634daf9ab1a9f83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function andhraPradeshRouteFromGeocode (cyclomatic 11, cognitive 10): andhraPradeshRouteFromGeocode 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":"static/standalone.js"},"region":{"startLine":4748}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeda648e4804140283a84b64c6e3858d2be8d3a113d4c912b80c92be8d3ada08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function telanganaRouteFromGeocode (cyclomatic 11, cognitive 10): telanganaRouteFromGeocode 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":"static/standalone.js"},"region":{"startLine":4799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36dac9b98176331e04a209edea4c15cbc1c10b0dc577eba06c1e7dbba5c2436"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wardAnswerFor (cyclomatic 11, cognitive 10): wardAnswerFor 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":"static/standalone.js"},"region":{"startLine":6892}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb26dde593ceb1b40dbce9a4b51ffe4143a276a447e0740c89d21a52c0eb7fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authenticate (cyclomatic 11, cognitive 9): authenticate 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":"server/src/index.js"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b68a862c4e576ea4086ea9f3117f57195383b87a00c524d5fa9af2054e4d34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMap (cyclomatic 11, cognitive 9): handleMap 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":"server/src/index.js"},"region":{"startLine":3506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f533572d6966e0a0dd90ac4cc4489269a9962bd815f21eb7fd02bb9838363bf8"}},{"ruleId":"R3","level":"warning","message":{"text":"android-app/www/standalone.js: 12980 lines of code: android-app/www/standalone.js has 12980 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":"android-app/www/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a5921bbcd0a0fb7ddc459f3be83acae2a43af7870bf2bc1eb637db261024df"}},{"ruleId":"R3","level":"warning","message":{"text":"static/standalone.js: 12980 lines of code: static/standalone.js has 12980 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":"static/standalone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b47c631884aac05cdea2c37f2af886b7a3ee5c465d34dcce334ed0f0f3e3e62"}},{"ruleId":"R3","level":"warning","message":{"text":"server/src/index.js: 3802 lines of code: server/src/index.js has 3802 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":"server/src/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"029e589e2013fc3624100858a482024ca3e2eea428895fa97a866fc674c02bbe"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/tools/build-street-index.mjs: 1531 lines of code: infra/aws-central/tools/build-street-index.mjs has 1531 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":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69f3ff98f5e330b96ac78c7523f389afff75f44bd1fecda37e4e85ccb27b05a"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/service/core.mjs: 1325 lines of code: infra/aws-central/service/core.mjs has 1325 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":"infra/aws-central/service/core.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4f954dbcd6e18352b8769e09e8ac2d35780ec0d8dcda236896dbd76856a7fe"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/tools/snapshot-india-wards.mjs: 1159 lines of code: infra/aws-central/tools/snapshot-india-wards.mjs has 1159 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":"infra/aws-central/tools/snapshot-india-wards.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a79be47a5e74a0f6b503c2a3b4466998619a35f1a6ad200fd1cccbd80c21b2"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/service/detectors.mjs: 725 lines of code: infra/aws-central/service/detectors.mjs has 725 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":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a3d521586c029a03038cfd65a748e1b872250be67165649f60e983c3165896"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/service/dynamo-repository.mjs: 653 lines of code: infra/aws-central/service/dynamo-repository.mjs has 653 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":"infra/aws-central/service/dynamo-repository.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4983a339b0d20999f49373a1e2ec21d29c7c8085895aece50cc9388838cdfbc9"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/service/ward-tenders.mjs: 653 lines of code: infra/aws-central/service/ward-tenders.mjs has 653 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":"infra/aws-central/service/ward-tenders.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de5de60284c70987ac112a644267e9339980911495147b0bf207573cc8cd6ae"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/service/geolocation.mjs: 573 lines of code: infra/aws-central/service/geolocation.mjs has 573 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":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9508c845d97f4f18a8e0d9efb86db51378c3e3b816ed3160a8d672b64e5dc2"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/tools/india-ward-coverage-report.mjs: 571 lines of code: infra/aws-central/tools/india-ward-coverage-report.mjs has 571 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":"infra/aws-central/tools/india-ward-coverage-report.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395be53d4c6b8579db9e21a86a014fb585a1cbc063080c4f53982a00fbd7ba32"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/service/local-address.mjs: 491 lines of code: infra/aws-central/service/local-address.mjs has 491 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":"infra/aws-central/service/local-address.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7119fdf923788b890e2a92f6bfe4f81031332bd5e1f40c610243e5b72d31bac9"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/service/health/rules.mjs: 487 lines of code: infra/aws-central/service/health/rules.mjs has 487 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":"infra/aws-central/service/health/rules.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ba24062bd99dfba4ed923266f0f19f151144d2933b0605d4a0b21fddbb0c4f"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/tools/build-karnataka-geometry.mjs: 444 lines of code: infra/aws-central/tools/build-karnataka-geometry.mjs has 444 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":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdd42759b1d7b16c0ebed9293868f382117f75135e6e62c42342779fc4b4090"}},{"ruleId":"R3","level":"warning","message":{"text":"infra/aws-central/tools/verify-local-ownership.mjs: 405 lines of code: infra/aws-central/tools/verify-local-ownership.mjs has 405 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-ownership.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d382f45a526c09686cb6e24a1de9de8e010799a9202116cc8647ee7f35f782cf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-ownership.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd769d167f95025bc8e42ad740f887fd69714771acf0a3eb28ca13846d0fa092"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/verify-local-address.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee6d9f769278f7bb30b095d6add16cbd1eb38eaf9b6f2f8a6d82dda2085dc39"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aa225fff212ca040ecebd380e22d7125fd2bb4f33bf005bba79ef8c31e2565"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/check-i18n.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eb1e51e47c084d49003e25b10996ea70b7049b76d49f634bbb64c580cdfba3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/ward-tender-experiment.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e002ed45b0de86fe3c873b8c70e6493197c6edf5c2f738cede65b70b856abdd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/tester-report.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0404ee1f9c13a84f5794284ce492d538d96dda48736fb04df3eb59ff4ef2e64b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/measure.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"415fddf2c3b470895719a62625ada77dfc16d1c7f20afd56bec58f6767810faa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/restore-defs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66243fdb69dbc02b0d228dd432f29d0adc2b8f56188ae2cec422321a6b781d6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/sync-pure-exports.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f17fd4a9c743f7a7c62d7925bf7cc3c85f7ddb7e137c2234e3af661e63914f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"server/tools/import-tenders.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3e66f7c703a52d7948cb05b9efbcd8c441272b83cccd9e6754a124446b150a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/audit_tender_coverage.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9810efc5bd4d2d71f4fd4f363cdedc527fd74349e5693dcbcd68f59c5394dabc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/lambda/parity.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1ce23141e2da4f79d48900dcf80f1f8338a2fbefa6e8daa5d030e446bf5b6d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/serve-docs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0058b555b70062bbc0a99f91438809806cc6a83a76759480895719d650a0859"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/lambda/handler.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e49725102aeabe77cda8b74fddedb80344d68e01b9f530551e3d0ff3217f2c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/handler.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c31449496ef9bdde33b17208635325e0dd15279269be4a76ef11e595970566"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/score-frames.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729fdfb62a4d9f721598060169b965e23e6d8c418b6f40d6d7a1e139681f8e8"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint or typecheck script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2717 \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":"658a995477a4f3b704a1d0c61d78cffb4c5cc1944c2f896c1bb70ee901a201cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~413 LoC): no import path from any entry point (65 application, 32 tooling, 60 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cloud/eval/prompt_eval.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1442c1ec27e9a62e362b241684d5edf906aa06c2161989ee8b6e9e71f910c2ec"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (65 application, 32 tooling, 60 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/lambda/handler.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8667b15d4113f0eaebfafc5a7ff3d7e08c09ec6c9f117826d9ebb55e8b68fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (65 application, 32 tooling, 60 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/lambda/handler.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b515c0fc14fb6549b3dc9a68b0f0f8c7e7a762a2bc3476fdc04b7278c4b6f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027KGIS_TOWN_LAYER_URL\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/kgis-layers.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eeeb7222a03d61ec259725cd170f5271c12a408268a191da642ba36212bb657"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027espree\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/restore-defs.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38de9f8c1320a6250568be275bddce5a49f944d9b0a47387c888d6a61d1f7b9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: server/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":"server/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb331209360ff81b946d38edfcac6cc20d01cd46c79abbe1e4d9e7e2f83de20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(body.images) || body.images.length !== 1\u0060 appears character-identically in 2 files \u2014 infra/aws-central/service/core.mjs, ml/classifier/lambda/service.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d906c6473afff3cb964713825643e95709d9871069e7b90b4a38a9939456f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!data || typeof data !== \u0022object\u0022 || data.error\u0060 appears character-identically in 2 files \u2014 infra/aws-central/service/geolocation.mjs, infra/aws-central/tools/kgis-layers.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7160d14aaecfb00cf8c9b3480e6edf705f1673058466c93054f3f5b04d89336"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!file.startsWith(root) || !existsSync(file)\u0060 appears character-identically in 2 files \u2014 tools/harness/run.mjs, tools/harness/serve-docs.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/run.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85c960ad7ebdcdb88a791adb166ac5293e15efd6efd96ec3dbb34ead3219b01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(left[1]) - Number(right[1]) || Number(left[2]) - Number(right[2])\u0060 appears character-identically in 4 files \u2014 infra/aws-central/tools/build-india-localities.mjs, infra/aws-central/tools/build-karnataka-geometry.mjs, infra/aws-central/tools/india-notice-bodies.mjs, infra/aws-central/tools/snapshot-india-wards.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-india-localities.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"213356d44af45f10e09c7984b9ef3ec4f6ba1bbb70b99a463c8eb4a1e2cab019"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(lat) \u0026\u0026 Number.isFinite(lng)\u0060 appears character-identically in 2 files \u2014 infra/aws-central/service/core.mjs, infra/aws-central/service/geo-cache.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8cad46ec96ded8a29afeb4dbb5e51a1f17dbd69553bff21288591e9b738e5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060address.city || address.town || address.municipality\u0060 appears character-identically in 2 files \u2014 infra/aws-central/service/geolocation.mjs, infra/aws-central/tools/verify-local-address.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1120378162c2e7ed1536ecbb220b42f972b013762127309465d6e1e6474b2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060address.road || address.pedestrian || address.residential || address.footway\u0060 appears character-identically in 2 files \u2014 infra/aws-central/service/geolocation.mjs, infra/aws-central/tools/verify-local-address.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/geolocation.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd02bae1a058c5a1f2a77fae72c42aef207965996136e1f1166b9b810b7dfd40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fs.existsSync(file) \u0026\u0026 fs.readFileSync(file).equals(bytes)\u0060 appears character-identically in 2 files \u2014 infra/aws-central/tools/build-karnataka-geometry.mjs, infra/aws-central/tools/snapshot-india-wards.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-karnataka-geometry.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8848d5b27aaed2247e462fde0b2fd7e226f1bd05f4e84fb620f564f1e3370510"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060jurisdiction.address_parts?.localities || []\u0060 appears character-identically in 3 files \u2014 infra/aws-central/service/core.mjs, infra/aws-central/tools/verify-local-address.mjs, infra/aws-central/tools/ward-tender-experiment.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/core.mjs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"477029ed8fdc75f4239486997b64b99ce82197905755efe88685608e8083ce9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path === \u0022/web-app\u0022 || path.startsWith(\u0022/web-app/\u0022)\u0060 appears character-identically in 2 files \u2014 tools/harness/run.mjs, tools/harness/serve-docs.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/run.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"595713b9b270535ae3159c50ec09a234605e1389f042f88739ac4f59fee0116a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.API_URL || \u0022https://ffjvg34k07.execute-api.ap-south-1.amazonaws.com\u0022\u0060 appears character-identically in 2 files \u2014 infra/aws-central/tools/production-health.mjs, infra/aws-central/tools/ward-tender-experiment.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/production-health.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4173bc873f745a5ac6d0e4cd0aa5859114e1767fa345418a7efed2b7b0b498"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060types[extension] || \u0022application/octet-stream\u0022\u0060 appears character-identically in 2 files \u2014 tools/harness/run.mjs, tools/harness/serve-docs.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/run.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb07aefc6c630a0c37d78d217a3e80cdcf94c46a220cd3c53d6a76f8ef030604"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.openai_api_key || value.OPENAI_API_KEY || \u0022\u0022\u0060 appears character-identically in 2 files \u2014 infra/aws-central/service/detectors.mjs, tools/cloud/eval/prompt_eval.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/detectors.mjs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"580ae73c98da4e88ef508a2300ebb6809977bc4fc5b19fdb015e19732b064fc9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003C box[0] || x \u003E box[2] || y \u003C box[1] || y \u003E box[3]\u0060 appears character-identically in 2 files \u2014 infra/aws-central/tools/build-street-index.mjs, infra/aws-central/tools/india-ward-coverage.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/tools/build-street-index.mjs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef7567a0faa6919a56fdada84b495bbe51ab6e35859af82d76166fb802cda1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Build.VERSION.SDK_INT \u003C Build.VERSION_CODES.TIRAMISU || ContextCompat.checkSelfPermission(context, Manifest.permission.POST_NOTIFICATIONS) =\u2026\u0060 appears character-identically in 2 files \u2014 android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt, android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NotificationHelper.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a80ca38163a3ea7e9031b15630cac63527c9da536004298f23d524e7f88e29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060right \u003E 0L \u0026\u0026 Long.MAX_VALUE - left \u003C right\u0060 appears character-identically in 3 files \u2014 android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeMediaStorageQuota.kt, android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeReportEvidenceStorage.kt, android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeRetryableFileCleanup.kt. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeMediaStorageQuota.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"975e32408926c895601b367b5b64cdaf81e0ecf7d4119605048c90ea64caab53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022/train/images/\u0022 in info.filename and info.filename.lower().endswith(\u0022.jpg\u0022)\u0060 appears character-identically in 2 files \u2014 ml/classifier/datasets.py, ml/detector/prepare.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/datasets.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bb44ed1a49c8326a3035a4bc7c338dbbfb94c88e8926e2acbea7d74b605932"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060abs(ab_c) \u003C= epsilon and on_segment(a, b, c)\u0060 appears character-identically in 2 files \u2014 tools/build-delhi-coverage.py, tools/build-metro-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7129cb45f270318cf5779b2eb2a489b775d876586ea9c0c729b631b2e6a45ee1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060abs(ab_d) \u003C= epsilon and on_segment(a, b, d)\u0060 appears character-identically in 2 files \u2014 tools/build-delhi-coverage.py, tools/build-metro-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ba54aa33a2f8be00e49e6f15d3f42f2c118acbf4df7b5261c28132969479ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060abs(cd_a) \u003C= epsilon and on_segment(c, d, a)\u0060 appears character-identically in 2 files \u2014 tools/build-delhi-coverage.py, tools/build-metro-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1873e55291d3ec4dc88af813bbc72b1fc1e6e568eafc891fd369afce16a0638"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060abs(cd_b) \u003C= epsilon and on_segment(c, d, b)\u0060 appears character-identically in 2 files \u2014 tools/build-delhi-coverage.py, tools/build-metro-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e310efaf89b2ca71388415785c4a72c6d6133e82efdbe6cc5a4e6771991be1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060crosses and lng \u003C ( (previous_lng - current_lng) * (lat - current_lat) / (previous_lat - current_lat) \u002B current_lng )\u0060 appears character-identically in 5 files \u2014 tools/build-andhra-pradesh-coverage.py, tools/build-punjab-coverage.py, tools/build-tamil-nadu-coverage.py, tools/build-telangana-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f2b56d7995a0fc65ded5f8f825950f5939b399a187a21fee95867c8aec5ac2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first == 0 and second == segment_count - 1\u0060 appears character-identically in 2 files \u2014 tools/build-delhi-coverage.py, tools/build-metro-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"707a46c913df2e64498a898be2d2321b116c08f128cd0e36d998a37f60d353a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060image_format != \u0022JPEG\u0022 or size != expected_size\u0060 appears character-identically in 2 files \u2014 eval/materialize_private_eval.py, eval/private_drive_corpus.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/materialize_private_eval.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84de428afd17ef2feae51d412b7373cf8fc87d865190a9c7db6a899e897c191"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(source[field], str) and source[field]\u0060 appears character-identically in 2 files \u2014 eval/exhaustive_video_eval.py, eval/private_drive_corpus.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"52494b5902fda91f5f3b9f83c9886bad14a3d00adac203570192ff1c72a9a678"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, dict) and set(value) == SOURCE_FIELDS\u0060 appears character-identically in 3 files \u2014 tools/build-gepnic-road-notice-packs.py, tools/build-highway-contract-packs.py, tools/build-pmgsy-road-agreement-packs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8d1bbdd025662391ea7b5b3db25ae0527b37e24bf3fb2b1278a0bd20af6735"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, list) and value and isinstance(value[0], (int, float))\u0060 appears character-identically in 7 files \u2014 tools/build-andhra-pradesh-coverage.py, tools/build-delhi-coverage.py, tools/build-metro-coverage.py, tools/build-punjab-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89c793b4af69d183142ebbf1722fe287bcac6eaf34e4a5860444ecc9c5af5d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and bool(value) and value == value.strip()\u0060 appears character-identically in 3 files \u2014 tools/build-gepnic-road-notice-packs.py, tools/build-highway-contract-packs.py, tools/build-pmgsy-road-agreement-packs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e3dcf7f6f3a4af0cff9c0abdb8f92d7a5b1e282fd06fad7572b0bab127440a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min(a[0], b[0]) - epsilon \u003C= point[0] \u003C= max(a[0], b[0]) \u002B epsilon and min(a[1], b[1]) - epsilon \u003C= point[1] \u003C= max(a[1], b[1]) \u002B epsilon\u0060 appears character-identically in 2 files \u2014 tools/build-delhi-coverage.py, tools/build-metro-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-delhi-coverage.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc12bea95b6a1f1d66b82ff010f26a7fb0042f0bd4ff8f4b6b603262e2fa55b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not image_dir.is_dir() or not label_dir.is_dir()\u0060 appears character-identically in 2 files \u2014 eval/rad_dataset.py, ml/yolo/prepare_dataset.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/rad_dataset.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38d8c8cb565f7405448a1dff18a5057cc76349d397debbc66531b51b53f3ac1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(bbox, list) or len(bbox) != 4\u0060 appears character-identically in 2 files \u2014 tools/build-maharashtra-coverage.py, tools/build-west-bengal-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-maharashtra-coverage.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9da4cf4d9029e3f9a9050774472a919e5a0fc252c64434901f4765577ee4fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(item, str) or not HEX_64.fullmatch(item)\u0060 appears character-identically in 2 files \u2014 eval/exhaustive_video_eval.py, eval/private_drive_corpus.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257c692bf009091db78aa4bd51410de6eb6c0ec6cc9f4fe44f32c156231f862"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(pack[\u0022notices\u0022], list) or len(pack[\u0022notices\u0022]) != pack[\u0022records_kept\u0022]\u0060 appears character-identically in 2 files \u2014 tools/pull-bihar-road-tenders.py, tools/pull-telangana-road-tenders.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d565dcb086df6fae1f64112f199120f6aad138305b35a315656f36149c045527"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(raw, list) or len(raw) != 1 or not isinstance(raw[0], dict)\u0060 appears character-identically in 7 files \u2014 tools/build-andhra-pradesh-coverage.py, tools/build-maharashtra-coverage.py, tools/build-punjab-coverage.py, tools/build-tamil-nadu-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b27127012202d161963b361c342926434ff52e4ead7a387f4ba981cf878d32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(source_bbox, list) or len(source_bbox) != 4\u0060 appears character-identically in 6 files \u2014 tools/build-andhra-pradesh-coverage.py, tools/build-punjab-coverage.py, tools/build-tamil-nadu-coverage.py, tools/build-telangana-coverage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-andhra-pradesh-coverage.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc37ce37544ca01c348ac87f2b1758d1e17f713f88abff920d85c5e1f8560a6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, bool) and isinstance(value, (int, float)) and math.isfinite(value)\u0060 appears character-identically in 2 files \u2014 tools/build-highway-contract-packs.py, tools/build-pmgsy-road-agreement-packs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-highway-contract-packs.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d3a86fafff322504c4f6194884162909d8e301104a24d1d99f9467c9965f44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, dict) or value.get(\u0022schema_version\u0022) != schema\u0060 appears character-identically in 2 files \u2014 ml/yolo/prepare_dataset.py, ml/yolo/release.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/yolo/prepare_dataset.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b62857d1d1b293223a7080c8b4a3683f0ac60f0a06f6bd0556382177421c98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value or value != value.strip()\u0060 appears character-identically in 2 files \u2014 tools/pull-bihar-road-tenders.py, tools/pull-telangana-road-tenders.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca6465bd17d448d49de47165bfa44d11dc547aa9aa0b98bcba452f4e8803bb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not name.lower().endswith(\u0022.jpg\u0022) or \u0022_WS_\u0022 not in name\u0060 appears character-identically in 2 files \u2014 ml/classifier/datasets.py, ml/detector/prepare.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/datasets.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8712796c68bada938fb6f3d5b4aba62e43a2b86dcf1ce780dbc2b4c4ca528ee9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.exists() and output.read_bytes() != content\u0060 appears character-identically in 2 files \u2014 tools/build-gepnic-road-notice-packs.py, tools/build-pmgsy-road-agreement-packs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae881a89176e722cd72ed7b5b9e966e8d0d7efc306182ffb6f85dab993b70dbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.exists() and output.read_bytes() != pack_bytes\u0060 appears character-identically in 2 files \u2014 tools/build-highway-contract-packs.py, tools/state_pack_tools.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-highway-contract-packs.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"51558ebd0cabebfa9aab228b5b1f3f12b7ab36370036ccc539a430b5c52ab191"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.scheme == \u0022https\u0022 and bool(parsed.netloc)\u0060 appears character-identically in 3 files \u2014 tools/build-gepnic-road-notice-packs.py, tools/build-highway-contract-packs.py, tools/build-pmgsy-road-agreement-packs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cecda43747dc1e38c690e2bad77ae62a8574b24ebe16d7e5af320e79d80f8ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.tzinfo is not None and parsed.utcoffset() == timedelta(0)\u0060 appears character-identically in 2 files \u2014 tools/build-highway-contract-packs.py, tools/build-pmgsy-road-agreement-packs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-highway-contract-packs.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cb24a3090650dc81906baf74044c723a3dc022acf2e153df2e44c5a8bd6aca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.exists() and path.read_bytes() == content\u0060 appears character-identically in 5 files \u2014 tools/build-gepnic-road-notice-packs.py, tools/build-highway-contract-packs.py, tools/build-pmgsy-road-agreement-packs.py, tools/pull-pmgsy-road-agreements.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8439d441753c709f3ba1aa2911045d21eb67266354b9ab4e3866441798cc63d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060precision is not None and recall is not None and precision \u002B recall\u0060 appears character-identically in 2 files \u2014 eval/run_eval.py, eval/run_tender_eval.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaed5e7964e5f6e381757f47c60898d31a5ad1d054eb932421021a73f2ba6218"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.get(\u0022closing_at_text\u0022) or row.get(\u0022closing_at\u0022)\u0060 appears character-identically in 2 files \u2014 tools/pull-chhattisgarh-chips-road-tenders.py, tools/pull-gujarat-nprocure-road-tenders.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-chhattisgarh-chips-road-tenders.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a180085fec9438a3dff4bb79b929ae715a4412e148b46cbc350be408b84c993"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.get(\u0022estimated_value_text\u0022) or row.get(\u0022estimated_value\u0022)\u0060 appears character-identically in 2 files \u2014 tools/pull-chhattisgarh-chips-road-tenders.py, tools/pull-gujarat-nprocure-road-tenders.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-chhattisgarh-chips-road-tenders.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"636a3f911e6bb1c5bdaf9439de1024f0fef491c554a6de74e75f95250421a449"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(pack[field]) is not int or pack[field] \u003C 0\u0060 appears character-identically in 2 files \u2014 tools/pull-bihar-road-tenders.py, tools/pull-telangana-road-tenders.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pull-bihar-road-tenders.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b06b3af6c0ba6a23193dbfe89ea9e4053569870202e725f2172fd6cd2d72edd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(source[field]) is not int or source[field] \u003C= 0\u0060 appears character-identically in 3 files \u2014 eval/exhaustive_video_eval.py, eval/private_drive_corpus.py, eval/private_release_gate.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8180e249096a65d9d8c6ec664dfbd3c57e00403e2a56876484af23093e167be6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(value[key]) is int and value[key] \u003E= 0\u0060 appears character-identically in 2 files \u2014 tools/build-gepnic-road-notice-packs.py, tools/build-pmgsy-road-agreement-packs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"737121b138eaada07f93ac5c30c1cb06b4d96df7cd06f52abaf20a5e2154a65a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width \u003C 1 or height \u003C 1 or width * height \u003E max_decoded_pixels\u0060 appears character-identically in 2 files \u2014 infra/aws-yolo/service/detector.py, ml/yolo/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-yolo/service/detector.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"17adc1e759aafb723d4949358a2d686e22a5547bf51ca4871c70915573bf30ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x_center - width / 2 \u003C -tolerance or x_center \u002B width / 2 \u003E 1 \u002B tolerance or y_center - height / 2 \u003C -tolerance or y_center \u002B height / 2 \u003E 1\u2026\u0060 appears character-identically in 2 files \u2014 eval/rad_dataset.py, ml/yolo/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/rad_dataset.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"19291885f2b399efe0bf62ecb5c4a9d01edc33810b61df6ebc17ed96e9a4661e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reject_private_locator_strings\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 106 (\u0060reject_private_locator_strings\u0060) with a piece of \u0060value\u0060 (and at line 110) \u2014 and nowhere in \u0060reject_private_locator_strings\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. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060reject_private_locator_strings\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/exhaustive_video_eval.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662a44af192b6ac2506adffd9e4cf2af7d8a62f8a13f021fa24563cb8348d84"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reject_absolute_paths\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 88 (\u0060reject_absolute_paths\u0060) with a piece of \u0060value\u0060 (and at line 91) \u2014 and nowhere in \u0060reject_absolute_paths\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. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060reject_absolute_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/private_drive_corpus.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9f4b16c206266ab2e194ebc5decd5596e0fa8ad018c0e3336817cd23315928"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept an AbortSignal or the coroutine\u0027s cancellation: Only 44/66 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; Ktor, OkHttp newCall, URL streams) accept an AbortSignal or the coroutine\u0027s cancellation or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a \u0060signal\u0060 () and hand it to the request; in a Kotlin suspend function, make the request with a call that suspends \u2014 Ktor, OkHttp\u0027s \u0060executeAsync()\u0060, or a \u0060suspendCancellableCoroutine\u0060 that cancels the \u0060Call\u0060 \u2014 not a blocking \u0060execute()\u0060: \u0060withContext(Dispatchers.IO)\u0060 moves the call off the caller\u0027s thread but does not make it cancellable; 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":"21eeee9e423271c6ca8c1585dbd13becefdff0bcb29bcd0381c3b54ed97e04fd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: prewarm: \u0060prewarm\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"800c6903ade7db0164451d5da10014ef5169083d093aa0a1ef175f4896dfa142"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getStatePackManifest: \u0060getStatePackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"1016bbfd8184ef00a2e66268d384440cc2df2effaa02659254d5e02cba7ba628"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getHighwayPackManifest: \u0060getHighwayPackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":3954}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4fce832270985efd9f97733e62d5af82043353090f20c8f0b434bf18a6773c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: dataUrlToBlob: \u0060dataUrlToBlob\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":8946}}}],"partialFingerprints":{"codehealthFindingId/v1":"38de80026e617fb6655e528f7cc4d5ab12b8c9f5e9a46e4c8aa6cf82ba00e81a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: decodeRepairEvidence: \u0060decodeRepairEvidence\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"360a454072ae81a46817840bad855275cd0c29817d57d14c7b655d6bcba6a0b4"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: prewarm: \u0060prewarm\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3239b652c38561a22f70b8407b151cd7223d7d6828bb531a74f70249a1de83"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getStatePackManifest: \u0060getStatePackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2511df8a6343dfe1368d7cdbd12ae0ffb6740a449b9db4b9f930756671f710ac"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getHighwayPackManifest: \u0060getHighwayPackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":3954}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9684e551280bba9ef8be3ea88f1167691e709e85e211d6860ce336a11dfcfcf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: dataUrlToBlob: \u0060dataUrlToBlob\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":8946}}}],"partialFingerprints":{"codehealthFindingId/v1":"1231df39fc8ef9ca3d2f9023cce5e5b3a6def64aabef2ed1cdb9a9d3f216d9cd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: decodeRepairEvidence: \u0060decodeRepairEvidence\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84186451f28a0dbb9bd5514fbfba65bd4589405ca2608cf71141a9ad9a07c0f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: prewarm: \u0060prewarm\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67507a09f2f4cc3ff143e5c273a5b615cf79043f1ba7e2b5e9136530a3f5c7a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getStatePackManifest: \u0060getStatePackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"170d8ce30cef7497177854a3ef2a26ad2d4b085733043e23ba5822ccf0f5e3f0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getHighwayPackManifest: \u0060getHighwayPackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":3954}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be310bcd1e470dbd14d5ec9362e73e0cf71a1340213be48f29f683e99435386"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: dataUrlToBlob: \u0060dataUrlToBlob\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":8946}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13a65b38ccdd1b8ae2c622234abff594b70cb0c1090cdd2ab49a26f08bc7805"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: decodeRepairEvidence: \u0060decodeRepairEvidence\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"762ba4768fab33e6363aee098cd43f1f9517d5aa53a8d99a76ab173709f56b0e"}},{"ruleId":"X2","level":"warning","message":{"text":"Suspend function with a blocking request: doWork: \u0060doWork\u0060 suspends, but makes its request with \u0060URL(\u2026).openConnection()\u0060, which blocks: its caller\u0027s cancellation cannot reach the request, so it runs to its end after whatever wanted it has given up \u2014 \u0060withContext(Dispatchers.IO)\u0060 moves it off the caller\u0027s thread and does not change that. Make the request with a call that suspends: Ktor, OkHttp\u0027s \u0060executeAsync()\u0060, or a \u0060suspendCancellableCoroutine\u0060 over \u0060enqueue\u0060 that cancels the \u0060Call\u0060 in \u0060invokeOnCancellation\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/messages/MessageWorker.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea08d57f1144bab6a0bead0adee86c8b7eb4a58a52fb48df5a9e62dc96d3ae3"}},{"ruleId":"X2","level":"warning","message":{"text":"Suspend function with a blocking request: detect: \u0060detect\u0060 suspends, but makes its request with \u0060newCall(\u2026).execute()\u0060, which blocks: its caller\u0027s cancellation cannot reach the request, so it runs to its end after whatever wanted it has given up \u2014 \u0060withContext(Dispatchers.IO)\u0060 moves it off the caller\u0027s thread and does not change that. Make the request with a call that suspends: Ktor, OkHttp\u0027s \u0060executeAsync()\u0060, or a \u0060suspendCancellableCoroutine\u0060 over \u0060enqueue\u0060 that cancels the \u0060Call\u0060 in \u0060invokeOnCancellation\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DetectionDispatcher.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b58bd0267080c3b1eb063f3351695ff75364b126fca5a9d123aadf956ba382a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: prewarm: \u0060prewarm\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6173513dcd1cdb9b0135937067a81a132e450e8fe6fab9e5647cb8438e2fdc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getStatePackManifest: \u0060getStatePackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"865ee20e57f8c4004ef586ddbf9bffed5d2d4abc6b48782b397812b49b895d98"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getHighwayPackManifest: \u0060getHighwayPackManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":3954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d410ad65c11f0d3342c1beca562c5c3d472dc29a3d05291a03fa610fad02dcac"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: dataUrlToBlob: \u0060dataUrlToBlob\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":8946}}}],"partialFingerprints":{"codehealthFindingId/v1":"644e3b72290bdfedef6f0a93ce8289b15dc2f3a2e25c7c4afd50b6aad568e4a2"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: decodeRepairEvidence: \u0060decodeRepairEvidence\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":11907}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d7f4dfdbdc51c8b891fc173f260622531aaba4def77dfb04a80b381d1c07c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/harness/webview-drive-analyse.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cdaa0e58ca3b09e06b05af44d2cebe37d2e2dd668a59d72f1a26f697ebbced"}},{"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":"tools/harness/webview-drive-analyse.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7f10ae40be71fceed67e99aaec02c97b76a0e5c9d3d640cdd9d758e29eee72"}},{"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":"tools/harness/webview-drive-analyse.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5891022f41edba3273a103ebbb23a733aa0bee47986d9c743e402165416e94"}},{"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":"static/standalone.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f493a0f45499a4c1fe686e3634df2f9f1e36834468f358b6c656c63ee222bd53"}},{"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":"static/standalone.js"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14f6ae9091cc4ba0aeecb05b5ae0de908338dd4371878bcb012ab6e09974575"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\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":"static/standalone.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bb5f0b2f4b6113111b644154007a66808b53cf91d65b20ba20992a9f9662ed"}},{"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":"static/standalone.js"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"3962aa4dbfa2b5cfaffb2fcafbeecbaf6919436626cb6354e8b06d026d9f87f9"}},{"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":"static/standalone.js"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf65a7f48c7023bfd1bd6e8e98c1c3d4adf9a1bdd2b18837d52bba26beff8ce"}},{"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":"static/standalone.js"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d1b6054aae6885108de49bdfd5f961d245a1e5af0bfca22a3fb52ed7f93386"}},{"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":"static/standalone.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f034d0786d54b95ca045c4ad96c4a0348d693ab10ffd3aab0839e456fd501850"}},{"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":"static/standalone.js"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5d9ef440ba5538fede51fd0361b7a46f6cadfee24635a94660104088463c31"}},{"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":"static/standalone.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"8175128f71539a32122b8af1a19602607abf1d152b633b6f2685853d8cf52a1e"}},{"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":"static/standalone.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7b25d97a213b95c00b15899bc2c07e46f7d0381511d99d1003a065482b2712"}},{"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":"static/standalone.js"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f9a2e3efe70985af27494fc18dd31e2ebf6d54e6015758f78812e777aa010c"}},{"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":"static/standalone.js"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"443a0b6c9eb6da43ef1534d63a734048f86b6d918f357139f0956d8db3aed4ee"}},{"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":"static/standalone.js"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de7a709d818fdad636bba871a284779baecdfb27303322f18e91c32df897756"}},{"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":"static/standalone.js"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4ee3129ec63d55b9781bf560262082debd647943fd03fd62d2abdba0ad98c1"}},{"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":"static/standalone.js"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"4454e918b3d736d9c7f1b9411d0200cf59e3c68993b8d8a987e362f63efb960d"}},{"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":"static/standalone.js"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"04143cb23342979d5acbefc143f08dcc26bb9cc739b66ebaca04f0332ebd8cb8"}},{"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":"static/standalone.js"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0496800886f395812c71bcb19532ad6ba0619d2c91e777271845aca713ff23cc"}},{"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":"static/standalone.js"},"region":{"startLine":2958}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca190496fc30ee4637f1da50d90f8b0de53160ce5afe2e13fc020744947d9205"}},{"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":"static/standalone.js"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f935a1eb2c4e3cdd427b179e00197e0ba9745683f366d559b189f87127b111"}},{"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":"static/standalone.js"},"region":{"startLine":3198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d13a81d632a1db1dd74536e29e7d181a2abc3424e13ae14d1d4effbeaffa85"}},{"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":"static/standalone.js"},"region":{"startLine":3213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7322c37e6c61051ca861c26ab300ea56abf2d8f8be21778944b03653772a41a4"}},{"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":"static/standalone.js"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3b8ae81c1e80093815647bf3b6018ca91090d300c53a2d845d09d51127eebc"}},{"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":"static/standalone.js"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"02360b2fad0c7ecb2a6b5878b65e237fc5f4bd09ef1e7dc88a95b19bf9e2b735"}},{"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":"static/standalone.js"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ac5944086d2709e2e2402f6f2c658ff8847405252d757844cb671a42dfc6a2"}},{"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":"static/standalone.js"},"region":{"startLine":3768}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9e8a603cce0debf05f9c4f28962d12d9374ec7ff3d104e38bc2940df53f76b"}},{"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":"static/standalone.js"},"region":{"startLine":3778}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2701244e8d9c03f2d9361c6b6bedc6712d7c49b9f1f310dffed6485c3f61315"}},{"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":"static/standalone.js"},"region":{"startLine":3793}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0045fbf253d5c851c871f3444e0c4aeef99f9ed3e1b388bf7b405b73ed8178"}},{"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":"static/standalone.js"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db356a0939177e1fe330b05124b0bc368cb4bfd3376bfa7207e86162dc12145"}},{"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":"static/standalone.js"},"region":{"startLine":4043}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f409fb37abdce22fdf9f5bb1964ba51070ba425c7e176f92ef47205da4db93"}},{"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":"static/standalone.js"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab27876a07b7adcb352119eb519d09e47259bb4313ceafbfd856021bc9e61767"}},{"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":"static/standalone.js"},"region":{"startLine":4067}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88e83d9d6f96636f88adfdd5abc9bd734f0ed9559a0201c5943097c1e3883a8"}},{"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":"static/standalone.js"},"region":{"startLine":4206}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e689de59c9ea29367bf997cc732f5fdc18ca8f3d4840d14a70ac4e54fc6a3e"}},{"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":"static/standalone.js"},"region":{"startLine":4226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad892bef0860427b50905497273fac1a4781ef0a7e26512e4875da21e127ae2"}},{"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":"static/standalone.js"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e665e55c91dde3bb0b251518c557673e65ffe0bbb3cce4ae96cf7ad29e7034"}},{"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":"static/standalone.js"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77152e2cbba3b68a6372eb3a3513c57376823a4325b548177c2622f64780af6"}},{"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":"static/standalone.js"},"region":{"startLine":4602}}}],"partialFingerprints":{"codehealthFindingId/v1":"9382f6bebfe7bef180c76c9ad8154f813b6428fcd37e2fce2c2bc7bdf511e347"}},{"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":"static/standalone.js"},"region":{"startLine":4638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1c30f963406235075f1a578748741951e9037cd0a211547719fbd47e5e5cc8"}},{"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":"static/standalone.js"},"region":{"startLine":4689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d256550f763c788274593e412cb05e85d88cfa4422dd4a7dcb3d933427774f"}},{"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":"static/standalone.js"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dea8bba44afcb5b7e014b0a2745ffa726bd3486d1d27b78063232ad0f150d01"}},{"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":"static/standalone.js"},"region":{"startLine":4791}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8f8f81a0801af928c8aa9d35b11a4adeb039705bb3490dff403b2c6c35548"}},{"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":"static/standalone.js"},"region":{"startLine":4845}}}],"partialFingerprints":{"codehealthFindingId/v1":"7321ea034d3da68b1d816661162d215368c4c747101538bb8bc8dcabf8d0144a"}},{"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":"static/standalone.js"},"region":{"startLine":5052}}}],"partialFingerprints":{"codehealthFindingId/v1":"5961d1ab6c6ac136fdcc446abbd3d38e7b1b0defff67fc67f7b8e8134216ad91"}},{"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":"static/standalone.js"},"region":{"startLine":5477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4902f7aaa21aeb08d4e196f9effe456983deba975ba099e8250a9846b6f6044e"}},{"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":"static/standalone.js"},"region":{"startLine":6490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e093f26ee9bd51949d2ec83207835a42a090ad9625616ef343b2b11bdebd800b"}},{"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":"static/standalone.js"},"region":{"startLine":6856}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff995d5fc0a2da962ecd7ccf986d92e2007eac102c77eb1c5c56692f424945db"}},{"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":"static/standalone.js"},"region":{"startLine":6958}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa42310c220c15981fc99b874594350fe738e4cc325dcca065d2cd3447da5045"}},{"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":"static/standalone.js"},"region":{"startLine":8368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef35de8cbbbbecf8d5be3aa86ca4442a5fe6140f15fc2d42d87cea2c1f4a4c27"}},{"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":"static/standalone.js"},"region":{"startLine":8370}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dd98301b277d9f4dd71fb26bbf413456df57cfd2e2f438760839a71df9af88"}},{"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":"static/standalone.js"},"region":{"startLine":8578}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b8d7e1d9f9a5125432b7e197d37eef3e79d0626eff8cb1bafbf0b218b6bf97"}},{"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":"static/standalone.js"},"region":{"startLine":8874}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d9633d8b939095091861b18904b6a0c3c8b3afb1620a26d2068710d2d40eab"}},{"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":"static/standalone.js"},"region":{"startLine":9264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f5b6069ddf738f82edf3c2c99377b9e43e78b8f0b64f5d2f6ff666426f1d30"}},{"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":"static/standalone.js"},"region":{"startLine":9453}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf65cb1055f6217e1a85e28b4d1b461dabc8a42050c07937d7998c6ffda6b55"}},{"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":"static/standalone.js"},"region":{"startLine":9536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e06ed230c6e4add272b4ead79433a4ee7f6ee79c39f6d1bf86ec2647b4db1c"}},{"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":"static/standalone.js"},"region":{"startLine":9537}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3d415015e30cd1460b797f52d1752291f8b34e9d4fca5631cff6b6c8bdfb7e"}},{"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":"static/standalone.js"},"region":{"startLine":9547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c0199e9fab886f8dfebdf745ccdda6885c8618020ec423abbe03b5c38b6cb8"}},{"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":"static/standalone.js"},"region":{"startLine":9565}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af2220e094568b57ab5c657d99faa4d8e4b525cc62f0a1dbd0574d81f565e5b"}},{"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":"static/standalone.js"},"region":{"startLine":9583}}}],"partialFingerprints":{"codehealthFindingId/v1":"787270bb67bd8c55c4a775fe974f27b75d96908a797fbdde4886b3f6976d20a9"}},{"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":"static/standalone.js"},"region":{"startLine":9700}}}],"partialFingerprints":{"codehealthFindingId/v1":"582c45ac1a684136d2b3b3828bbd82d44982181f6488821906c89e0dc13aaf96"}},{"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":"static/standalone.js"},"region":{"startLine":10080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac27dded868df5c3312baced12808a2434fd9c316d8b35642fffd48e941ae03"}},{"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":"static/standalone.js"},"region":{"startLine":10095}}}],"partialFingerprints":{"codehealthFindingId/v1":"233f415893f5fd978cf4e9e3f3ecd9167f6ca725de762c20f899783d3b98794c"}},{"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":"static/standalone.js"},"region":{"startLine":10711}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea4978aef3a8438a2b69e48eb0d776b04d53585c4e8153d0028f4128a0eeeac"}},{"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":"static/standalone.js"},"region":{"startLine":10715}}}],"partialFingerprints":{"codehealthFindingId/v1":"c915db2ba249a6787d3c81016d66919c68a8c1c12317c57220ddb0e83dfe62af"}},{"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":"static/standalone.js"},"region":{"startLine":11026}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95ad4daa14d8888b7d3e7a5e5e1c8a1ef8ed73e6ed8485c900723a9e25f21c0"}},{"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":"static/standalone.js"},"region":{"startLine":11043}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dd0fbf2f6a0ca44545b5e6d19f0e7fa4fa517ee5f0bd3f0f074b3ae1129f37"}},{"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":"static/standalone.js"},"region":{"startLine":13469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df1fd583d5e144a0786b19b668eeb85d111442c85d1995597627ef4afdf1379"}},{"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":"static/standalone.js"},"region":{"startLine":13470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff3ae6c4fbaad90d07f89366831503fe687bf29c1af6bc7a66264c494e6ed63"}},{"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":"static/standalone.js"},"region":{"startLine":13472}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d67485a3158d6b1edf801557174b5f550a2f90704c7df8ac696ee137b90b74f"}},{"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":"static/standalone.js"},"region":{"startLine":13479}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c080c9be2f87782ed685c61605120f6d9db998b28c3f2c9a86aa2b5cdf8c39"}},{"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":"static/standalone.js"},"region":{"startLine":13486}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e34f152c865746ebc0cac7d68183db80aa286e5ab93ce557cfe23df4033182"}},{"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":"static/standalone.js"},"region":{"startLine":13487}}}],"partialFingerprints":{"codehealthFindingId/v1":"456cf174ce4ae18856d07e0d0207518cf387812f5f0dd14f1e6294eef26ebd77"}},{"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":"static/standalone.js"},"region":{"startLine":13490}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec966a5ab4a85f17a5fd67d71f6e2778fe43003a5c6f2e5296b289214e83225"}},{"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":"static/standalone.js"},"region":{"startLine":13492}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c606ac124b5e01c5497fb12b0caff111d7a2cd76c98cce573e271863e17d8c4"}},{"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":"server/src/index.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f28ff6574d3ba90ed1fb13b47b6a45ed1f0f3d1dcc7b09250257084676e4f60"}},{"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":"server/src/index.js"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebccce71a4839fa9541ace42da6d9fecf9cac97f641bca73352cc49c4951bc4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/detector/scan_overlays.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf399ddc0c5a18f1873481225a5752f2f476ee43046fef9d3b781d85ade54f7"}},{"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":"ml/detector/lambda/handler.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4990a12db1aee0bb08905cdc1cff495c4306672f38abd1166420b5eb91a0d09f"}},{"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":"ml/classifier/lambda/handler.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ccdc2de7301ff060678b58a7ff84d147988c63f16c4e8e88f54e67c50b5abf"}},{"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":"infra/aws-central/tools/kgis-layers.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d8b5aa0170e40afa91e5a2b344738003e378e7bf263ab0aedebfee804a014a"}},{"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":"infra/aws-central/service/core.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"70434aec15257e52a61dae3512206577039d9c52a8242b067e814797ea42193f"}},{"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":"infra/aws-central/service/core.mjs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"77611cff8c9fb28377339ccc654a0f3af281aa00e8b6a72214167da647a41765"}},{"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":"infra/aws-central/service/core.mjs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"469393d321480a525753d59b56f75bd02c58c6d8fe0307c215a5e7dd2df1adf4"}},{"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":"infra/aws-central/service/geo-cache.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b5efd6dd6e1b270ffdacd822f803dd2475a6c3441080ba9e58b4d62169dc99"}},{"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":"infra/aws-central/service/health/insights.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0647b70439f98703a4fc71645c533135131ca579490e127410c8c2f3dec5dc9"}},{"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":"infra/aws-central/service/health/window.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66466b19118e5dee40673fd4050bdf6379a5632fdcb27b586cf7b8ec623ac45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c866a990e1f48bb0127f1ef657632be94ba14d3ad798aaa16336fa4205aeef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_eval.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c4ae550f06a83a2eda40afde3d7c4512ec0308dc3c8ad1574a25a73c0e376d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/run_tender_eval.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de50579e11149bf294de7ee6dde57b14a7f1a52435b3ceb490ff31b218b7c14"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c226bf54640c09a4aed2cb60fbf9356afb75070d26a16fba74cc1b0110f7e7"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58f916bbec6fbdd24ef54e05ef475b22e2274dead10a38519a9732d2488b2ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\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":"android-app/www/standalone.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"c107246a88804b18decd0126b0f63e41cce0fb12033ac5be6f3a3c910bc5b3a3"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de37509e2806c6d8fbf3d14544b31cc8851aa4a4d8e8c68a237e165d495177b"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6dd930af08697814a77682bfd34f46fbf29205524e6c103be2eea31c6932cc"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5cd5031cc02406fba7b3859b6ab8da2656f3145685ca8483e1b847de86ac92"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ef7bfc47607af5e3173a77b6cbb0f2e950c3e01806b9347f521dc9c3ff3485"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"0979c625270e9bedce95c5d4155d3e6099e26e38061457d7d9e45f4b0b96a4c4"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"232372bf99375205431c2a03f63c95f43a1d621af6f312e1a34b84952600c24e"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1eb00949bbba3ce5395e28d9ba3344190f355f4c33e4e447e1d6f468afee5f"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8837a72a40e01b517f7cfe58f6fa038695b267d679f12a81d6252da336362b"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bd18484f99b5db203c3948be6b3200dbb8f243f4b40a4ebe741c247b4fa5b7"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fc8ea002944aec28645b6a738b7e5481e87261ef8d18e2cac9c2b9f7d09f1a"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"63860625a97a80c4c98ec78d8633bff229cf646c94d7e69f655f82d0b649ce85"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53ff2e56d6e37dade16c1c273b977707f59aaa144d7fc9cb4a916ada0d0eebf"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7a04f34fd22c37fdee6064efa96cc379641fc8a2c67d60767627c3e94f378c"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"83868e9406cb7b10783d966296319d97a4b5a029467271ecf1376d10d3bda5da"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":2958}}}],"partialFingerprints":{"codehealthFindingId/v1":"514d2b49c69be75aa56e12d6f7deaa9472978ba0551198fa4bf80ac8c9ded0dd"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f9856476a40bfd91be9966524cf0c784ec45af04b0bad44c3239ba56c7869f"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e62aacd54929cb4b77137d8660b66d0589707b4ecf0b70c2fc33574736a0bae"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ada227d485c1944a96487bcf91c371cba96cba82b222f74ff0d7cbb6d275221"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e13d38029401b7f7bb5c1f52c055c1208ed10a8e498100c06a7e2d888f2d07"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb1fbc12cfb6758133dc868e7431c8363e3d8ab31846f025ed7cc3c4887a65b"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4082b25f2c5b0eb2ceb0abd9c4b8a774d8f494073f3414b9e403f03271303b"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3768}}}],"partialFingerprints":{"codehealthFindingId/v1":"853a11350e9788dba65ce8b08df91edc591a042f87da15702266b6f1255f5388"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e75c6f0dfd5bc1d44eedf028cecb5c279bd90c3bbe91f96a8268cae69e016d"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3793}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d99ef78618272c984a02e1927f4103bd5cd8d95ff681f158af79e8ce5e73a1"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"601524d9dae195cb76f100ca08b6554e2d33469e830c61435f0a9fa632731eb6"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4043}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d779950d5a0e3f71a01c7ccb0e74508d13ee9ee6b7812b8900f3d63a0304919"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"4643a8ddf61fefe46ffe03edc23419bb89769b25784555ec6ea1d29278a90527"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4067}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee88f3d82202b0168ef33e1d5ccc0338eca027533f5d4489af1a95cc550d9cd6"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93e076f90e3494ab9a7efe02c39e1f1b430b640febabfec6b3b40fdf4bdde1b"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4226}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad758069bb2a936ca35f38f5e6da9fa5ac837cdea9d6d7b1dbd0b443841b612"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcb3bf0ef2b6a1917fcb611420e41ad2806fdac19ffd6d3be355db32220c6a5"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d811c0036c92dde1e9c08a482cee7deb93fa0ed3b5a001962640f4d705329975"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4602}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b0a4093c9d7cf7dac95527c18fef3a6d503dc7cc2abbb72027ad96f7b8801f"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4638}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa08ddf126a32372000ea1f863d8843d65173e3f626e9f5681190062f29288f"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2b236be40de13ba10c41e8dbdd32e2fdff4c154d46b54b546c18a0b4d1d9b2"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"418b8b7a33ebe15f26030774195121c512d2b040db1ff3f56d95c3af0173bf3b"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4791}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6dcd6c365027667bb3208cf7dbc5a81d7ac185c27e3184d613d40ac0cb9851"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":4845}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a781c362908a020977d6db9f3e664d110008f24929a3fd4e99507b8eb08e3e"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":5052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d8d644408eb071e8df4c96823c6868dc9d607ebb0df8b733029652995bc1ce"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":5477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c151f48012aaad1b0e17a58b8e51e852a510f76fa846a467c08a3aaa8dd094c"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":6490}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a66bb1d73850de3575e43e21c9bb7d5e0eae18431c9ffdb345339cd0ef01251"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":6856}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d75631281ce1f0eda95d9b1b9669875a3e7eb15de0651deb5676eb09b9f9e2e"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":6958}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf6f9f9ee22a06d2ff2be6456d83e4e475481b0da5900f540fb136ab95ef01a"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":8368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7df79bac2efcca89c96f68d831dadc72801fba85536de0e0d01d05b953d54e3"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":8370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efcae47e5dbb59b945df5f5566c26bd2c39773c651f6c511c6c25eac0ca7a2a"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":8578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9277fd0970a6c8134aa05a5ca46db77cf23bcfbcaad71c175ddef4382ec268d6"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":8874}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd7de226f4a441f332ef87215abb6ac221006e19450c82bc0aa2e732467a8ce"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9264}}}],"partialFingerprints":{"codehealthFindingId/v1":"317f4707690259702239d249fa008f56c5a79447d25ebf487a46df86efcd87d0"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9453}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc28b0b6f3465b0343b96883aa94856601c341453602344b3bae4d2d0363cffa"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9536}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ba2d979c18785dfa45da611aa6cee6819fa377d293da3a53861e8f4e4873b8"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6308d3929244c85a576159db3fdb9fcf502a39b807778600ed788d2082c6a7"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee89443a5f5e7db633d78774e62ef9372346fb553f80ed09b9993f44033363f"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9565}}}],"partialFingerprints":{"codehealthFindingId/v1":"86676b47f54735dc2b724d55d5823669ed6e78603661d47f8671c6713f04647c"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b89ed9aca92ea87a17e5328e0a3f226f84438af44dea485b2318d3ab6924fd1"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":9700}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2fd64025db1a74541c673b51674fc4464c30ca5c517e7d664ca1b69d4385cc"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":10080}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1f0c5e8ab72c0b0914d6916461cfc99fc146adcdcee9d3fe2f5e086d1bde6f"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":10095}}}],"partialFingerprints":{"codehealthFindingId/v1":"61efb13fda69d849a8aeb981ba68f992950a869ece8a750f4158092663cb1ea3"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":10711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9e9ac1c1d9db1c30480571ef356e0081f3f29656963568c62d750038f410b2"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":10715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea24cc60d6f95b056cf8673d6dd32a021472ba7eebd2182b953d09ba3e626ef7"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":11026}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d7ff5bf04bd4df789223605d8a781fb0d237a67be0d3a4da67efd2b8861854"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":11043}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5d11891547e4769e1e893a4ac759210aadc4051da62ee47981fd307288687e"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aefa9d68b46cf97fe749552c81386dfbffaca2c9921dc7236628b9968a427c9"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6b5e887e9894b857e3fde7b352aad069b770ed706293b2e367fcc725d1f247"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4969fff9ce2e797069818f90aa1e6cd1aafcf6dc114ca230273cd1a41965b462"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae19c3f0130080dd895e95c09ba810ab3fbf86e9ff588651d9a90421fa2f943"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13486}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddde2b68bfb9bb4fd15b58cd799ccd237681a697ff9791829cc3dc3f86975f2"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13487}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b06222661af7030051f656b09fb869f3c12bd8780de6749082a8ef9723cd5e"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62ccef611b91be2cbcb1d3c535a12b10987f73ec9ada1ba37db719349ffcf34"}},{"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":"android-app/www/standalone.js"},"region":{"startLine":13492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6017dc60f011c6bfe2c4741e09728a843e25d80eb33327e11f7c38435efb4af8"}},{"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":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea40b8c10e5d321d78d8075e145ffeed9a71ab54e3b489df0a7651188a6634"}},{"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":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d78586423d384fc4d927f3ed1254bf767ce36e4efb768c5fab7785934dea65b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c021e8830df986d4e23a6015a11e571f3f072f0b92a648269a7b8f7ffefbf7bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/NativeBridgeJpeg.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"457f7c9599415db2e071df6718225ec8b9ab655a33a61480a790bb52c8a81352"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"8990ca96d69b3719947e1a9c725b64619c6470080bd27ff703a8af36a5f026aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f048b366b5fb7b53fe3893111a69a80e9ff56c40b0b79df8ec4d80ada574adb1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b730931e365a1edf03c109763c9e212b1e2aa6230d2886064ec413a27fc7c11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/DriveForegroundService.kt"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb11f0998d3f0de4879903e10169b3e19e414c3dcefcffb2156eb2abdce0c248"}},{"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":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDeduplicationEngine.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8820b8347197f6ad5b13be28892ba344228a647f48af8bf5bbea5544d4d25dcd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e580abf268d7b6be63dd5a8f990fcdeea388eb8dd6c461d121444c31fb4977bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveLocationProvider.kt"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ec8087fb8a1d23b804e1ebefa46dceb38c825b208c85fe7f786c856eff0b67"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeInferenceTransport.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9099e935a96f562eed5d90ee62267f13b71a5648f6dd49055ac4ddd96f7c8a80"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2560f84a258bdfd1950c0ef502f38958ec550d382454fc3a235d467f4f8ec3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DriveModeService.kt"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"536f11bfa79cacb1b92b26baec7f46b0d6de2a2978983720c485142b9691a6d4"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c053d30a95a6f8573efec29ef97dd71f08498e25ac495c4fc2338d81197adfa"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e878d57346f7ef360fcb6b3caeebb581b552f281bcae3deca4be9da11988f3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d7855a462a0701396182376939dd5e1e0aa141b19089e22651241dce132ac8"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"static/standalone.js"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b6d1124574b6b5661346e12a7888ca0ca7c61e1d9497eb86edbec5e726ba96"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/build_manifest.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e23aedb74b32601d8034aa73fbefcee8f467aff4dad27423ea6e8175338927"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/datasets.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5976a816dc091066ba6f07b3f68a734cc4798dfc500d5691c4798f487294d130"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ml/classifier/datasets.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a8433328b86e771eb4a2898fb16ca00d0f00a33b7d23f285d9d21e4aec4388"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff489e2d82a74956d580c2b0211d1ec5eb36f0a0ade8d489823c53ea5c3a39ee"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff3141c2a53f2f434d42560b7defefa726c5bad1a7edabcb22396f3e243684c"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"321bc9f3bac1b5dd5c084acf3baa6ed50f01a1d98e5c1ee8afa53d68cba0fbf2"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/standalone.js"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57a7eff5fc1f598deb9e74f3b5bffa27c7ec1935ae7ffc0f7614ba0aa40b341"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b618da3e4022128639bc49e042bfd53cd730b6d5d0480c84520e3e9797eb3c7"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d03970ffa8695a2d7dde026795ea6906360c12d2f92768df0aa691a782a402"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4b617820583dc80e78ecb7d582746c26be00bc3ac148b0a029ba0cf832adbc"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/www/standalone.js"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2121aa48fcd2e742a6a1fc95b4e5ce6a3ea6d3894989d3bd5b95bcf70d3178"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b0868ee06fd7c97f8751bf47cd0a4043b8e95d71673724357b4294c1aeac8"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d664cf84330cc0a534fa1c02889c671c60f2810094a0bdfd70562ef2940eef5"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2811ea3f39624b05f98213b22e4020ee7282bc5a901c54283ac4775a2126303"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42a36f354680d0239ef3aa1e9e09133673bac368d7a6dc5271d4b354ae4c980"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f6b9d68e28ab3a2aa407b940ef2b206e5e99ca632ec63dbe41ac1ee6a30f61"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2310c521146154e39f8588e01822cadbf75e2e6bcee380c2a845ff206ad20c42"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDetectionVerdict.kt"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d393ea82197af8ecc8cea7b57546d0dc4015e7df813f35f0123e275a5132ee92"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad50eba47386ad40e8f427bc5b72089a205e547ebc907244259b5e4e929db372"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b03d10da3714aed6199f3a802a38135f0029bc65d4d6049d28a6fa7121e1ef"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd3e92877b479cad3a2053b2324949d2d9aadb48618d241541a49f55573860a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d93e395ac78a024d86ecaa72cb7f601977b9d78fead46ea88869cdf63082fd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060availableBytes\u0060 swallows every exception into \u00600L\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/bridge/VideoImportStore.kt"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"82250e8fd9f53b9b7d4a2b086daece4208fa76a5411910fe79cc619ae5664c7e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060stringArray\u0060 swallows every exception into \u0060mutableListOf()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/com/gauravsen/potholereporter/drivemode/DuplicateDetector.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"186cbaf6a5196d0949a4224592788c70a62448b6f2c593664e14da9116eb2aa9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readIndex\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/drive/NativeDriveEndSummaryStore.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2265b22facc3ced17b99d2a4f3f7588e5017c9c7f76f8ccd2037e4c2392493"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060nearbyVideoFrameDataUrls\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-app/android/app/src/main/java/dev/aiengg/potholereporter/plugin/DriveModePlugin.kt"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0891920c00577c198d64be5b33e5b7b4102e111c032e2f0afdd7338f5cf83e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_ledger_source_ids\u0060 returns \u0060set()\u0060 when \u0060(OSError, UnicodeDecodeError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build-gepnic-road-notice-packs.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727b15c62b2ad3798c6e29065f8f2f0797497a7bb6bd72de0d763028158d412"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readFeedbackQueue\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":"android-app/android/app/src/main/assets/public/standalone.js"},"region":{"startLine":10588}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdea0ef0a73781f3d3c213e98cb5796e21ddba751c919c6d868502295f03e69f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readFeedbackQueue\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":"android-app/www/standalone.js"},"region":{"startLine":10588}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f33640a424e2dae51794fafe5c9cb3c2d1e2179276243b06f03b733985c9e7b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readFeedbackQueue\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":"docs/standalone.js"},"region":{"startLine":10588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcbe3552f136a96fb665c8f83a93b71761f58992b6fc58c920978e8d075c249"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060verifyInstallationSignature\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"infra/aws-central/service/auth.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d1d50ca9d41d1fb15144254a6d0b447b532904c56204cbc902a5291f5997ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readFeedbackQueue\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":"static/standalone.js"},"region":{"startLine":10588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26e345bf52e493b19690f9082b8f51074e8d7fda2d18102a0c3642a103435b7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadTimings\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":"tools/harness/run.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c7d6551513e0ee4afc9a0559447bf31e0da1a60dc42e850fb1242f9ef8e8f4"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-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-326","guid":"7ee78bef-7589-f65f-a9d7-619f3485e844","name":"Inadequate Encryption Strength","shortDescription":{"text":"Inadequate Encryption Strength"},"helpUri":"https://cwe.mitre.org/data/definitions/326.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-778","guid":"58944737-c935-8a57-9195-e7b7e640597e","name":"Insufficient Logging","shortDescription":{"text":"Insufficient Logging"},"helpUri":"https://cwe.mitre.org/data/definitions/778.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":68,"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."]}]}