{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"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":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"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":"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF2","name":"Allocation hygiene","shortDescription":{"text":"Allocation hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF2"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"main (cyclomatic 224): main has cyclomatic complexity 224 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a43af00fdc29453ae958884726bfbf156c68e34eace7cd3fa508d105f48e84"}},{"ruleId":"D1","level":"warning","message":{"text":"explore-provider.ExploreProvider (cyclomatic 144): explore-provider.ExploreProvider has cyclomatic complexity 144 (threshold 15). Most of this is not in the body itself: 1 of the 144 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 175, 213, 466, \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":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"26406bea9828bbc18d7c4731f198cb945ace16f5508b100aa0c6e4aa46829d5f"}},{"ruleId":"D1","level":"warning","message":{"text":"merge-tracker.mergeTracker::mergeUnderLock (cyclomatic 139): merge-tracker.mergeTracker::mergeUnderLock has cyclomatic complexity 139 (threshold 15). To reduce it, separate the cases: extract each independent 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 (merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch) 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":"merge-tracker.mjs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ec53f17a807799ba799375e76113b0195c91622d4717cde40031c172183479"}},{"ruleId":"D1","level":"warning","message":{"text":"runSelfTest (cyclomatic 120): runSelfTest has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c59605726c3b3998745223d0059900f7fe9371dac72351ee7d18c21f3a3ece2"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-ats-full.main (cyclomatic 110): scan-ats-full.main has cyclomatic complexity 110 (threshold 15). To reduce it, separate the cases: extract each independent 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 (scan-ats-full.main::processJobs) 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":"scan-ats-full.mjs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3a1db034d165d1f40b581e0e2faf6e81063e08c35a677656d337c4363b5d41"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.apply (cyclomatic 104): update-system.apply has cyclomatic complexity 104 (threshold 15). Of this number, 102 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":"update-system.mjs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b756f9ca866a7ef70b1c7885922a5777ffa6ca8394bed7c448db5d718235ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 104): route.POST has cyclomatic complexity 104 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 60 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":"web/src/app/api/run/route.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"36876f0db7abfc94000bdb8c4468445afb73acf527d333ede7aacdbf5a5f2167"}},{"ruleId":"D1","level":"warning","message":{"text":"salary-gap.selfTest (cyclomatic 101): salary-gap.selfTest has cyclomatic complexity 101 (threshold 15). Of this number, 78 points are the body\u0027s own statements and 23 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":"salary-gap.mjs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"08131e93f67b56470f464d04f326b4f4ebb89b1b6bb137ff6acfb8acc5df1285"}},{"ruleId":"D1","level":"warning","message":{"text":"inbox-triage.InboxTriage (cyclomatic 88): inbox-triage.InboxTriage has cyclomatic complexity 88 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 64 belong to 27 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":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9d463415d0ac64e812a76e8289ff9a77bf40ffd1b9a1b37c89f366cb58fbe5"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-provider.ApplyProvider (cyclomatic 84): apply-provider.ApplyProvider has cyclomatic complexity 84 (threshold 15). Most of this is not in the body itself: 1 of the 84 points is its own statement and the rest belongs to 12 function literals inside it that branch (lines 223, 107, 316, \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":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b50e109fe711af16da1ba151baaea70a9699da8d221accc07c584d99cb884bd"}},{"ruleId":"D1","level":"warning","message":{"text":"runSelfTest (cyclomatic 84): runSelfTest has cyclomatic complexity 84 (threshold 15). Of this number, 80 points are the body\u0027s own statements and 4 belong to 10 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":"build-cv-html.mjs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"652bd69cbfcc4564117e992136a14793a5e65b51b638fc784bc185b688a83433"}},{"ruleId":"D1","level":"warning","message":{"text":"buildEvidence (cyclomatic 82): buildEvidence has cyclomatic complexity 82 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 28 belong to 17 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":"github-evidence.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5854fa55f03269d758109fdb70c0f9775e1246f13665af5365b7fc4d7a4b9ce"}},{"ruleId":"D1","level":"warning","message":{"text":"data.NormalizeStatus (cyclomatic 70): data.NormalizeStatus 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":"dashboard/internal/data/career.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d1716df7318468b8e4eaf1dc79e21a7f906a9beb3bb6576b96a9a1541d32dc"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 70): main has cyclomatic complexity 70 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 15 belong to 11 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":"check-liveness.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e6228160a0bf6b898aa8428841c7e0bcd29d56fc0735e00f4a21f0dd6c3c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"checkUrlLiveness (cyclomatic 69): checkUrlLiveness has cyclomatic complexity 69 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 46 belong to 22 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":"liveness-browser.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc435c07bc9f2d04ca13799338217da6637f5efd09002555b8b7fde4c4549c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.extractForm (cyclomatic 68): extract.extractForm has cyclomatic complexity 68 (threshold 15). Most of this is not in the body itself: 1 of the 68 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 23, 52, 91, \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":"web/src/lib/apply/extract.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df89acd8ac18401a75c2b9c7af8741e115721790391a5512708f14bcedb5331"}},{"ruleId":"D1","level":"warning","message":{"text":"explorer-view.ExplorerView (cyclomatic 67): explorer-view.ExplorerView has cyclomatic complexity 67 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 14 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":"web/src/components/explore/explorer-view.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a54f919e4e8e63579e440a5def48161a7a4f8e82f28edc5f48e584459f68f4"}},{"ruleId":"D1","level":"warning","message":{"text":"validate-portals.validatePortalsConfig (cyclomatic 66): validate-portals.validatePortalsConfig has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (validate-portals.validatePortalsConfig::validateEntryList) 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":"validate-portals.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a104742b4060bbccac3a9e06c105f546328ba33cd898d0541d5db78c2d5599d"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 65): route.POST has cyclomatic complexity 65 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 43 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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe3cf67738fe82459bab0bca5e99973cc4cd393de823a55b0842bf57b5f8ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline-view.PipelineView (cyclomatic 65): pipeline-view.PipelineView has cyclomatic complexity 65 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 40 belong to 14 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":"web/src/components/pipeline-view.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ab419abf10ef2d2751364a5bcf8462a23500084884b3a703cc51e4cd3b6401"}},{"ruleId":"D1","level":"warning","message":{"text":"today-dashboard.TodayDashboard (cyclomatic 63): today-dashboard.TodayDashboard has cyclomatic complexity 63 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 23 belong to 13 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":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c3f8c9c1a110be1d77c2a2d2740b23fafe025497ef01a22a659638643a4cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"sync-pdf-flags.syncTrackerPdfFlags (cyclomatic 62): sync-pdf-flags.syncTrackerPdfFlags has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync-pdf-flags.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a399c19aae5f9de48a94ca78aef2a458cb25f4bc0489d4e682c651075b4b0a"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.handleKey (cyclomatic 58): PipelineModel.handleKey has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f8d508d49dd66b4b5c55c93a5d83a17a4a7d4134d9325a911da9a33a23505d"}},{"ruleId":"D1","level":"warning","message":{"text":"export-ats-text.formatAtsText (cyclomatic 56): export-ats-text.formatAtsText has cyclomatic complexity 56 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 31 belong to 7 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":"scripts/export-ats-text.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"07549c78a2f2074be0bf683d7c7484da8e740853e90ebd6dd3042a017a5715a4"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 56): fetch has cyclomatic complexity 56 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 17 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/arbeitsagentur.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7790539f3cae709ee824ce204f2e1de65654bd432bf147e59f3a2a731b2184d9"}},{"ruleId":"D1","level":"warning","message":{"text":"followups-view.FollowupsView (cyclomatic 55): followups-view.FollowupsView has cyclomatic complexity 55 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 33 belong to 14 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":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0473ceb696a91fd60128f34704da459691e3abdfe7cf0175f90e3a72cfc753b5"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.locallyModifiedSystemFiles (cyclomatic 54): update-system.locallyModifiedSystemFiles has cyclomatic complexity 54 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c54b2df2106fe40e64d27fb0f0dae2ef7424a1ad9ecf6fd8b6f84feafd34fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"data.CanonicalizeArchetype (cyclomatic 53): data.CanonicalizeArchetype has cyclomatic complexity 53 (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":"dashboard/internal/data/stats.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"31155111a179db51401834cb7038e533d82d46e6fa1277b0fa4e92c2a827e8bd"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnose (cyclomatic 53): diagnose has cyclomatic complexity 53 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 2 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"25804cd17c14abf6a0c630e784c88ca860253802aefa1c872508c4c5c7520c3d"}},{"ruleId":"D1","level":"warning","message":{"text":"_engine.validateManifest (cyclomatic 51): _engine.validateManifest has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de62eebb332ba3d4a692f15c40e29a413acda5b2e123e939f8325317f5c6dff"}},{"ruleId":"D1","level":"warning","message":{"text":"runSelfTest (cyclomatic 51): runSelfTest has cyclomatic complexity 51 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 6 belong to 13 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":"build-cv-latex.mjs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9ed79b1531421e40c9aa548f308440fcdf8dc3546e01bce289c7dd04d6a728"}},{"ruleId":"D1","level":"warning","message":{"text":"doImport (cyclomatic 51): doImport has cyclomatic complexity 51 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 24 belong to 12 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":"career-profile.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c843d4ebc8586de1461502136444bee1af9071a7ef7e08e3315e41841534f27"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-patterns.parseReport (cyclomatic 50): analyze-patterns.parseReport has cyclomatic complexity 50 (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":"analyze-patterns.mjs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c4de3c6ecf5c6e0dee1f23e8d015bf63e8e44c145cf7d9d7ad9bb21f592359"}},{"ruleId":"D1","level":"warning","message":{"text":"fold (cyclomatic 50): fold has cyclomatic complexity 50 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 4 belong to 12 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":"salary-gap.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33f12b4b07d1ea04f0de517d77470a18047f17036083e5716299fb71772aa20"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze (cyclomatic 50): analyze has cyclomatic complexity 50 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 16 belong to 25 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":"analyze-patterns.mjs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"876652f31c37f62214992e2b7a0879f0278fab29386c7b7746f185db1612fb10"}},{"ruleId":"D1","level":"warning","message":{"text":"extractPanelists (cyclomatic 50): extractPanelists has cyclomatic complexity 50 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 17 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":"panelist-roles.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f852c5d5f2e95ae8d18f22faa2be510ddcd0eac3c0ceb7cce0f1da3de2f2534"}},{"ruleId":"D1","level":"warning","message":{"text":"normalizeAnswers (cyclomatic 50): normalizeAnswers has cyclomatic complexity 50 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 5 belong to 5 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":"onboard-write.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8bb06766fab03c083f17336f7ae11eac7c6b036e3ebceb00b94b4f055f511c"}},{"ruleId":"D1","level":"warning","message":{"text":"canonicalizeArchetype (cyclomatic 50): canonicalizeArchetype has cyclomatic complexity 50 (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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2efc31e97e860efa01c981cf083d70ce9bb3a950d409c050b63e0794f65abd"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduled-jobs-view.ScheduledJobsView (cyclomatic 49): scheduled-jobs-view.ScheduledJobsView has cyclomatic complexity 49 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 28 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a96548b56a856cf44aacf598a983ac32736cac23c4dc8fabc7b5c52b45919"}},{"ruleId":"D1","level":"warning","message":{"text":"assistant-console.AssistantConsole (cyclomatic 48): assistant-console.AssistantConsole has cyclomatic complexity 48 (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 (assistant-console.AssistantConsole::send) 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57cd8fad9af9d4fcaec20ec3d99908abf4d584cd57e36c89050cefcc9914073"}},{"ruleId":"D1","level":"warning","message":{"text":"aggregate-tokens.main (cyclomatic 47): aggregate-tokens.main has cyclomatic complexity 47 (threshold 15). Of this number, 46 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":"batch/aggregate-tokens.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b94bdf3caf426b1633faba4fde95b8c9b509006d9d325ed3dde900770b9638"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-watch.main (cyclomatic 47): reply-watch.main has cyclomatic complexity 47 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 24 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":"reply-watch.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"39955b256a146804097a71312fa526f85b070c278d55153ecde3b29cadf242d4"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-ingest.CvIngest (cyclomatic 47): cv-ingest.CvIngest has cyclomatic complexity 47 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 31 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5058daa99d2b887b41bbcce02f804ee097f222e423c32ce89caa89aafa6c4283"}},{"ruleId":"D1","level":"warning","message":{"text":"reconcile-pipeline.reconcile (cyclomatic 46): reconcile-pipeline.reconcile has cyclomatic complexity 46 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reconcile-pipeline.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce61304cbf15152dad4faceec872f91f5a9d2f14d6c6c00b8f86ec41a9d11848"}},{"ruleId":"D1","level":"warning","message":{"text":"rollback (cyclomatic 46): rollback has cyclomatic complexity 46 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 7 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":"update-system.mjs"},"region":{"startLine":5558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e091f30f4fd201d829c051d0ff1cd5020562a52a75168b44bb0ce728c86b4dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"parseCompensation (cyclomatic 45): parseCompensation has cyclomatic complexity 45 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 19 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":"providers/ashby.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9b1b410c81ddbe2aee2f804aab357c5cb7c63cece0909a0d4aedfbad21585"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-matcher.matchCandidates (cyclomatic 44): reply-matcher.matchCandidates 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":"reply-matcher.mjs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65c7ce162d34d18afc751747477e00ed74f557f30da3c1caba714f68f11aab7"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 44): route.POST has cyclomatic complexity 44 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 19 belong to 7 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":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e474d71723ccbddfe226c692e59f9dddb3c33ea84d23d131ab5da8f9facfeac"}},{"ruleId":"D1","level":"warning","message":{"text":"printSummary (cyclomatic 44): printSummary has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9ebdbd40816ee3b22d073673f451ea370a899e08924545710ebae7b562ba57"}},{"ruleId":"D1","level":"warning","message":{"text":"computePortalRecommendations (cyclomatic 44): computePortalRecommendations has cyclomatic complexity 44 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd2c57a7b0382d5c1b13ebc5bca206a779eb0b9dbc083c3179909614f709c97"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 44): fetch has cyclomatic complexity 44 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ee4bae5ec3d876f24f8bb27dbae37b7c8ed9e215e254296f94e0441e21757b"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-pdf.generatePDF (cyclomatic 43): generate-pdf.generatePDF has cyclomatic complexity 43 (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":"generate-pdf.mjs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7a1d7baf1e440592d218d28449ab8b377300870cb81819c848dd31b16dac36"}},{"ruleId":"D1","level":"warning","message":{"text":"employer-source.scanEmployer (cyclomatic 43): employer-source.scanEmployer has cyclomatic complexity 43 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 21 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":"web/src/lib/core/employer-source.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b19e8bae497e3f80b71182b1c8a5c708fcdc34c6e82cc3ad067d23e4ae998e"}},{"ruleId":"D1","level":"warning","message":{"text":"salary-gap.printSummary (cyclomatic 42): salary-gap.printSummary 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":"salary-gap.mjs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa921a9030caf0209d39bf9a973cd6e3c36d5ec9e7b9b050506386161f6da05"}},{"ruleId":"D1","level":"warning","message":{"text":"export-ats-text.normalizeProfile (cyclomatic 42): export-ats-text.normalizeProfile 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":"scripts/export-ats-text.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6798d519c116a577fbe5eb7f5f3b304ac6ef792f4977571f914b165152c46174"}},{"ruleId":"D1","level":"warning","message":{"text":"data.ComputeStatsMetrics (cyclomatic 42): data.ComputeStatsMetrics has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/stats.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3d66a2ed33ab089ac46720f9710fa56e011e9ed5c0d302f4be9083b0117019"}},{"ruleId":"D1","level":"warning","message":{"text":"mapTrackerToApps (cyclomatic 42): mapTrackerToApps has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 3 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cfe4c391a80648d827351a38faa1ee444ea71c18fa4c1bca4028abd496a648"}},{"ruleId":"D1","level":"warning","message":{"text":"parseIcs (cyclomatic 42): parseIcs has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 3 belong to 5 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":"ics-interview.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bf2e0eddeaa66d3703830d2b9274f91915ef2681073145f01fc5737621514c"}},{"ruleId":"D1","level":"warning","message":{"text":"export-ats-text.parseCvMarkdown (cyclomatic 41): export-ats-text.parseCvMarkdown has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2766d70128a3c999736b4d21fe1ff1e1570e3c4ce132b7fe7851493ae6d71874"}},{"ruleId":"D1","level":"warning","message":{"text":"upskill.runSelfTest (cyclomatic 41): upskill.runSelfTest has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a74831fd3aedf2bc5d274c0d9549f3fc15c700090787a901689913351933ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnose.verifyFill (cyclomatic 41): diagnose.verifyFill has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 7 of the 41 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 218, 214, 219). 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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"50adcdbddfeea7d557f4494493004b606496bf51d74888f89e8a8066d6a401b7"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 40): route.POST has cyclomatic complexity 40 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 18 belong to 7 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":"web/src/app/api/assistant/route.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1280228be28a368cadf7c7a5520bccf42bade27dd9cba8feb1cfbb1071a672e"}},{"ruleId":"D1","level":"warning","message":{"text":"appModel.Update (cyclomatic 40): appModel.Update has cyclomatic complexity 40 (threshold 15). Of this number, 39 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":"dashboard/main.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"768486a7afb563f75471b4b33bc9af80f2e5954e7f7f5b0919adec2cd4499b47"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.renderMarkdown (cyclomatic 39): build-cv-html.renderMarkdown has cyclomatic complexity 39 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 9 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc150e789050978c73ab17aea18ad28cd2ac8714fb4e159c8e4d40bec668f87"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-view.ApplyView (cyclomatic 39): apply-view.ApplyView has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 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":"web/src/components/apply-view.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bd062db77c07891d33d3f8c331052289e4ec6571c0d7af6c05f2c07d1812a9"}},{"ruleId":"D1","level":"warning","message":{"text":"assistant-history.cleanMessages (cyclomatic 39): assistant-history.cleanMessages has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 3 of the 39 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 11, 7). 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":"web/src/lib/assistant-history.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75ee104e61e858a35d9222404b77989c37b4b0f0fc93a41f5043c8d055d05d1"}},{"ruleId":"D1","level":"warning","message":{"text":"runBatchFromManifest (cyclomatic 39): runBatchFromManifest has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs 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":"generate-pdf.mjs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"7853195292994624767a4f7c4232c40a482da2399549067bbac3cdf7a422ecd3"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 39): fetch 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":"providers/peoplesoft.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bc450b179081af4b2f4c09ac496564b8aabe5f823229129d4fbb5ceb378526"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 39): fetch has cyclomatic complexity 39 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eightfold.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7866cd98c31b778be14f1e7deb9ba4a237b6bfe09f466e6a5674915f21ba32cf"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-matcher.classifyReply (cyclomatic 38): reply-matcher.classifyReply has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9f890e2570f075326ff20751fba855929bb24e5da67201cbc34addcb381c61"}},{"ruleId":"D1","level":"warning","message":{"text":"discover-ats.resolveCompany (cyclomatic 38): discover-ats.resolveCompany has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbb40107ac1c3278a951c1fd2b09c4a387bf33f2f509939cff86612f937bdb4"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 38): fetch 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":"providers/workday.mjs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0c5f92fdbfa229e8ef25b168f2a3a6cceab75edcb5d946c9c0f99e1d06cb23"}},{"ruleId":"D1","level":"warning","message":{"text":"audit-portals.main (cyclomatic 37): audit-portals.main 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":"audit-portals.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8c37d5b648821116cb82b2def5ebe456aaf8ae873edcb2bd9afd4279521f2b"}},{"ruleId":"D1","level":"warning","message":{"text":"contact-extract.main (cyclomatic 37): contact-extract.main 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":"contact-extract.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e8fa1473279d0bf3e5f9686d86419de6b4a90b2d982d39eb74d57e5cb8149b"}},{"ruleId":"D1","level":"warning","message":{"text":"persist-evaluation-report.writeEvaluationArtifacts (cyclomatic 37): persist-evaluation-report.writeEvaluationArtifacts has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"persist-evaluation-report.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b35fa954969329896b4cbdb0887a81271369670b298ba4b0d304b747994f90e"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-structure.runCli (cyclomatic 37): verify-cv-structure.runCli has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-structure.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f87178d874e9d40f672fc6f6c5480d549b059835608b8bdbb3609027c2bcae4"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 36): fetch has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gupy.mjs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d0394f818fa0551a6fe142f5b4dc2dc3433f12df42b188006dc17e6695ed92"}},{"ruleId":"D1","level":"warning","message":{"text":"company-history.buildCompanyCards (cyclomatic 35): company-history.buildCompanyCards has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a5487086db9f245c18c97cc9adf2de1a55dd92f3c99dc1754a1d746e383ded"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-ats.cssDeclarations (cyclomatic 35): verify-ats.cssDeclarations has cyclomatic complexity 35 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce092dbd47924039dfb55891c79d928206b56c975a33ec610d09ed4858498b73"}},{"ruleId":"D1","level":"warning","message":{"text":"report-view.ReportView (cyclomatic 35): report-view.ReportView has cyclomatic complexity 35 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 12 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":"web/src/components/report-view.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"80861c67a09f6f2c6c5337f6e9e7bbabe1bd3d8aa9ec99f230dc04d7ed22b833"}},{"ruleId":"D1","level":"warning","message":{"text":"report-persist.persistEvaluation (cyclomatic 35): report-persist.persistEvaluation has cyclomatic complexity 35 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-persist.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"38454e2cec397c7ff33a80fe3b1a1c1bd6fc6b1945dc54d913834830eff89457"}},{"ruleId":"D1","level":"warning","message":{"text":"data.deriveNoteFields (cyclomatic 35): data.deriveNoteFields has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/derive.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e2c87c0ea3fb3b65f4d6ed7e981d50f9e7d01a7e0ce4e66215a0684b66b40b"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 35): main has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 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":"rank-pipeline.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a123210b6c3b715bd89b6881536b04751a9669df644ddf8a45419cacb0709470"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-latex.main (cyclomatic 34): build-cv-latex.main has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-latex.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bf83b6e904a6fa501f204c027edc518474565ea6a772f508662b586711e04f"}},{"ruleId":"D1","level":"warning","message":{"text":"wttj.normalizeWttjHit (cyclomatic 34): wttj.normalizeWttjHit has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/wttj.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8287e712bae83ae9baf9bd766b91411e7da68c045b56c3d42cd322d7dce8b5"}},{"ruleId":"D1","level":"warning","message":{"text":"createCachedLookup (cyclomatic 34): createCachedLookup has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 9 of the 34 points are its own statements and the rest belongs to 8 function items inside it that branch (cachedLookup, a function literal at line 312, a function literal at line 262, \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":"providers/_dns-cache.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5375243cbc358efc1985198b5459445807916953273e5f0a824b2fcc26ef5b"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.checkMainChannel (cyclomatic 33): update-system.checkMainChannel has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"20365628c6d9c3f724bc6e86d54d339fff111584074cf4c04b6f447c0f598dbf"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-view.FieldRow (cyclomatic 33): apply-view.FieldRow has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 3 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":"web/src/components/apply-view.tsx"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d5009b4205f4ba0f2e24269d17b955bf66f1bef4a47fe1c1a67d1f7361f36e"}},{"ruleId":"D1","level":"warning","message":{"text":"job-store.JobsProvider (cyclomatic 33): job-store.JobsProvider has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 2 of the 33 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 178, 147, 219, \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":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d87b964c0fb1ccefb11266c2992be9d4c4e18bcd32545fd83a8e76256d184"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 33): fetch has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4b360abe181413ebeee5d9ff3f0e105c8082a28e59fcd8b49e6415cf9d95a2"}},{"ruleId":"D1","level":"warning","message":{"text":"normalizeProfile (cyclomatic 33): normalizeProfile 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576ebeab43886a1ae1054d0b6065d020852c77236f6c08affff95266f3ffec4"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-ats.auditAts (cyclomatic 32): verify-ats.auditAts has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1bcdb69a7c324233a29e5ae2bd3071f6624a540d9efb573adefaecd74599de"}},{"ruleId":"D1","level":"warning","message":{"text":"section-card.BulletRow (cyclomatic 32): section-card.BulletRow has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 10 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":"web/src/components/cv-studio/section-card.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c63e4d4b4299465cdfef12a72e56eaa5ab971a8e4572cfe656b874b42555fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"session.openSession (cyclomatic 32): session.openSession has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f7648bbb5e175baac64b4431c5053e437b78dcec738b56cb39279938031f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"extract-json-object.extractJsonObject (cyclomatic 32): extract-json-object.extractJsonObject has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/extract-json-object.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7eee534f17c865d5f22781f88ca64f607f9250b9dcda198931214d57c4cb42"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.runScanner (cyclomatic 32): scan.runScanner has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 282, 258, 345, \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":"web/src/lib/core/scan.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffb1ccde8f26ae6cd7c819e25aa83cb8ad178db5e6916c0c39eda427af920ef"}},{"ruleId":"D1","level":"warning","message":{"text":"data.ComputeProgressMetrics (cyclomatic 32): data.ComputeProgressMetrics 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":"dashboard/internal/data/career.go"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7223c804165ff5028b0ec75c9148fe779c8cd5e849345550009f3c1a679812"}},{"ruleId":"D1","level":"warning","message":{"text":"data.CanonicalizeLocation (cyclomatic 32): data.CanonicalizeLocation 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":"dashboard/internal/data/stats.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8931fedf7a2359b2c1ab0500302cf5750bae91aede72ca4428156e06a03550b2"}},{"ruleId":"D1","level":"warning","message":{"text":"extractContacts::add (cyclomatic 32): extractContacts::add 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":"followup-cadence.mjs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d73024c8143e33e7cd3b689f2c403316e806e8906df4db6750d2b5852484d29"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 32): fetch 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":"providers/techinasia.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d50125349558e58b3e7b5668da87f79146198027d0b1daea361bf0f93cc4aa"}},{"ruleId":"D1","level":"warning","message":{"text":"parseCv (cyclomatic 32): parseCv has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 12 of the 32 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 88, addFact, a function literal at line 130, \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":"career-profile.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaecccc5ac0b549ac72ad15aa5ce3909e7bb5ffc3cc77a4d9d211c5ede39c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"archiveJdOnInterview (cyclomatic 32): archiveJdOnInterview 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":"lib/status-hooks.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e5e594d7eec6925cd4562052590d60852bc481ec5efbc31275ba6fc10bda0f"}},{"ruleId":"D1","level":"warning","message":{"text":"browser-extract.readDom (cyclomatic 31): browser-extract.readDom has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 966, 978, 1002, \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":"browser-extract.mjs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31646a6f63bd9bfe0aed9c9b9698d9231e129be4b87890057ccc6f4ff7e2e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"validate-portals.validatePortalsConfig::validateEntryList (cyclomatic 31): validate-portals.validatePortalsConfig::validateEntryList 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 (validate-portals.validatePortalsConfig) 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":"validate-portals.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ae98178885b7def5f61c1fbab0812f6a9e2e865ca14bddffda3b14ddcccb15"}},{"ruleId":"D1","level":"warning","message":{"text":"cmdRun (cyclomatic 31): cmdRun has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to 6 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":"plugins.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f834e8a65948dbd311c6a33ca84a36a09423ff277f3876c000b3e28dd64a3f28"}},{"ruleId":"D1","level":"warning","message":{"text":"roleFuzzyMatch (cyclomatic 31): roleFuzzyMatch has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 belong to 16 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":"role-matcher.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9eabe0e802f254942620f6fe6bf6cfedb6e713df61d739937e2bf2e5d733aa"}},{"ruleId":"D1","level":"warning","message":{"text":"computeStatsMetrics (cyclomatic 31): computeStatsMetrics has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to 10 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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773521781e87bbf659759ee3585246ae415fe1deb30f319024a3c6bbcb65e03"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-payload-schema.validatePayload (cyclomatic 30): cv-payload-schema.validatePayload has cyclomatic complexity 30 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cv-payload-schema.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e0138cffa8638aaa293a300f3d45bd0cff1748781cc753c345ca8136bdc508"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.collectSeenUrls (cyclomatic 30): scan.collectSeenUrls has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"c534ff10b2b4486d7beada9a6c65d83a789f97078fc614f85688bdd04167023d"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.verifyOffers (cyclomatic 30): scan.verifyOffers has cyclomatic complexity 30 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ca8152559aab2e836bb54952325c05b0eb051d78889b39d69f11f99d70437e"}},{"ruleId":"D1","level":"warning","message":{"text":"notion.parsePageChunk (cyclomatic 30): notion.parsePageChunk has cyclomatic complexity 30 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 13 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":"providers/notion.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd439945ec6da6eade53be22dbaaac45fc7e7a132ca004836048b4cc8ce05d"}},{"ruleId":"D1","level":"warning","message":{"text":"successfactors.fetchCsb (cyclomatic 30): successfactors.fetchCsb 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":"providers/successfactors.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcd427a63405dcffc54bf7a2ba9a89afb2185d7a91d941eb72cd52cc9b164e0"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-interamt.main (cyclomatic 30): scan-interamt.main 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":"scan-interamt.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33fc7f4dd2fca8f7c9de71fad530a62321b15e28a8133e829dd107d029e69a9"}},{"ruleId":"D1","level":"warning","message":{"text":"assistant-console.AssistantConsole::send (cyclomatic 30): assistant-console.AssistantConsole::send 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. This shape REPEATS in the file: one other method here (assistant-console.AssistantConsole) 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5a0ab16fcf2e921b8f92cb2d395f77fce47e5f88b54ed8f490579e0478c223"}},{"ruleId":"D1","level":"warning","message":{"text":"discovery-card.DiscoveryCard (cyclomatic 30): discovery-card.DiscoveryCard 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":"web/src/components/explore/discovery-card.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f7567f4bebf3971514444ac3677a9d51984c21f7e073967a97d76a84c14d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"session.fillSession (cyclomatic 30): session.fillSession has cyclomatic complexity 30 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 4 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":"web/src/lib/apply/session.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"95847bd4efb862e82008096ef3f45919e961a7da0a722d3840a0d1afa640b7e9"}},{"ruleId":"D1","level":"warning","message":{"text":"buildSalaryFilter (cyclomatic 30): buildSalaryFilter has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 13 of the 30 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1080, 1061, 1070, \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":"scan.mjs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec82e7bd5cd061cbdb8a4978bbe4527df6335715569ba463a22118007a706f53"}},{"ruleId":"D1","level":"warning","message":{"text":"normalizeTextForATS (cyclomatic 30): normalizeTextForATS has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 14 of the 30 points are its own statements and the rest belongs to 26 function items inside it that branch (a function literal at line 282, a function literal at line 320, sanitizeText, \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":"generate-pdf.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"47abb3557654ada468eb81b809c81392b39769432711b1508df02044317054d8"}},{"ruleId":"D1","level":"warning","message":{"text":"parseMarkdownRows (cyclomatic 30): parseMarkdownRows has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf3cf717a53a295254e9ad464e62209753d5ad274b3e4db4618a73d53f51c5e"}},{"ruleId":"D1","level":"warning","message":{"text":"renderSummary (cyclomatic 30): renderSummary 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":"funnel-velocity.mjs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a24d8de1fcf4df56e812e68998388ac4f2975a32bdf6a6e86a41b407adac6b"}},{"ruleId":"D1","level":"warning","message":{"text":"namedWithNewActivity (cyclomatic 30): namedWithNewActivity has cyclomatic complexity 30 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 9 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a4f663bf7eaee4f6114d1cbe57e1f3b863ddec0e8f66f46a12699aac297e32"}},{"ruleId":"D1","level":"warning","message":{"text":"computePortalStats (cyclomatic 30): computePortalStats has cyclomatic complexity 30 (threshold 15). Of this number, 29 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":"stats.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6effc7262d2dd2e72dc1c9682b4a53525059481748658af42f52e46aa9d430b"}},{"ruleId":"D1","level":"warning","message":{"text":"computeRejectionLatency (cyclomatic 30): computeRejectionLatency has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to 6 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":"rejection-latency.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62d440fe11ca39587d92832769fde2008a766a58c311f8cdda35111d5b3021e"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 30): main 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":"scan-dayforce.mjs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"8347634357f9c8bc082a289d118e51244f842252a6281cb6dbd4d871f1ff4a36"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.onboardingState (cyclomatic 29): doctor.onboardingState 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":"doctor.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3c442c8c4fc342d672f67d8c51783c994baf70a55a8a5a1feda54d894a6b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"i18n-drift.extractHeadings (cyclomatic 29): i18n-drift.extractHeadings 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":"i18n-drift.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b61b773edcae9da17eb6c3797ac7d0e05b2dee9ae870b4eac6b12db4766473"}},{"ruleId":"D1","level":"warning","message":{"text":"data.ParseApplications (cyclomatic 29): data.ParseApplications has cyclomatic complexity 29 (threshold 15). Of this number, 25 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":"dashboard/internal/data/career.go"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f1ae4ad32f03596a74e2d8f692251108690d503eab6ca753948affde6ca752"}},{"ruleId":"D1","level":"warning","message":{"text":"computeResponsiveness (cyclomatic 29): computeResponsiveness 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":"company-history.mjs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9337e9e32f18008d45b1ff6722563bcdb262a72521d5a72096ffc1c2aedce1af"}},{"ruleId":"D1","level":"warning","message":{"text":"scanBoard (cyclomatic 29): scanBoard 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":"scan-dayforce.mjs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d8db250f320cd7f31366a77e934ca174455f69a186f7f4450772da8bdb6515"}},{"ruleId":"D1","level":"warning","message":{"text":"smartrecruiters.parseSmartRecruitersResponse (cyclomatic 28): smartrecruiters.parseSmartRecruitersResponse has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 212). 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":"providers/smartrecruiters.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f09656f2da9f8a015ed5567ec5dedc5d1befef9f0a51b5f787a5df26ade75e0"}},{"ruleId":"D1","level":"warning","message":{"text":"discover-ats.runSelfTest (cyclomatic 28): discover-ats.runSelfTest has cyclomatic complexity 28 (threshold 15). Of this number, 26 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":"discover-ats.mjs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27678b6df62a1e2306b2e653fe421022c49439506e1f0408262e91184395f83"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-match.runSelfTest (cyclomatic 28): keyword-match.runSelfTest has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"7559a3a81b861b3e2c0fe94aac6f9e484bc4db925d745784b1e55483bd02034e"}},{"ruleId":"D1","level":"warning","message":{"text":"api.requestJson (cyclomatic 28): api.requestJson has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 13 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c132e3e6a6c853b83be94b86244d284fa42dce52f9d5635228fd2411f6879954"}},{"ruleId":"D1","level":"warning","message":{"text":"vc-portfolios.parseA16zPayload (cyclomatic 28): vc-portfolios.parseA16zPayload has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f460b1a455f0844a2b21aa97792f41ad4247eb9b5a1a028669f4faa712d278"}},{"ruleId":"D1","level":"warning","message":{"text":"first-score-view.FirstScoreView (cyclomatic 28): first-score-view.FirstScoreView has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 13 belong to 5 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":"web/src/components/explore/first-score-view.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33dca4724b0776306a16ed50a61aea5f7bd48eb42fbf794ac385fe3b3c5d93"}},{"ruleId":"D1","level":"warning","message":{"text":"worker-card.WorkerCard (cyclomatic 28): worker-card.WorkerCard has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/worker-card.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e17b33cb4453608173952d6bd23b19deb3e439f5a919b1a6c41db2d07421675"}},{"ruleId":"D1","level":"warning","message":{"text":"job-card.JobCard (cyclomatic 28): job-card.JobCard has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 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":"web/src/components/scheduled-scans/job-card.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3568c03e9390734e68e3b9545e7050280cece0ef0f60d53bc5a8a4cefa910285"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-interpret.captureCandidates (cyclomatic 28): agent-interpret.captureCandidates has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 28, 54, 29). 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":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"75333c59243004e89c0ade5f74fa26027f10a8d01cd63feafc637c6310e4b1c8"}},{"ruleId":"D1","level":"warning","message":{"text":"personalization-file.mergeSections (cyclomatic 28): personalization-file.mergeSections has cyclomatic complexity 28 (threshold 15). Of this number, 26 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":"web/src/lib/personalization-file.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac166912b7614cd86fb32f683d52fcc0cf3b827ffe24fa37ff67059c838292e7"}},{"ruleId":"D1","level":"warning","message":{"text":"renderMarkdown (cyclomatic 28): renderMarkdown has cyclomatic complexity 28 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 6 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":"github-evidence.mjs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11bd51867d5fdea4ea59acf963aedf91b61c123b4005b019610a9ce4c83a570"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 28): main has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 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":"hired-share.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d700c31b7aab4f39eeb7df171525963b0efbbdf05d7f8ed13f7b2dc06a75e4"}},{"ruleId":"D1","level":"warning","message":{"text":"_registry.validateRegistryEntry (cyclomatic 27): _registry.validateRegistryEntry has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_registry.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0104d2066891c8bd4170073f73507aae43fe5311e745127823c6000bd5f6e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-facts.runCli (cyclomatic 27): verify-cv-facts.runCli 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":"verify-cv-facts.mjs"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"9680e39085b3a5a95ea4ac96b728c3bfe1dcc29a744a4c8612499d12d8416d10"}},{"ruleId":"D1","level":"warning","message":{"text":"jd-years.mentionsIn::consider (cyclomatic 27): jd-years.mentionsIn::consider 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":"jd-years.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7661adda989069b69b9c4b8e2c1499debf9506ff97181ca0e2464b11783ef4d"}},{"ruleId":"D1","level":"warning","message":{"text":"jd-years.parseYearsRequirement (cyclomatic 27): jd-years.parseYearsRequirement has cyclomatic complexity 27 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 8 belong to 7 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":"jd-years.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"70feb2b6a117e9b3436c84892914e5e54c88db8d814ae62e23237922c9ecfe22"}},{"ruleId":"D1","level":"warning","message":{"text":"config-form.ConfigForm (cyclomatic 27): config-form.ConfigForm has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 48, 161, 89, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"421e6aae0be40594d0914c5d5363a918a55d0f016d05be49f36f81192e8241ff"}},{"ruleId":"D1","level":"warning","message":{"text":"callOpenRouter (cyclomatic 27): callOpenRouter 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":"openrouter-runner.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6889a3ef4698877b4884606b22c8a7d58df8c40405c27054285368322055142b"}},{"ruleId":"D1","level":"warning","message":{"text":"archiveUrl (cyclomatic 27): archiveUrl has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to 5 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":"archive-posting.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdcdc81e30689b1703de7b9b4fd11539796adbf98f8d12c2e910e669b39e266"}},{"ruleId":"D1","level":"warning","message":{"text":"classifyRows (cyclomatic 27): classifyRows has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs 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":"close-stale.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"310867b072a081a26c266d765052acab7d3278ed9f1b8314a059c1896c237ce2"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 27): fetch 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":"providers/adp-workforcenow.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd1d496b815105ccd2b262b51829f1b5ec1dd37de653885bcd51d1082eea07b"}},{"ruleId":"D1","level":"warning","message":{"text":"computeProgressMetrics (cyclomatic 27): computeProgressMetrics has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b57e4e81edcd89db1aa20b14d0e31553b68d1903602154e75f59b3a902e99c2"}},{"ruleId":"D1","level":"warning","message":{"text":"add-entry.applyAdd (cyclomatic 26): add-entry.applyAdd 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":"add-entry.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c687b7e61b54285f847e78f68cacc512e37770e89fb988a4df654fd8fbf2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"stats.printSummary (cyclomatic 26): stats.printSummary 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":"stats.mjs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"041cff5a4cebe5a000a3691f4eaab1d06490a62aad74fb4692fa261934b7af7f"}},{"ruleId":"D1","level":"warning","message":{"text":"company-funded.buildCandidates (cyclomatic 26): company-funded.buildCandidates has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 8 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":"company-funded.mjs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"311b603e466bc2c4a9587b426a204ffb285f6ba5140acbb473ac3bcc84254dcc"}},{"ruleId":"D1","level":"warning","message":{"text":"adp-workforcenow.parseListPage (cyclomatic 26): adp-workforcenow.parseListPage 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":"providers/adp-workforcenow.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"085df6c1b1c831d0602b2569f70908f5f048249e5349a38ee30a0a68dd595611"}},{"ruleId":"D1","level":"warning","message":{"text":"techinasia.normalizeTechInAsiaJob (cyclomatic 26): techinasia.normalizeTechInAsiaJob 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":"providers/techinasia.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"38999c93ca1f1d4eb49796a300153d7087730778f44655ba2d86e415c0fb98bb"}},{"ruleId":"D1","level":"warning","message":{"text":"view-model.statsModel (cyclomatic 26): view-model.statsModel has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics/view-model.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f037a9101060ae3c61d2b05d9b4198ea545be5afc01b59007fbec4351892fc6"}},{"ruleId":"D1","level":"warning","message":{"text":"drive-action.executeAction (cyclomatic 26): drive-action.executeAction has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive-action.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb1f139113ef62b0cdcdfd2e0b3272d14a9d911762f7e6bef35a77ce9642110"}},{"ruleId":"D1","level":"warning","message":{"text":"clauseBounds (cyclomatic 26): clauseBounds has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 2 function items inside it that branch (isBoundary, isSentenceEnd). 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":"verify-cv-facts.mjs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"29098dd35edb6c2685c35bbaac34d9e08fa9cb20dd724819dca4c38a3b0345a0"}},{"ruleId":"D1","level":"warning","message":{"text":"renderInPage (cyclomatic 26): renderInPage has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to 5 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":"generate-pdf.mjs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8b72be0f6f7f7379fd8f2568781610970a7cf5fb6f8f3d99bb13a30457c78f"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch::runQuery (cyclomatic 26): fetch::runQuery 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":"providers/workday.mjs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b15f17a736c98f9efafaf37d4f308815009961cab1fe1870623e149746e91e"}},{"ruleId":"D1","level":"warning","message":{"text":"buildRow (cyclomatic 26): buildRow has cyclomatic complexity 26 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 11 belong to 5 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":"assessment-log.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c57bd47dc955e5cd6278d6cdbb1f1a1f9232e90721bcd344b82bf5dfe4d8f2"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 26): fetch 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":"providers/ultipro.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4fa8f5967d9de16e7fc9db912338ccd14acd66c8151c6ccbcba13cf8e44c96"}},{"ruleId":"D1","level":"warning","message":{"text":"cli-flags.validateFlags (cyclomatic 25): cli-flags.validateFlags has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 150, a function literal at line 123, a function literal at line 117, \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":"lib/cli-flags.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a53e32d70568274d86733a0b9a8e55a7ac5a51f39b3a48faa7ad53697be57d"}},{"ruleId":"D1","level":"warning","message":{"text":"funnel-velocity.selfTest (cyclomatic 25): funnel-velocity.selfTest has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 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":"funnel-velocity.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b383abe15dddca3194945bb24ab81e00fbdf10b591ccf4a056a3a7b71451943e"}},{"ruleId":"D1","level":"warning","message":{"text":"contact-extract.appendContact (cyclomatic 25): contact-extract.appendContact has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 155, 171, 166, \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":"contact-extract.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceaba9e655cfe39b8980a21d83bb11fcab8c2dd83cdc3ede2cce1d805085751"}},{"ruleId":"D1","level":"warning","message":{"text":"ashby.formatLocation (cyclomatic 25): ashby.formatLocation 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":"providers/ashby.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ecfc0b95b315e0e3b11615d86440aa9775d6ab01e62cc9965faecf53c0e996"}},{"ruleId":"D1","level":"warning","message":{"text":"recruitee.parseRecruiteeResponse (cyclomatic 25): recruitee.parseRecruiteeResponse 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":"providers/recruitee.mjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9e1372b2720be09d120bae45f64ab6cd0759a1221b68de4442c777f0f7344"}},{"ruleId":"D1","level":"warning","message":{"text":"intake.listSourceFiles (cyclomatic 25): intake.listSourceFiles has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 4 function items inside it that branch (walk, claimRealDirs, a function literal at line 252, \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":"intake.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23f986f4c8d768f1a14c3357f3cff0e27d73721eca1518fa1fc626f44ec1379"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-proposals.readReplyProposals (cyclomatic 25): reply-proposals.readReplyProposals 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":"lib/reply-proposals.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"82299dcdc2de43c698d124afbacb6871b12ebe841b409fa2b4c341f392efd7d8"}},{"ruleId":"D1","level":"warning","message":{"text":"platsbanken.parsePlatsbankenResponse (cyclomatic 25): platsbanken.parsePlatsbankenResponse 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":"providers/platsbanken.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b303518e8ae6f00823329f4cad618cc4f3a02878d9216a6202fb5af91241eca2"}},{"ruleId":"D1","level":"warning","message":{"text":"remotli.normalizeRemotliJob (cyclomatic 25): remotli.normalizeRemotliJob 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":"providers/remotli.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ea1c6a348a28ae0aef1407d8d192a9e7e79783b2e43f209e4ee11321cbe6a9"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 25): route.POST has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3d864ab477cea65a83f0df3b2c931086d1061f712ba899e9ce09b235f405b5"}},{"ruleId":"D1","level":"warning","message":{"text":"assistant-status-confirmation.StatusConfirmationCard (cyclomatic 25): assistant-status-confirmation.StatusConfirmationCard has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-status-confirmation.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3004ff6d9a3c749003731307be2f99427d66d2508378db6fcddacbd8d6b0b472"}},{"ruleId":"D1","level":"warning","message":{"text":"results-list.ResultsList (cyclomatic 25): results-list.ResultsList has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/results-list.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"69faa0b60b89c627099a6b429e05ab894eb80d1fa05e68f339326fef799b25e9"}},{"ruleId":"D1","level":"warning","message":{"text":"portals-view.PortalsView (cyclomatic 25): portals-view.PortalsView has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 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":"web/src/components/portals-view.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6404c3ef8ea7cabb9815cd0c7e3f087e21afbaf1bc324c8392f16a9d515e36d1"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-interpret.interpretFormWithAgent (cyclomatic 25): agent-interpret.interpretFormWithAgent has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 162, 179, 161, \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":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6370b633c075ff2aa5b2fd0476551b569ef1a71068983f646b8b53b419248acc"}},{"ruleId":"D1","level":"warning","message":{"text":"fill-stream.readFillResult (cyclomatic 25): fill-stream.readFillResult has cyclomatic complexity 25 (threshold 15). Of this number, 17 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":"web/src/lib/apply/fill-stream.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"50118c49138096820223491dff811d7abfe22dfaa345e410e7e48601bbf055af"}},{"ruleId":"D1","level":"warning","message":{"text":"data.parseStatusLedger (cyclomatic 25): data.parseStatusLedger has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/funnel_history.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a66327074fffb9b022f2ed14f9c81ff95e7bdd63872dc85cdd14c40f77c252"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerModel.Update (cyclomatic 25): ViewerModel.Update 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":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f053029dbec60ac68fdb7d84b2410fc6e59daaec93780b77e1fcd44ce1d0aedb"}},{"ruleId":"D1","level":"warning","message":{"text":"query (cyclomatic 25): query has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 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":"tracker.mjs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9270dc16d77e4c81cbb1b97e4f1c9629ae440e25f1ed2b1213119f3b547ea"}},{"ruleId":"D1","level":"warning","message":{"text":"liveness-api.checkLivenessViaApi (cyclomatic 24): liveness-api.checkLivenessViaApi 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":"liveness-api.mjs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eb8e03ca54c0cf2273407e79d5ef4cdfae493378602a913cf083d0e3dd331a"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-sync-check.main (cyclomatic 24): cv-sync-check.main 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":"cv-sync-check.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6822eb77ff81d5174651077b4fa424480d09f45c67f56cdb2d4125156a5725fc"}},{"ruleId":"D1","level":"warning","message":{"text":"walk-tree.walkTree::walk (cyclomatic 24): walk-tree.walkTree::walk 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":"lib/walk-tree.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94a0874c2c931b38f67afe043bf4f5559a96af68c20fe0f4193bd43d2b8cee8"}},{"ruleId":"D1","level":"warning","message":{"text":"linkedin-join.renderSummary (cyclomatic 24): linkedin-join.renderSummary has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"345842c4bd529414d9c48a63aaf2046a01bd8bcc2de94fa732fb813e032e9c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"4dayweek.normalize4dwJob (cyclomatic 24): 4dayweek.normalize4dwJob 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":"providers/4dayweek.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0f11ef1f3271f6b8758cb2a64e15d5ed85d98acf04ee7fe93f02ce070721c3"}},{"ruleId":"D1","level":"warning","message":{"text":"prevueaps.parsePrevueapsResponse (cyclomatic 24): prevueaps.parsePrevueapsResponse 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":"providers/prevueaps.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f725339beae4680533851c1a50c3c69606a4a00bf96687f095d0f11136fe68"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.configuredTemplateVariantsFromProfileSource::parseScalar (cyclomatic 24): update-system.configuredTemplateVariantsFromProfileSource::parseScalar 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. This shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource) 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":"update-system.mjs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aee627d5c2067c0f9b655acd6d50461d81276ce2d45437f30b25e5a8745302"}},{"ruleId":"D1","level":"warning","message":{"text":"run-cli-support.parseCodexEvent (cyclomatic 24): run-cli-support.parseCodexEvent 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":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"591a0f6dc0840ad2c386d901a9555f22caaeb87b8ebee281b7f8fd8ed167309c"}},{"ruleId":"D1","level":"warning","message":{"text":"run-cli-support.parseClaudeEvent (cyclomatic 24): run-cli-support.parseClaudeEvent 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":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72b2e7954b5f2b862ca3cffea52c042aa25a26ddd6fd8114e1321c5b188dfcc"}},{"ruleId":"D1","level":"warning","message":{"text":"documents.discoverDocuments (cyclomatic 24): documents.discoverDocuments 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/documents.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4f1b6d73a2b377c4f854ddc6ed43fd07fd9cd687687fd21755f47f71e9cc1b"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluation-options.selectedEvaluationInstructions (cyclomatic 24): evaluation-options.selectedEvaluationInstructions has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-options.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3787a3d3625d4dfe862abcdb6bd32ba3f086f33d678f74528a9b92e77abe863a"}},{"ruleId":"D1","level":"warning","message":{"text":"weekly-digest.runSelfTest (cyclomatic 24): weekly-digest.runSelfTest has cyclomatic complexity 24 (threshold 15). Of this number, 22 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":"weekly-digest.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a771d3ad42da6945f34f6e8feeedcba94ea919ca0992356155bd89a0cb8b3d58"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerModel.styleLine (cyclomatic 24): ViewerModel.styleLine 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":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccae93388245896a38b9d7187d67c7210054d32e8a9be514a7ce0eedfe876f7f"}},{"ruleId":"D1","level":"warning","message":{"text":"computeRelocationAdjustment (cyclomatic 24): computeRelocationAdjustment has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"56482558ac9247115f34bf1cb7585a32ba93e5c2d3089fae6c4b6e49269e1b1b"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzeFromContent (cyclomatic 24): analyzeFromContent has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to 9 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"887b17e250c666d32902e062cfdf3c78983ae4b1dfb46d5cf1fdf60310e2b238"}},{"ruleId":"D1","level":"warning","message":{"text":"writeVcf (cyclomatic 24): writeVcf 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":"contacts.mjs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ac98dc4679b102599ca3746f01487aaf189f9def964ca1c66eea85e92d807d"}},{"ruleId":"D1","level":"warning","message":{"text":"parseEightfoldResponse (cyclomatic 24): parseEightfoldResponse 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":"providers/eightfold.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac82db44d8d0a7a3858945c548b3361bf97e26bf27efaaf2c72bcf1e173bf6e"}},{"ruleId":"D1","level":"warning","message":{"text":"languageVersions (cyclomatic 24): languageVersions has cyclomatic complexity 24 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 7 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/recruitee.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f3c6c00b42b6537472c68e16d9c72af706c47adc028ccd49d072ee658b6039"}},{"ruleId":"D1","level":"warning","message":{"text":"parseCliArgs (cyclomatic 24): parseCliArgs 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":"archive-posting.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7388f72d3d41c55a12e76042b7890771881126bcdc71dad3ecc33c4548e372"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-facts.factClaims (cyclomatic 23): verify-cv-facts.factClaims 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6879cf0bbf1b1ca272393c92d342e05f71c333e8eebde3b3b4865c68a5624ec"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.buildProjects (cyclomatic 23): build-cv-html.buildProjects has cyclomatic complexity 23 (threshold 15). 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 522, 496). 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":"build-cv-html.mjs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90f7a7c9d4827d76a277e17b0f9ddeba0e9af96228d2eed1afeec8cd11f9bb7"}},{"ruleId":"D1","level":"warning","message":{"text":"fingerprint-core.findCrossListings (cyclomatic 23): fingerprint-core.findCrossListings 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":"fingerprint-core.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f471af78bc5cb3675be340774c47b5a6302410aff373192f91b59b5ea2543206"}},{"ruleId":"D1","level":"warning","message":{"text":"company-funded.fetchHnDiscovery (cyclomatic 23): company-funded.fetchHnDiscovery 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":"company-funded.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e159ff8ae5515ff94d73c5dfdb4ae9c98ff07b3a69403c40fba3804b19f27e"}},{"ruleId":"D1","level":"warning","message":{"text":"discover-ats.main (cyclomatic 23): discover-ats.main 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 one function item inside it that branches (updatePortals). 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":"discover-ats.mjs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4702882e2f499c8d9c84d3ed3b13a90561b67e144e7dd03d0d86b7e31ca14ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"reserve-report-num.runCli (cyclomatic 23): reserve-report-num.runCli 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":"reserve-report-num.mjs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3a79d2e50aa6e807c04bf9e0afa22de7d8dca28251e014c78f1e4955f2691f"}},{"ruleId":"D1","level":"warning","message":{"text":"linkedin-join.main (cyclomatic 23): linkedin-join.main 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"7098f242dc2b0136ca6347593a6e1659f67a5b8b3e063213e160a71524a53a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch (cyclomatic 23): merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch 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. This shape REPEATS in the file: one other method here (merge-tracker.mergeTracker::mergeUnderLock) 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":"merge-tracker.mjs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"413ce8bd1e7c4c860977148dd4727dd336a4da34e3ac9cdaf6c30323f81070ec"}},{"ruleId":"D1","level":"warning","message":{"text":"tier.classifyTier (cyclomatic 23): tier.classifyTier 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":"plugins/h1b-sponsor/lib/tier.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e17079d64bd7848d0c262256848f115255be600a0bfc63aab90a2013a25b0d1"}},{"ruleId":"D1","level":"warning","message":{"text":"getonbrd.normalizeGetonbrdJob (cyclomatic 23): getonbrd.normalizeGetonbrdJob 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":"providers/getonbrd.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78a943c98295bb4491e028844f8ea894bd41fe24d902446bfed139b28e1e8db"}},{"ruleId":"D1","level":"warning","message":{"text":"pageup.parsePageupListing (cyclomatic 23): pageup.parsePageupListing 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":"providers/pageup.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc34ebddf4f11cbfd21838883a4e4c6684dab0628b6d2def904116a5298d5eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"paylocity.parsePaylocityBoard (cyclomatic 23): paylocity.parsePaylocityBoard 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":"providers/paylocity.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0cbe5a22ba71a3853406354c3bd57afac00f1977adaee0fcafc09fac43a7b5"}},{"ruleId":"D1","level":"warning","message":{"text":"torre.normalizeTorreOpportunity (cyclomatic 23): torre.normalizeTorreOpportunity has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/torre.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ffe1e4080519426b2b04e0f157a40a80f5fc92a42a8851b7e2edcf9de5f92b"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-hn.main (cyclomatic 23): scan-hn.main 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":"scan-hn.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e15204d78988d6f345b8f2c7988447890a9ea946b178c9a69e68bbdb1aa1f7"}},{"ruleId":"D1","level":"warning","message":{"text":"cadence-settings.CadenceSettings (cyclomatic 23): cadence-settings.CadenceSettings has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (save, toggle, a function literal at line 38, \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":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e7d55aefc941c3c558321dd2648640417521788c5a429c8e8e859fe0c93077"}},{"ruleId":"D1","level":"warning","message":{"text":"personalization.coercePersonalization (cyclomatic 23): personalization.coercePersonalization has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/personalization.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"148a36b9703130cc32da81fb3839b33292c28196e2bf740c9dee754c12a0a951"}},{"ruleId":"D1","level":"warning","message":{"text":"data.runStatusWriter (cyclomatic 23): data.runStatusWriter has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/status_writer.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f865036a35d15a1f71c83b4b4f9aada2b7353df9d49f20c786e14a4532eac09"}},{"ruleId":"D1","level":"warning","message":{"text":"seedFollowup (cyclomatic 23): seedFollowup 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":"followup-seed.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0232d81f59f118f21636ce3aa0efb481f3e87dd0667e38b67f43ef2474e8395b"}},{"ruleId":"D1","level":"warning","message":{"text":"seedBackfill (cyclomatic 23): seedBackfill 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":"followup-seed.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c247bf6f605ec6dbe4f7a5817ee382055c5fd813e6f0da8d38763df21cfa10ff"}},{"ruleId":"D1","level":"warning","message":{"text":"application-answers.main (cyclomatic 22): application-answers.main 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":"application-answers.mjs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3a5a9a5ba281f12d376981d5451279cb69fa2ef5535408ebcf4c7d0065ff35"}},{"ruleId":"D1","level":"warning","message":{"text":"liveness-core.classifyLiveness (cyclomatic 22): liveness-core.classifyLiveness 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":"liveness-core.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8855ff8a238eec4f264983eaff4be428ae4d8e4de05dad1abea29e6a43bbe75e"}},{"ruleId":"D1","level":"warning","message":{"text":"check-jd-archive.checkJdArchive (cyclomatic 22): check-jd-archive.checkJdArchive 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":"check-jd-archive.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe611505c73b3381f5b9ebf241c95d30c3734cf58666b2c51af5102d0e24a744"}},{"ruleId":"D1","level":"warning","message":{"text":"ats-payload.validatePayloadShape (cyclomatic 22): ats-payload.validatePayloadShape has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ats-payload.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c4838c7a1bdf64b0a3f364c846594cd968db2c959798ae12d82099c1549c03"}},{"ruleId":"D1","level":"warning","message":{"text":"_net.isBlockedV4 (cyclomatic 22): _net.isBlockedV4 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_net.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6a4495acd7d674d37ea6eb59f5914f96ea14796103a8aff5d0596b65e85c34"}},{"ruleId":"D1","level":"warning","message":{"text":"ultipro.parseListPage (cyclomatic 22): ultipro.parseListPage 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":"providers/ultipro.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da0e0e6aafb0375d88901fae309d5aa75e799bc1408919e64773457b4a705a5"}},{"ruleId":"D1","level":"warning","message":{"text":"personalization.scanHeadings (cyclomatic 22): personalization.scanHeadings 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":"lib/personalization.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f456eebb300a235de6946daa387aa61faed5a1c519a03005f7641125e3554a"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonc-parse.stripJsoncSyntax (cyclomatic 22): jsonc-parse.stripJsoncSyntax 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":"jsonc-parse.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"001b17a0ebdffa72e35c844b9fa62894ff99eabc6a539ec401feae5e0aeaac8e"}},{"ruleId":"D1","level":"warning","message":{"text":"echojobs.normalizeEchojobsJob (cyclomatic 22): echojobs.normalizeEchojobsJob 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":"providers/echojobs.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c36600b8d2817c54e5651b7bd32b71454bdecc1ee6c39e8a1f951585d2c5ac"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.unsafeManifestPathReason (cyclomatic 22): update-system.unsafeManifestPathReason 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5aafbbf6eb51832fda8c42fe330103b6695d6724cf57e74502f92d7d7ff182"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.revertPaths (cyclomatic 22): update-system.revertPaths 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 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":"update-system.mjs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"640afef7c0593c140d93af451d152f29b8b402de53ee4da5c3d01aa3fb813e42"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-ats.runSelfTest (cyclomatic 22): verify-ats.runSelfTest has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9460b734d0aaa1551df5530883aece45edcf9ced8e22f0603cd8cd08d69e88"}},{"ruleId":"D1","level":"warning","message":{"text":"profile-yaml-edit.trailingComment (cyclomatic 22): profile-yaml-edit.trailingComment 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":"web/src/lib/profile-yaml-edit.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd80b15b44672a84a22f79884e30a96ae1a251d6f1cfdd2d0e64a9bf20a880"}},{"ruleId":"D1","level":"warning","message":{"text":"data.acquireTrackerLock (cyclomatic 22): data.acquireTrackerLock 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":"dashboard/internal/data/tracker_lock.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afb364f65d9074325d79492138b53c74443d4bae23f391118e4d07948094694"}},{"ruleId":"D1","level":"warning","message":{"text":"buildStatusHistory (cyclomatic 22): buildStatusHistory has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c9cc3f33b2a542ec575c8c875c982479ff8215254fc823607632ad938321dc"}},{"ruleId":"D1","level":"warning","message":{"text":"joinConnections (cyclomatic 22): joinConnections has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 572, 567, 523, \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":"linkedin-join.mjs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb9dcc5a3f7c3ee8c3622b5a8f7f9a7cf3bf6365be3e21e370872d11908ab4a"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 22): fetch 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":"providers/builtin.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f3498bd9dc676c371f0fe1fee0916abdc9c9706fd2b211e0bb922bd7ec0750"}},{"ruleId":"D1","level":"warning","message":{"text":"computeCalibration (cyclomatic 22): computeCalibration has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"calibrate.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"03de46d328dc218aa2fc7dd0f0b3a6870a96fee77048c1dacc41cbc5220fe22f"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-patterns.buildPatternSignals (cyclomatic 21): analyze-patterns.buildPatternSignals has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function literals 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":"analyze-patterns.mjs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9933d6daf157ac2012306597ec6f668e982b0ba6d499fe5bab088d69bf157678"}},{"ruleId":"D1","level":"warning","message":{"text":"branded-successfactors.classifyUnknownHostSeeds (cyclomatic 21): branded-successfactors.classifyUnknownHostSeeds has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"branded-successfactors.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24e1871bfef0644101d0118101acbb47ef411a9fb56d2e7e5b72b63d1fc9d28"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.buildLocationFilter (cyclomatic 21): scan.buildLocationFilter has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 622, 630). 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":"scan.mjs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f82bf5adf8ab2e16774bc87f515d184daab033c6774c618624d41fc4df9085"}},{"ruleId":"D1","level":"warning","message":{"text":"funnel-velocity.computeVelocity (cyclomatic 21): funnel-velocity.computeVelocity 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":"funnel-velocity.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3d3369d726c655400bebae89b155fbbe686b22d38dbcb35f6080c2f3306456"}},{"ruleId":"D1","level":"warning","message":{"text":"followup-seed.parseCliArgs (cyclomatic 21): followup-seed.parseCliArgs 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":"followup-seed.mjs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7de75223b739b312c0aaaee4e8925c98e9a00c534b50d95bda145cb0d2bd85"}},{"ruleId":"D1","level":"warning","message":{"text":"detect-reposts.detectReposts (cyclomatic 21): detect-reposts.detectReposts has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 315, 351). 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":"detect-reposts.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1c22f372396ec033f0b9ff814769b6f6f7e908c7aade6f63b249513cfe3df1"}},{"ruleId":"D1","level":"warning","message":{"text":"company-history.runSelfTest (cyclomatic 21): company-history.runSelfTest has cyclomatic complexity 21 (threshold 15). Of this number, 19 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":"company-history.mjs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd8b43803cb7c5a2e5052b36e674b98a2dab069f7ec8a19a29723e78dd553e1"}},{"ruleId":"D1","level":"warning","message":{"text":"recruitee.assembleLocation (cyclomatic 21): recruitee.assembleLocation has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 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":"providers/recruitee.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"443fa7c355f909ba71c8c2d1c72bc7bb4dace48064af6a3ac33e947a56b88a16"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.main (cyclomatic 21): doctor.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":"doctor.mjs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cbc4cf061e0c5d0d7050897d3b85014105eaf8b6e85779ce153e73e8639e09"}},{"ruleId":"D1","level":"warning","message":{"text":"panelist-roles.readIcsText (cyclomatic 21): panelist-roles.readIcsText 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":"panelist-roles.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4979123d5bb07cf538e55a78c0dbe39c284999842d9e49253b7bea824f2cf3f"}},{"ruleId":"D1","level":"warning","message":{"text":"dover.parseDoverPage (cyclomatic 21): dover.parseDoverPage 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":"providers/dover.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb29fcddf096ba381e879a1ecc3f046a5ed0cfde2bac7f8b54e3366b692a47a4"}},{"ruleId":"D1","level":"warning","message":{"text":"landingjobs.normalizeLandingJob (cyclomatic 21): landingjobs.normalizeLandingJob 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":"providers/landingjobs.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be0c3add820c9fd0de24c67ece39d2b2bbb90dc135372818200a3b536d69293"}},{"ruleId":"D1","level":"warning","message":{"text":"peoplesoft.parseFormState (cyclomatic 21): peoplesoft.parseFormState 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":"providers/peoplesoft.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7ce52f0813d91bec9ba690d057408b2b5cde45d8d3b30396d0d3fdffb7a977"}},{"ruleId":"D1","level":"warning","message":{"text":"thehub.normalizeHubJob (cyclomatic 21): thehub.normalizeHubJob 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":"providers/thehub.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261dd948704393b2fde81eca731b7412a1f677fc51587a8253225dde23e30ff"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 21): cli.main 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":"scaffolder/bin/cli.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da2bf8018eb096d372b511e03a3aab00be57eb328d56dadc20d63890c9351aa"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-ats-full.runSeedScan (cyclomatic 21): scan-ats-full.runSeedScan has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 930, 922). 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":"scan-ats-full.mjs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ec205845845eb836c36fa153e19203f0c8b24eb40d36f284df59dfd76adf88"}},{"ruleId":"D1","level":"warning","message":{"text":"sync-batch-input.isPrivateOrInternalHostname (cyclomatic 21): sync-batch-input.isPrivateOrInternalHostname 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":"sync-batch-input.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8417bb19fdac6dbf42855bb8cb99fe722b7ba7547bcbbbbdcd52e3cf3e98d32"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 21): route.POST 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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cfb27f106b70bd3374a9f5419a38378c9f9af77d6063a8af6e58a472c6c44b"}},{"ruleId":"D1","level":"warning","message":{"text":"route.GET (cyclomatic 21): route.GET has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 42, 62). 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":"web/src/app/api/portals/verify/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac15a42e011c4672b39b91f1c8ce3502d862a17e7628bf8fce3d2334e759fc28"}},{"ruleId":"D1","level":"warning","message":{"text":"mobile-nav.MobileNav (cyclomatic 21): mobile-nav.MobileNav has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 56, a function literal at line 166, onTouchMove, \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":"web/src/components/mobile-nav.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9cd0a6747fa83b91041601c15d9db4d862654f5104e2668157a3902bb392b2"}},{"ruleId":"D1","level":"warning","message":{"text":"assistant-chat-store.saveChat (cyclomatic 21): assistant-chat-store.saveChat has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 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":"web/src/lib/assistant-chat-store.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"65899f4a8f26134654426cc3de5a01b56a70c7c535c8b26589fb0eac92238406"}},{"ruleId":"D1","level":"warning","message":{"text":"company-history.factLine (cyclomatic 21): company-history.factLine 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":"web/src/lib/company-history.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca7b830a6705718632344fc36ced37af4ff9d45491610ed5a641a7c7cbc35c1"}},{"ruleId":"D1","level":"warning","message":{"text":"data.loadJobURLs (cyclomatic 21): data.loadJobURLs 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":"dashboard/internal/data/career.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"24758daf9626c85b7a46154fce59a0c264e43c70b34ab3cf67387d1f6d74ed88"}},{"ruleId":"D1","level":"warning","message":{"text":"data.enrichAppURLsByCompany (cyclomatic 21): data.enrichAppURLsByCompany 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":"dashboard/internal/data/career.go"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f07a3e338c91b7f657a72fb4149acbda02184e87c56a2b1aaac8df6d00899c"}},{"ruleId":"D1","level":"warning","message":{"text":"trackerLock.release (cyclomatic 21): trackerLock.release 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":"dashboard/internal/data/tracker_lock.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d9e36e04e09db2020970b598be9abda9e6f5b1d51a5ca401a21c91b448cc24"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerModel.renderAll (cyclomatic 21): ViewerModel.renderAll 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":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b629a06e71d222049745640d87a128a9eccf541edbf00cb9a563e80eeb7b8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeTracker::parseTsvContent (cyclomatic 21): mergeTracker::parseTsvContent 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":"merge-tracker.mjs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dbce63bb9eb3534dbd9121e8e30eb9fd0bb8788fc087c44092e11e9d8077ba"}},{"ruleId":"D1","level":"warning","message":{"text":"computeScanStats (cyclomatic 21): computeScanStats has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"stats.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afa3f1caf16351640b32d6bc5dbd0f7a2675f773f07704ceb0a4c675e23dc54"}},{"ruleId":"D1","level":"warning","message":{"text":"proxyFor (cyclomatic 21): proxyFor has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99129bb9e6b16aee9274a607a0a783e34414d9084513abedbae0aae4f01da6f"}},{"ruleId":"D1","level":"warning","message":{"text":"fetchInContext (cyclomatic 21): fetchInContext 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":"providers/_http.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"392c53ccc9c6a6a50479d1e75c105615103621009eb64d7dd976dcdb2963a65b"}},{"ruleId":"D1","level":"warning","message":{"text":"parseSessionFile (cyclomatic 21): parseSessionFile 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":"weekly-digest.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b4c2c2a68c70d1ab3c0c5c2a76c1ab949645fd399760428b0b4c969b437ded"}},{"ruleId":"D1","level":"warning","message":{"text":"resolveExperienceFilter (cyclomatic 21): resolveExperienceFilter has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae7957221763107155b96c6fe7ebe178e8a897b83995efe7c13414301fdf578"}},{"ruleId":"D1","level":"warning","message":{"text":"assessment-log.printSummary (cyclomatic 20): assessment-log.printSummary 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":"assessment-log.mjs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb26ff4dc16f3869ffcf089e3aca203e809f247467972944c2860f719f1c2513"}},{"ruleId":"D1","level":"warning","message":{"text":"assessment-log.main (cyclomatic 20): assessment-log.main has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec098462efcb98967bd171ca532faeb1ac05d9da392fe4bfe52f24e8d63bbac9"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-templates.loadAtsRules (cyclomatic 20): cv-templates.loadAtsRules 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":"cv-templates.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d0604d7aa5506cd168febfa816849ce2d447e0fcd86a14408d0b3f50e3db6e"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-templates.atsLint (cyclomatic 20): cv-templates.atsLint 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":"cv-templates.mjs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b74e10d4942740e36a61e56d1ab55df4bfd69a87e4634cde0dfadfaa54242a"}},{"ruleId":"D1","level":"warning","message":{"text":"workday.chooseSplitFacet (cyclomatic 20): workday.chooseSplitFacet has cyclomatic complexity 20 (threshold 15). Of this number, 16 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":"providers/workday.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54e91018419a0480cd4b9c302701fba80d9fafe14b5785a95932e96844963ae"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.loadReApplyWindows (cyclomatic 20): scan.loadReApplyWindows 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":"scan.mjs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1060599eb7e2bfbf7017cb90ba9fa13cc856d20bb22357230abdd1742b8e56"}},{"ruleId":"D1","level":"warning","message":{"text":"contacts.printSummary (cyclomatic 20): contacts.printSummary has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":"contacts.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd5cbd795282d9a26296e47dbb71ec6fe1a3f0e6366ac6ef921afd57c17d363"}},{"ruleId":"D1","level":"warning","message":{"text":"hired-wall-build.buildSvg (cyclomatic 20): hired-wall-build.buildSvg has cyclomatic complexity 20 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-wall-build.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67ef44bb2d32abcdd0017108f3d6e1b8e9ea4ae205488a2c3c8df485d1fd5cd"}},{"ruleId":"D1","level":"warning","message":{"text":"keyword-match.parseMatchArgs (cyclomatic 20): keyword-match.parseMatchArgs 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":"keyword-match.mjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d153c5206a35a664d088ff52bd8a61391832e87877c6c4506715b0149b3eafe"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize-statuses.normalizeStatus (cyclomatic 20): normalize-statuses.normalizeStatus 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":"normalize-statuses.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cb3ed87acf7ef088d9b513bbac37394dfa3bbd5130ef76a0d7f7e38af9d0fe"}},{"ruleId":"D1","level":"warning","message":{"text":"precheck-duplicate.findDuplicateCandidates (cyclomatic 20): precheck-duplicate.findDuplicateCandidates has cyclomatic complexity 20 (threshold 15). Of this number, 18 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":"precheck-duplicate.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c205324557abff609ad386acd265ed32fd437109c398f6ad1487712ab629dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"adp-workforcenow.extractSalary (cyclomatic 20): adp-workforcenow.extractSalary 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":"providers/adp-workforcenow.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb023f3de5531631025aa128bc82ae6b4f1648fe5e8ed29c152fabecefaa3229"}},{"ruleId":"D1","level":"warning","message":{"text":"dassault.parseHits (cyclomatic 20): dassault.parseHits 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":"providers/dassault.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc5a4bc770dcb86b8c4ab7583901824a835850a6f2856e8247e4fae5262d20b"}},{"ruleId":"D1","level":"warning","message":{"text":"kalibrr.normalizeKalibrrJob (cyclomatic 20): kalibrr.normalizeKalibrrJob 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":"providers/kalibrr.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c28f1b52df2a168a49563cdf88669460dbe5f1b84fe21d89f265b8428ca1b0"}},{"ruleId":"D1","level":"warning","message":{"text":"mycareersfuture.normalizeJob (cyclomatic 20): mycareersfuture.normalizeJob has cyclomatic complexity 20 (threshold 15). 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/mycareersfuture.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c8d7a88a661e7f0bdc9cb21b1a5eafa4307e69dcd5d455ac140187c83b3727"}},{"ruleId":"D1","level":"warning","message":{"text":"vc-portfolios.parseYCPayload (cyclomatic 20): vc-portfolios.parseYCPayload 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":"seeds/vc-portfolios.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4919d29929e3ad2dbdda77cd9889d8c08e4b8a057931b228d226b88955405fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduled-jobs-store.validateScheduledStore (cyclomatic 20): scheduled-jobs-store.validateScheduledStore 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":"web/src/lib/scheduled-jobs-store.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0aa8198f6dc8f03dee412fff7b6f6fc731ad7688cb0829a8248b5322288802"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduled-jobs-runner.writeJobPortals (cyclomatic 20): scheduled-jobs-runner.writeJobPortals has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cd55a59f86db0b7f04de8f43b3270d0714665aa5491394e1fe8498c7bea5bf"}},{"ruleId":"D1","level":"warning","message":{"text":"route.GET (cyclomatic 20): route.GET 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":"web/src/app/api/cv-pdf/route.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ac5cb521aa3b93ce1c537a80a8807356d15fa67485b62878be8ce5f1b81ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"filter-builder.FilterBuilder (cyclomatic 20): filter-builder.FilterBuilder has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 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":"web/src/components/explore/filter-builder.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d32ed8214bbc19eb7733d23852d9923436c8aa8a546d62f7d19ae77a9eea170"}},{"ruleId":"D1","level":"warning","message":{"text":"route-progress.RouteProgress (cyclomatic 20): route-progress.RouteProgress has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 41, 69, 73). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/route-progress.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac74c5208e282dc073c586dc8dd33d6a229f335f8ac486f3aeb62a785006e99"}},{"ruleId":"D1","level":"warning","message":{"text":"profile-yaml-edit.setSection (cyclomatic 20): profile-yaml-edit.setSection 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":"web/src/lib/profile-yaml-edit.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f47ad35952936fd73eff6b461fe6abd5333c023f00d83a888146db57883510"}},{"ruleId":"D1","level":"warning","message":{"text":"data.deriveSeniority (cyclomatic 20): data.deriveSeniority 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":"dashboard/internal/data/stats.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b4bf70b3705f301cef1b136585ac3e97145ce3370e2adceb73503547bd603c"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.Update (cyclomatic 20): PipelineModel.Update 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3748fdf398f96bea5d11fc9be0542d9a4e5fc41504a2b933fa6ef090807203bc"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshotConfiguredTemplateVariants (cyclomatic 20): snapshotConfiguredTemplateVariants has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9eceb23b5885cf2571b1ce773971aeab277de4270111592d417ee2a21411a6"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 20): main 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":"salary-gap.mjs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"521734fb4448a4b1efc92e2428628671c89c9bbe208f7db20becdba0b5907eb9"}},{"ruleId":"D1","level":"warning","message":{"text":"parseArgs (cyclomatic 20): parseArgs has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 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":"discover-ats.mjs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c161ad839dfe20719d3fbdd69d6ee6bd328f675f4bf1e6043d023fb8bf62e0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"acquireDirLock (cyclomatic 20): acquireDirLock has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fd43d3c81f2d32422cd31a3d43f3de300dd1bdeb1a8b375e9a0fb8bf9281dc"}},{"ruleId":"D1","level":"warning","message":{"text":"acquireDirLock (cyclomatic 20): acquireDirLock has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b63725ff0951c2e6c85b0a11c4b827fe1d189a998d4eb453c855c7f7c3ec12"}},{"ruleId":"D1","level":"warning","message":{"text":"mentionsIn (cyclomatic 20): mentionsIn 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":"jd-years.mjs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4c226507232ead78102587b491905c86fd0c42f67aa2853fc41eb63a69617c"}},{"ruleId":"D1","level":"warning","message":{"text":"addEntry (cyclomatic 20): addEntry 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":"assessment-log.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"617be9cdbb863027fdd57d732a85ea398e28067082c2912645ac04be3d118bde"}},{"ruleId":"D1","level":"warning","message":{"text":"printSummary (cyclomatic 20): printSummary has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca64fdb5909fbfa4bff99e2e1756c7cead2ea5d2bdf4da89a7884a9662d4f97f"}},{"ruleId":"D1","level":"warning","message":{"text":"computeReevalCandidates (cyclomatic 20): computeReevalCandidates has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to 11 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":"reeval-candidates.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b106d9d43e7db635937e29cc9b31b201c1f1956e1b9e2a7c815ca8fbd0e0a0"}},{"ruleId":"D1","level":"warning","message":{"text":"searchInteramt (cyclomatic 20): searchInteramt 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":"scan-interamt.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"312e330a57c4a5b580dfdde367980045f0a878ff47d40a07b59008c8433c7aed"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-patterns.buildPredictedDiscardReasonSignals (cyclomatic 19): analyze-patterns.buildPredictedDiscardReasonSignals has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"819c2a44d943d31f4bd1a00e7866817b00d4c5ec492b35fff2481231e32031f8"}},{"ruleId":"D1","level":"warning","message":{"text":"audit-portals.auditCompanies (cyclomatic 19): audit-portals.auditCompanies has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (worker, a function literal at line 221, a function literal at line 260). 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":"audit-portals.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff439d774ea7a73d12f62fe50e530869a1c32e68267089dab46d706923638335"}},{"ruleId":"D1","level":"warning","message":{"text":"ultipro.extractCandidateOpportunityDetail (cyclomatic 19): ultipro.extractCandidateOpportunityDetail 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":"providers/ultipro.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7fa2e40b44f7ce679998986c50209281c96180dc2bfdb3b380c8ae269b31de"}},{"ruleId":"D1","level":"warning","message":{"text":"history-ats-seeds.atsBoardUrlOf (cyclomatic 19): history-ats-seeds.atsBoardUrlOf 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":"history-ats-seeds.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9998a4e73805a899a6e751fcf5f3c6cd66dbb5d6d999e98c6640c354d3b64b8d"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-pdf.scanNesting (cyclomatic 19): generate-pdf.scanNesting 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":"generate-pdf.mjs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"252b55e3f3b2c83906d0778ae9e7eeaa23c89e298aed5b773a4add679db0b7c3"}},{"ruleId":"D1","level":"warning","message":{"text":"invite-match.buildClarificationDraft (cyclomatic 19): invite-match.buildClarificationDraft 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":"invite-match.mjs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da02f7f2cc806755c557f3072463d52564d19d686cb665e4744e01c122480fe"}},{"ruleId":"D1","level":"warning","message":{"text":"check-table-freshness.runSelfTest (cyclomatic 19): check-table-freshness.runSelfTest has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 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":"check-table-freshness.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba50da892bfb3fc152879cabf92a876ffa8c8deb4b282f4ce336e9916ac7c42e"}},{"ruleId":"D1","level":"warning","message":{"text":"debrief-sync.parseArgs (cyclomatic 19): debrief-sync.parseArgs 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":"debrief-sync.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49d0458b94b125dc1a2351d0f2da97c700b124c737cf47942cec34294945020"}},{"ruleId":"D1","level":"warning","message":{"text":"discover-ats.parseCompanyInput::add (cyclomatic 19): discover-ats.parseCompanyInput::add 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":"discover-ats.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc9e7c3f10ee35790ecc3fe3772b092044f73586486003720ec945abc0b12f0"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-cover-letter.main (cyclomatic 19): generate-cover-letter.main 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":"generate-cover-letter.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d20a656de30a964856ec0351af9a04222c5b9a1d0f9b25ece3c2b125edf4d6"}},{"ruleId":"D1","level":"warning","message":{"text":"github-evidence.runCli (cyclomatic 19): github-evidence.runCli has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb5128229013cdffba2a9b681d0c76064e314a030ffdb4abcd75db192c73de3"}},{"ruleId":"D1","level":"warning","message":{"text":"clearcompany.parseClearCompanyPage (cyclomatic 19): clearcompany.parseClearCompanyPage has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/clearcompany.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7b254a0ba8d0cb5ef513f7423c96cd750e6a9c9e65f640a53d0cad97f96b42"}},{"ruleId":"D1","level":"warning","message":{"text":"garena.parseGarenaResponse (cyclomatic 19): garena.parseGarenaResponse has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/garena.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5736e7a7905a6f7ef77f677f44f1ff8f32a6cf3a013d6207ee73825a6f787706"}},{"ruleId":"D1","level":"warning","message":{"text":"homerun.parseHomerunFeed (cyclomatic 19): homerun.parseHomerunFeed 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":"providers/homerun.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9b17c52ffc780077c23c565dfbdcede778a9b7ac274b0b7ff6f84acb3f1058"}},{"ruleId":"D1","level":"warning","message":{"text":"oraclecloud.parseOracleResponse (cyclomatic 19): oraclecloud.parseOracleResponse 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":"providers/oraclecloud.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c66b476eb3f67a2b85f389af54d0e599556b6edccd982b17ccc788613dec0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"redrover.parseRedRoverResponse (cyclomatic 19): redrover.parseRedRoverResponse 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":"providers/redrover.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"436206f2f7859745ba6cea10cdaa476a209e485917d907e2622a21642ff9e2ed"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-ats-full.main::processJobs (cyclomatic 19): scan-ats-full.main::processJobs 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. This shape REPEATS in the file: one other method here (scan-ats-full.main) 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":"scan-ats-full.mjs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"82200a796285164bdae6924a303afa10c01bc5352526980cbb5c1148cb92301e"}},{"ruleId":"D1","level":"warning","message":{"text":"export-ats-text.loadProfile (cyclomatic 19): export-ats-text.loadProfile 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":"scripts/export-ats-text.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"38035612e5326ec837ea502088faf2233426335c2fd07fed898edbb2701ceb33"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.exportMd (cyclomatic 19): tracker.exportMd has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7821be78ff64f2f030631f8f1f874904268f9b7769b99b8e44ed8865a8a2a536"}},{"ruleId":"D1","level":"warning","message":{"text":"validate-plugin-registry.validateRegistry (cyclomatic 19): validate-plugin-registry.validateRegistry 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":"validate-plugin-registry.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d89009a887c4025fd818f9925359765af6f74a3a359d562418b42f52b1e413a"}},{"ruleId":"D1","level":"warning","message":{"text":"edit-job-modal.EditJobModal (cyclomatic 19): edit-job-modal.EditJobModal has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 31, handleSubmit). 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":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bd4ce70bdc6843cd6dec28cd6afb09db27fd2dbeef658c8421eb2310138f00"}},{"ruleId":"D1","level":"warning","message":{"text":"submit-guard.isSubmitControl (cyclomatic 19): submit-guard.isSubmitControl 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":"web/src/lib/apply/submit-guard.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62b16f26a3407fb9b77c68570a954cf14c89a1e22551d0af78ff11cfb71719f"}},{"ruleId":"D1","level":"warning","message":{"text":"drive.driveSession (cyclomatic 19): drive.driveSession has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d494ef9958c27c02c5ca68c7c240ae54dd9bae56a94dfd54772ea548eadced"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-usage-scan.createUsageScanner.scan (cyclomatic 19): claude-usage-scan.createUsageScanner.scan has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ff0550a686b411d5a0c169d8fac7a9e1dcbb75e4d72f825e73d335f33cb214"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline-sort.sortRows (cyclomatic 19): pipeline-sort.sortRows has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 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":"web/src/lib/core/pipeline-sort.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7747c83328f3c5ea1ea1e3953be6e462a788b625cb4da40406e7180105fc7944"}},{"ruleId":"D1","level":"warning","message":{"text":"portals-config.setListInText (cyclomatic 19): portals-config.setListInText has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/portals-config.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1c7bc195280bc0439a21322514845db78a1eb85c174e44e0ec4d4a24632e67"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.renderPreview (cyclomatic 19): PipelineModel.renderPreview 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"de024f7e10144ed2eb4a8ed8d55d5cb00096963a49d8431dbcccca6a2f14fd47"}},{"ruleId":"D1","level":"warning","message":{"text":"requisitionIdsForDedup (cyclomatic 19): requisitionIdsForDedup 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":"scan.mjs"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"994512fd290bdfa9d100038184ab410f65ca9a6ab1319e1b723118152a759e51"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch::split (cyclomatic 19): fetch::split 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":"providers/workday.mjs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac2e9c904e478f5686069237a7a3cad49b64d609b6bbd73bd1c56596c8e7e85"}},{"ruleId":"D1","level":"warning","message":{"text":"scanJd (cyclomatic 19): scanJd 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":"jd-skill-gap.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b0866946d7c184b4cd9752d076ecfcae2a90a633109ff41b03c3c3eeb71bea"}},{"ruleId":"D1","level":"warning","message":{"text":"fetchTextMeta (cyclomatic 19): fetchTextMeta 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":"company-funded.mjs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"075f47e1ce53b66aa936fee4cac59632235dd8ff6fa375e7bb9b6db7d893e70d"}},{"ruleId":"D1","level":"warning","message":{"text":"parseIcsDate (cyclomatic 19): parseIcsDate 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":"ics-interview.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fca81d775985aeaf081ae0dac6f325db287e5a9b0563e602712888e8111c46e"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 19): fetch 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":"providers/personio.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca498e5a38a87b03f95009bf9eb97dec8053d16f669a5349744b167e86ff63"}},{"ruleId":"D1","level":"warning","message":{"text":"compileLatexFile (cyclomatic 19): compileLatexFile 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":"generate-latex.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"173278e2c89d17c830540109cd11fcc4a7836659fbf3a43adde807ce8a0b5ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"archive-posting.main (cyclomatic 18): archive-posting.main has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the 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":"archive-posting.mjs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d3cfd0ce08ae0c65a813f43e8a2eb21aa239ab29089c5ef5d88d4af56cb796"}},{"ruleId":"D1","level":"warning","message":{"text":"ats-payload.lintPayload (cyclomatic 18): ats-payload.lintPayload has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 414, 410). 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":"ats-payload.mjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bf35c474c1c77247c1c67c9bc59689b49e9cb92478327c22c4a5b8e9966dc7"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.prepareCandidatePhoto (cyclomatic 18): build-cv-html.prepareCandidatePhoto 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":"build-cv-html.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b200d653fd28ec9ff584cb5d68119f8647827621912a27bb1cd9391e3a3250"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.buildExperience (cyclomatic 18): build-cv-html.buildExperience has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 474, 450). 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":"build-cv-html.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9332c9f5345d4e42bb395c70fc67e08c34100cc3b9891142084c319ad40acf0d"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.main (cyclomatic 18): build-cv-html.main 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":"build-cv-html.mjs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c292e02de7d28f711e6b96a3b729f2cdbe41910faf51964c137725b6dbbe46"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-portals.printResults (cyclomatic 18): verify-portals.printResults 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":"verify-portals.mjs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a287a9caf9a6a7b674bc1b38f18dd327f86cf905fce4b19fa54b1f4ed0b979"}},{"ruleId":"D1","level":"warning","message":{"text":"stats.computeAllStats (cyclomatic 18): stats.computeAllStats has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0472362bcd950e8072e028b0e393520fc1220d3704048fe1838877f7d7c3fa"}},{"ruleId":"D1","level":"warning","message":{"text":"followup-cadence.computeUrgency (cyclomatic 18): followup-cadence.computeUrgency 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":"followup-cadence.mjs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22fe2a44dfab112c7cf38c6956bae85d2b5e62d7fdaae32891293bb9055ab6e"}},{"ruleId":"D1","level":"warning","message":{"text":"closing-soon.readDate (cyclomatic 18): closing-soon.readDate 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":"closing-soon.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ea30c13a2ace07d2f1bd2e0218c5edff8b871a8699dd2715c2921bcf96bb88"}},{"ruleId":"D1","level":"warning","message":{"text":"coverage-check.atsFromUrl (cyclomatic 18): coverage-check.atsFromUrl has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd90f3e1d9166dbed7103259b0256e3205816397c28a92af1a6a686b8e12154"}},{"ruleId":"D1","level":"warning","message":{"text":"fix-slugs.appendNote (cyclomatic 18): fix-slugs.appendNote 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":"fix-slugs.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff96a37663d662d179746824bb40e1d901d80c19ca032d8e733e5870c7b91a5e"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-latex.validateLatexContent (cyclomatic 18): generate-latex.validateLatexContent 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":"generate-latex.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d5ea88271d3d870b479a7cd4360ce8f3caf5869dcbf49f9ba155eb53442ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"hired-wall-build.main (cyclomatic 18): hired-wall-build.main 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":"hired-wall-build.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cd9d8e356c0beb1b91d53a80407a506dfe13fab77cfdb4bee7f518e742f039"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-proposals.validate (cyclomatic 18): reply-proposals.validate 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":"lib/reply-proposals.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"51febbd5cfcc0a8e3f0b2b883154cf7ad0e8de4ccd36c3dc2af06796851f8ce2"}},{"ruleId":"D1","level":"warning","message":{"text":"onboard-write.buildPortals (cyclomatic 18): onboard-write.buildPortals 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":"onboard-write.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcbce338a09116446813b073c86d2c6c02e8ca23796383802166422dccfca12"}},{"ruleId":"D1","level":"warning","message":{"text":"patch-latex-content.main (cyclomatic 18): patch-latex-content.main has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 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":"patch-latex-content.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f329b7800e56c04b79849713acfeae5d968be959c55be389c96d917abd32b02"}},{"ruleId":"D1","level":"warning","message":{"text":"check.main (cyclomatic 18): check.main 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":"plugins/h1b-sponsor/check.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"91566f9eceb6066881dc4a6d32e6e637b8dadc1ebee2e3b9da0d4376dcaf4289"}},{"ruleId":"D1","level":"warning","message":{"text":"a16z-speedrun-talent.normalizeSpeedrunJob (cyclomatic 18): a16z-speedrun-talent.normalizeSpeedrunJob 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":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"66667b32a9e857b40389e917069308d47029a6d754fc676c50b281ea794637c6"}},{"ruleId":"D1","level":"warning","message":{"text":"jobicy.parseJobicyResponse (cyclomatic 18): jobicy.parseJobicyResponse has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 53, toEpochMs). 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":"providers/jobicy.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe9d1fb257b396212ce73e834c758c2777fc191083a2396ae35d959016aecac"}},{"ruleId":"D1","level":"warning","message":{"text":"pythonorg.parsePythonOrgFeed (cyclomatic 18): pythonorg.parsePythonOrgFeed 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":"providers/pythonorg.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0cbbdea822d358e251650f0564a23946cce7a141025f6f877c2c45e61c967f"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.worktreeUpdateTarget (cyclomatic 18): update-system.worktreeUpdateTarget 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2995cf6cd2c6efa5e53f6271be0db3a54f4253ca44279ea881cdba92824573c"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.configuredTemplateVariantsFromProfileSource (cyclomatic 18): update-system.configuredTemplateVariantsFromProfileSource 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 shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource::parseScalar) 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":"update-system.mjs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5040fd068b8d75f97d084c2fb3e40bbc8bee3fb6c788475a8526b16e239081"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 18): route.POST has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"303fcb225c4e5e979496f43289451980787303969fac3e266b5c9ce6861086c0"}},{"ruleId":"D1","level":"warning","message":{"text":"page.ApplyPage (cyclomatic 18): page.ApplyPage 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":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a2bda1ce69a09809a82720afba00a491761ab542cb1c53526f1c581b31164e"}},{"ruleId":"D1","level":"warning","message":{"text":"follow-up-card.FollowUpCard (cyclomatic 18): follow-up-card.FollowUpCard has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/follow-up-card.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0083e27282d4abf6db2f7c2c3df63a4f89e570c9fd9edc163f2f27224a260f1"}},{"ruleId":"D1","level":"warning","message":{"text":"analytics-data.normalizeWorkMode (cyclomatic 18): analytics-data.normalizeWorkMode 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":"web/src/lib/analytics-data.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef747355785ba11b5ba06904dd02337489462676321df14a56db87b530b94fa"}},{"ruleId":"D1","level":"warning","message":{"text":"profile-patch.profilePatchError (cyclomatic 18): profile-patch.profilePatchError 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":"web/src/lib/profile-patch.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae6bb7661bb61a17c0fc2b9e6c91e505ac0101340c9e469914624092f037d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"report.issueBody (cyclomatic 18): report.issueBody has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1ec7ab8d6b1433eec210ffa38436219c521984691c6ce5f0dd2b526c22780f"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduled-jobs.parseScheduledJobInput (cyclomatic 18): scheduled-jobs.parseScheduledJobInput 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":"web/src/lib/scheduled-jobs.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca85739b5ad05a0568837bb328fbab03b82cfd99c6b1cd526eeb52c3b2033b8e"}},{"ruleId":"D1","level":"warning","message":{"text":"data.parseMarkdownLinks (cyclomatic 18): data.parseMarkdownLinks 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":"dashboard/internal/data/career.go"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"b151d87439e4c366c34fd03bea419e133a51617d173aa15aee1c2880bfbb43d0"}},{"ruleId":"D1","level":"warning","message":{"text":"StatsModel.renderPieChart (cyclomatic 18): StatsModel.renderPieChart 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":"dashboard/internal/ui/screens/stats.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8548674e5f836af29bf24388b6682df935baa70d38e6272a18a32e00c22fde"}},{"ruleId":"D1","level":"warning","message":{"text":"redirectToMainCheckout (cyclomatic 18): redirectToMainCheckout 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":"update-system.mjs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f104fb480c723cef58f9a06a6be47fd12976417ab1170e323a7ea670a1ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"collectSeenCompanyRoles::add (cyclomatic 18): collectSeenCompanyRoles::add 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":"scan.mjs"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6e5a493bff2a8132b6fc69330d4252e1f5a011c782bb6eb1eae1f9139490c2"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeTracker (cyclomatic 18): mergeTracker 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":"merge-tracker.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2303638aa058cba9e92ad108902acae860d530ec8525b04d498637a618865f"}},{"ruleId":"D1","level":"warning","message":{"text":"headlineText (cyclomatic 18): headlineText has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 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":"generate-pdf.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3755d4e344770db5b3fbed31467125482b7e7b85905ae78ed4781e71e73e5a"}},{"ruleId":"D1","level":"warning","message":{"text":"matchJurisdiction (cyclomatic 18): matchJurisdiction 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":"salary-gap.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efbc1ca5463c78d0beb12742f6dc3b6cceabb60a6a34c2d8fbf66eae1a34bff"}},{"ruleId":"D1","level":"warning","message":{"text":"runHistorySeedScan (cyclomatic 18): runHistorySeedScan has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 10 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":"scan-ats-full.mjs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f6bb9a624bc6b14523539c863e7c7a6516722aa3e2783618c545a9662ab0b7"}},{"ruleId":"D1","level":"warning","message":{"text":"mapTrackerCaptureLinks (cyclomatic 18): mapTrackerCaptureLinks has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a607e70cb36a1af965c4147fdfc207437d7b03f632a5ff6ae53047600d67f8"}},{"ruleId":"D1","level":"warning","message":{"text":"findUnarchivedApplications (cyclomatic 18): findUnarchivedApplications 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":"check-jd-archive.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0c05677ecec597f54facd911f7e182bb304840236c89821b914795a25b3d19"}},{"ruleId":"D1","level":"warning","message":{"text":"syncIndex (cyclomatic 18): syncIndex 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":"tracker.mjs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bacd1c9de755f60d5b1321e09e91933cbab1faea2f582367275e25942dfc9f"}},{"ruleId":"D1","level":"warning","message":{"text":"renderTable (cyclomatic 18): renderTable has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eae2e2f1aac0d4ecfcb4be9ff4ae68a3677807f56ba5dfee7ab25b17ea1fc0a"}},{"ruleId":"D1","level":"warning","message":{"text":"attemptDirLock (cyclomatic 18): attemptDirLock 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":"lib/dir-lock.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c90574eca240819451d23651dbc583d4721480216c99389734c270135fa2268"}},{"ruleId":"D1","level":"warning","message":{"text":"attemptDirLock (cyclomatic 18): attemptDirLock 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":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b69614a3d03cb3ca2876ef5c8331493c899ab361b95896092ede547a930d173"}},{"ruleId":"D1","level":"warning","message":{"text":"aggregateGaps (cyclomatic 18): aggregateGaps has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 8 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":"upskill.mjs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d01434f78a5584f0ffd40ebab3c93e322f7dcc91ad0b9d4de04111451ccea15"}},{"ruleId":"D1","level":"warning","message":{"text":"computeTrackerStats (cyclomatic 18): computeTrackerStats 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":"stats.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"df34439287dcf4a3366715e908c0b40ab59c18294b5b1c0d769a46f1b0af12a1"}},{"ruleId":"D1","level":"warning","message":{"text":"extractKeywords (cyclomatic 18): extractKeywords has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebca83b37f3a7262bc68809922a9079ee8ee20fe28b79fd2e890e870291ecc09"}},{"ruleId":"D1","level":"warning","message":{"text":"checkFreshness (cyclomatic 18): checkFreshness 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":"check-table-freshness.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"884a5954ae780f57a596054d06603d1f98947d5505ddcad9bd4a2a987d6e35b5"}},{"ruleId":"D1","level":"warning","message":{"text":"htmlToText (cyclomatic 18): htmlToText has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"closing-soon.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c61aa345148cfe1bad63b8f3d1f6e214b7755ee139394872bcf183920360ba"}},{"ruleId":"D1","level":"warning","message":{"text":"validateTable (cyclomatic 18): validateTable has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 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":"panelist-roles.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc82b8c26aba69f3bc1d3aba3bfbf00c82b9eca7c010fc16c25c193dca1246"}},{"ruleId":"D1","level":"warning","message":{"text":"hiredRows (cyclomatic 18): hiredRows 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":"hired-share.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e2a044e5ebbb9482d8db7ef43a8f9b1bd3e7a74b1967ca7269b4878d83e4b3"}},{"ruleId":"D1","level":"warning","message":{"text":"dir-lock.createRelease (cyclomatic 17): dir-lock.createRelease has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 897). 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":"lib/dir-lock.mjs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb30a01d4441b21249daf39cc39f73b21889feba53dc3f3f9d72d7e78fc2d964"}},{"ruleId":"D1","level":"warning","message":{"text":"add-entry.main (cyclomatic 17): add-entry.main 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":"add-entry.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a43c620bc7027078d4fe33ccbad5f1376053bd0609f7d5c151f8cbb62d26382"}},{"ruleId":"D1","level":"warning","message":{"text":"assessment-log.selfTest (cyclomatic 17): assessment-log.selfTest has cyclomatic complexity 17 (threshold 15). Of this number, 15 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":"assessment-log.mjs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"84619f261ce63e241d6532ec07434d586c39b3ba178b1782265bfe36fee06f84"}},{"ruleId":"D1","level":"warning","message":{"text":"jd-rescue.fromLdJson (cyclomatic 17): jd-rescue.fromLdJson 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":"batch/jd-rescue.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d4c347daacf5d4ea21fd8c177ebdef2cdb4e6cc699f09532e61c72c88a2670"}},{"ruleId":"D1","level":"warning","message":{"text":"jd-rescue.main (cyclomatic 17): jd-rescue.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":"batch/jd-rescue.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1f7f31046a3fdb2578980237887d1340517584c1307ebd110dc01ab65a6308"}},{"ruleId":"D1","level":"warning","message":{"text":"calibrate.loadLedgerReached (cyclomatic 17): calibrate.loadLedgerReached has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"calibrate.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"879138de0a8d4e9b980c4700f855494b5187fd4fceb0f1c6de78f647adf8f3ec"}},{"ruleId":"D1","level":"warning","message":{"text":"listing-fingerprint.validateListingFingerprint (cyclomatic 17): listing-fingerprint.validateListingFingerprint has cyclomatic complexity 17 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listing-fingerprint.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7f775b622cc5ee016e2ef7bdf71924458803831428c46d4f6f41714924a30"}},{"ruleId":"D1","level":"warning","message":{"text":"classify-tier.classifyTier (cyclomatic 17): classify-tier.classifyTier 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":"classify-tier.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1e72e2dd512e23bebe8b7247ed0cef5f88cbc57b7b8199406be1e70832fe30"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.buildContentFilter (cyclomatic 17): scan.buildContentFilter has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 854, 864). 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":"scan.mjs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"7768c615d8253614c1868974e0e5ed86d77553563de3ab9f092141a2b8b4346d"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.buildCooldownFilter (cyclomatic 17): scan.buildCooldownFilter has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1344, 1375, 1373). 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":"scan.mjs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53a61ed9f78949c781df00c7b935820755dcf849493b6c57c199adab4bc2861"}},{"ruleId":"D1","level":"warning","message":{"text":"company-history.loadStatusLogSource (cyclomatic 17): company-history.loadStatusLogSource 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":"company-history.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a199a20d2bd5ce62e747e38db9db1c65031d1c45b671f244b073473fb83dcb8"}},{"ruleId":"D1","level":"warning","message":{"text":"contacts.selfTest (cyclomatic 17): contacts.selfTest has cyclomatic complexity 17 (threshold 15). Of this number, 14 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":"contacts.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"593836d9cdd5624821849406334d2232959d6d5fa710754d73693bd15ecc5463"}},{"ruleId":"D1","level":"warning","message":{"text":"coverage-check.main (cyclomatic 17): coverage-check.main has cyclomatic complexity 17 (threshold 15). Of this number, 15 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":"coverage-check.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4878fa358a24897dc2fb40da8d0b2380344ed2e5b81876a8d15a7201eb0d9f"}},{"ruleId":"D1","level":"warning","message":{"text":"breezy.parseBreezyResponse (cyclomatic 17): breezy.parseBreezyResponse 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":"providers/breezy.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c61ba51470e0bdc71912c0773f66fc4e3bdf55c72c52edf381ceb4ab372a55"}},{"ruleId":"D1","level":"warning","message":{"text":"rippling.parseRipplingPage (cyclomatic 17): rippling.parseRipplingPage has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 133, 154). 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":"providers/rippling.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"147e924c3ebcc05bba9dc19ef70248505c0682f9d0367467fe67ee8d17fd1730"}},{"ruleId":"D1","level":"warning","message":{"text":"filter-audit.audit (cyclomatic 17): filter-audit.audit has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 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":"filter-audit.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f046e2cfaf1cd40aa11e362f56695fbb0e0343ebf4999dfef9fcdbb0afff039d"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-cover-letter.buildRecipientBlock (cyclomatic 17): generate-cover-letter.buildRecipientBlock has cyclomatic complexity 17 (threshold 15). Of this number, 11 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":"generate-cover-letter.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ea691304ce550e34b099b0ad793c090026fb1ae19b8802833dacd34f1642d0"}},{"ruleId":"D1","level":"warning","message":{"text":"i18n-drift.main (cyclomatic 17): i18n-drift.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":"i18n-drift.mjs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f763e30622e16e8bd3217c74ce6940685df7ba3ea2a2b755f14d177af9f0fef"}},{"ruleId":"D1","level":"warning","message":{"text":"intake.main (cyclomatic 17): intake.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":"intake.mjs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc7e336927c397f9d3b6e47c2277b9428b4051aeca24f3dc49db73a1be9ab6a"}},{"ruleId":"D1","level":"warning","message":{"text":"learn.apply (cyclomatic 17): learn.apply 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":"learn.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6604fa4e2d3469c4af9b0d2488981b8fe189aaf6b6dc3138492834d7d73dc8"}},{"ruleId":"D1","level":"warning","message":{"text":"install-h1b-index.installIndex (cyclomatic 17): install-h1b-index.installIndex 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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cd3ee8c3f0bae9bc59c0a610b49093e046600738d39377050f6b95f8179aad"}},{"ruleId":"D1","level":"warning","message":{"text":"applitrack.parseApplitrackOutput (cyclomatic 17): applitrack.parseApplitrackOutput has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applitrack.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"145f3ba2b8003525713db37b9b3bbf5641b652782bd5f9265b9cb23ba5c78d29"}},{"ruleId":"D1","level":"warning","message":{"text":"arbeitnow.normalizeArbeitnowJob (cyclomatic 17): arbeitnow.normalizeArbeitnowJob 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":"providers/arbeitnow.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f75a435f0d5ff805332ce1e38e0be52cfb4b99926ac3bca7e3fff40ea7ce32"}},{"ruleId":"D1","level":"warning","message":{"text":"beesite.parseSearchResult (cyclomatic 17): beesite.parseSearchResult 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":"providers/beesite.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfa2540be96c34f45d49b67af10f2896220011f082631bfc6fe3b728dd1e2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"comeet.parseComeetResponse (cyclomatic 17): comeet.parseComeetResponse has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 118, 152). 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":"providers/comeet.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f5cb7dca71b93be014d7c0a5889b8a0cbe0357bf6f57580bc2e3272b2a4138"}},{"ruleId":"D1","level":"warning","message":{"text":"flowxtra.normalizeFlowxtraJob (cyclomatic 17): flowxtra.normalizeFlowxtraJob 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":"providers/flowxtra.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae608d8d2074f01fdacba84a2df01f76e9f96804c11c907762269f2c621c25d"}},{"ruleId":"D1","level":"warning","message":{"text":"generalist-world.stripNonRendered (cyclomatic 17): generalist-world.stripNonRendered 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":"providers/generalist-world.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc53d33456fec4b375aa0dc15ffc70a2443da9f6f51c739c6bd434c5327f4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"jobstreet.parseJobstreetItem (cyclomatic 17): jobstreet.parseJobstreetItem 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":"providers/jobstreet.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e621f7c34831398838aff3079da12134832faf2f6d9365a77bc49a8f596d4cd"}},{"ruleId":"D1","level":"warning","message":{"text":"neogov.parseNeogovPage (cyclomatic 17): neogov.parseNeogovPage 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":"providers/neogov.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e7a95f5fe3255bfcfce3d3d5b3cd947eb1e19b716629db00ad496a27b79634"}},{"ruleId":"D1","level":"warning","message":{"text":"oraclecloud.resolveSite (cyclomatic 17): oraclecloud.resolveSite 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":"providers/oraclecloud.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"243f9b9cfed90cfa3e87e6762aee8bf6ef4bac92f151ff5e86f028461ee39df1"}},{"ruleId":"D1","level":"warning","message":{"text":"taleo.parseTaleoResponse (cyclomatic 17): taleo.parseTaleoResponse 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":"providers/taleo.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b7ba5247f3c76ac7710df271072ff0d22fdc4de7cba2dc64a7b74ac3e1957e"}},{"ruleId":"D1","level":"warning","message":{"text":"telegram-channel.classifyLink (cyclomatic 17): telegram-channel.classifyLink 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":"providers/telegram-channel.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd561acac955e65ba49db6781a67bb1abd4fdecad3142e0f96d9fa2496edab5"}},{"ruleId":"D1","level":"warning","message":{"text":"telegram-channel.parseChannelPage (cyclomatic 17): telegram-channel.parseChannelPage 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":"providers/telegram-channel.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e0dd0c0f165cfaf252b3bebe76e5def20aa80c3ebd0dcbbda3d966a0b0b87c"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker-sync-check.runSelfTest (cyclomatic 17): tracker-sync-check.runSelfTest has cyclomatic complexity 17 (threshold 15). Of this number, 15 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":"tracker-sync-check.mjs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6b310ad8fc577a4382b1f79b879665df3434e444780fff2c6ebf370580445f"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.rejectUserLayerPaths (cyclomatic 17): update-system.rejectUserLayerPaths has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"486605e5b213ea815897a24df7e919c3208a93d429de3dc9360b0963ee061be7"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.loadConfiguredTemplateVariants (cyclomatic 17): update-system.loadConfiguredTemplateVariants 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":"update-system.mjs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a900d6f4b911252120f9de95dc5ea77574342886be5147995faef4ab4fd5582"}},{"ruleId":"D1","level":"warning","message":{"text":"validate-portals.validateParser (cyclomatic 17): validate-portals.validateParser has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc0fe21d768d3fe0a46f6eeb0c508e8026230b9c694294f9f68a2149b1ad00"}},{"ruleId":"D1","level":"warning","message":{"text":"dir-lock.createRelease (cyclomatic 17): dir-lock.createRelease has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 897). 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":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"8054a2be7a09fa802d2ca3bc287ceb7679c149745555418232226b78ee9ccd45"}},{"ruleId":"D1","level":"warning","message":{"text":"beta-banner.BetaBanner (cyclomatic 17): beta-banner.BetaBanner has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 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":"web/src/components/beta/beta-banner.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5968c3a96231ce2203e9a3a11b67d2d85019118c4b72dacd4c5ca5188b972ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-studio.Studio (cyclomatic 17): cv-studio.Studio has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 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":"web/src/components/cv-studio/cv-studio.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"799cd6397325ae3112720568b0c96d3b436a10793981813a6c59bf353e2e76a5"}},{"ruleId":"D1","level":"warning","message":{"text":"decision-card.DecisionCard (cyclomatic 17): decision-card.DecisionCard has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/decision-card.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07c59d0e2d2cfa723644abddabb303adb89aa0f7ec9ba481ac693d4443d53da"}},{"ruleId":"D1","level":"warning","message":{"text":"run-history-drawer.RunHistoryDrawer (cyclomatic 17): run-history-drawer.RunHistoryDrawer has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). 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":"web/src/components/scheduled-scans/run-history-drawer.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3b57220df6ace0f4a65a0331c892b8cf0172f8c4f4235711ad31818bda8bb8"}},{"ruleId":"D1","level":"warning","message":{"text":"drive.snapshot (cyclomatic 17): drive.snapshot has cyclomatic complexity 17 (threshold 15). Of this number, 13 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":"web/src/lib/apply/drive.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d568afffc68fff04115d8054b2a4bb1e86b161a4293508eea060c20e9ab7767"}},{"ruleId":"D1","level":"warning","message":{"text":"career-ops.readLanguageConfig (cyclomatic 17): career-ops.readLanguageConfig has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea1d89f88a6a5d648c4b20f2b0b274ef9077a4a56bfd166cab4d75a0ebe32d"}},{"ruleId":"D1","level":"warning","message":{"text":"states.readCanonicalStates (cyclomatic 17): states.readCanonicalStates 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":"web/src/lib/core/states.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5b926dee80d297320b1dd07ffb5322b9d11b916dce154ed36a865fdd92c3e4"}},{"ruleId":"D1","level":"warning","message":{"text":"studio.parseEdits (cyclomatic 17): studio.parseEdits has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 147, record, strings, \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":"web/src/lib/cv-studio/studio.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"279ce1ec5a743244058d20432621c74a6f18de78afd45b8965995aeba4ac8e50"}},{"ruleId":"D1","level":"warning","message":{"text":"studio.studioReducer (cyclomatic 17): studio.studioReducer 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":"web/src/lib/cv-studio/studio.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e928e584b95d655adb5f82bd9dadb9016a798e489cdd56b0bb7ca0aeb6dbb9f2"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.handleDiscardPicker (cyclomatic 17): PipelineModel.handleDiscardPicker 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400f0644c1ce0c0d0a3b1bc03a1b67ebdd019b4f32d02ccf9d654c2911f021d"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.renderAppLine (cyclomatic 17): PipelineModel.renderAppLine 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ecaa52b2f7619392c7febe93750aecfe7e57dd92016828126ac923b04e9b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"parseArgs (cyclomatic 17): parseArgs has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ec967cb8188f11ea309f5e672f4df91513d311b0ac8060fffc3cb73a2ff29b"}},{"ruleId":"D1","level":"warning","message":{"text":"buildRoleFamilyInterviewRate (cyclomatic 17): buildRoleFamilyInterviewRate has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"014db3151bd454da767d60a960343fa2858a64cf12144b122eeb3f9209d8d249"}},{"ruleId":"D1","level":"warning","message":{"text":"createRelease::release (cyclomatic 17): createRelease::release 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":"lib/dir-lock.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c67e4276eba22115441328e494881c14e1cf23697df7c851592ed8b7861f87a"}},{"ruleId":"D1","level":"warning","message":{"text":"createRelease::release (cyclomatic 17): createRelease::release 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":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"510ce2a979b07366ee552cc6f41e3a7cd7106f9cdb133cb1852d354a46e112df"}},{"ruleId":"D1","level":"warning","message":{"text":"loadFreeModels (cyclomatic 17): loadFreeModels has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 153, a function literal at line 138, priorityOf, \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":"openrouter-runner.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8815af5cb36b0394839e1eaf7d3deb278eb420aa23b9062d2d2d0c1f3824dc65"}},{"ruleId":"D1","level":"warning","message":{"text":"cmdEvaluate (cyclomatic 17): cmdEvaluate 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":"openrouter-runner.mjs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4cd43dd077ef4417ac5d28c7c976a22dc10d9c220ef7af41adacd3feca1581"}},{"ruleId":"D1","level":"warning","message":{"text":"isPrivateIpv4 (cyclomatic 17): isPrivateIpv4 has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6213afbee3cc19d58459fd9af58f4247439a066ac4496ac63bec30382aa99c81"}},{"ruleId":"D1","level":"warning","message":{"text":"computeClosingSoon (cyclomatic 17): computeClosingSoon has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 6 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":"closing-soon.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d737a2656c446254d102bb5b7d2945d291403719e537d0d44e78a04a20083a6"}},{"ruleId":"D1","level":"warning","message":{"text":"readBoundedText (cyclomatic 17): readBoundedText 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc726d092487026263dc1c741a684dfa5f0258eb3e5dfdfef75cac1da355b48"}},{"ruleId":"D1","level":"warning","message":{"text":"liveness-browser.installLivenessRouteGuard (cyclomatic 16): liveness-browser.installLivenessRouteGuard 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 352). 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":"liveness-browser.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fe7084620a8a18f67a7705a569db2e038f9b87fb83dbed0939645d6e76eb15"}},{"ruleId":"D1","level":"warning","message":{"text":"audit-portals.findUnclaimedEntries (cyclomatic 16): audit-portals.findUnclaimedEntries 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":"audit-portals.mjs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bca8740565d86424a5a8a0db56f4febc3ba6e23bf9580961f9652885b2aca1c"}},{"ruleId":"D1","level":"warning","message":{"text":"vdab.normalizeJob (cyclomatic 16): vdab.normalizeJob 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":"providers/vdab.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfdd504f1dab92d14e2ea2b392ff34f7f560d9279146be5dc9ac520559ef239"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.buildEducation (cyclomatic 16): build-cv-html.buildEducation 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 2 function literals inside it that branch (lines 585, 565). 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":"build-cv-html.mjs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca16a6bd5f45beae523f12631bbcfed8138f6b12e758ece741c2ecefb746b59b"}},{"ruleId":"D1","level":"warning","message":{"text":"career-profile.validateProfile::checkFact (cyclomatic 16): career-profile.validateProfile::checkFact 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":"lib/career-profile.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecab265eab70a8ce811e5782e9c717f9ed7f07f3e46adc074fcb752b3e838eeb"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-portals.verifyOne (cyclomatic 16): verify-portals.verifyOne 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":"verify-portals.mjs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62632bc892211fdd187e844d5ab62ffac254da07769369a545a4d0efbc81d53"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-portals.main (cyclomatic 16): verify-portals.main 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":"verify-portals.mjs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a89537203ec0215577836980bab03428c14f29df2ad357cd2421db468ffd02c"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.main::resolveEntries (cyclomatic 16): scan.main::resolveEntries 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":"scan.mjs"},"region":{"startLine":4222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9097d13efa1cd05d60629b73b8385786d280ada9aee6d20bb6bc30ee3ceaa852"}},{"ruleId":"D1","level":"warning","message":{"text":"check-table-freshness.extractRows (cyclomatic 16): check-table-freshness.extractRows has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"55674112f4d8457ae2bc0c290b641b6667b587c5e4a1a1238d85639dba3ea329"}},{"ruleId":"D1","level":"warning","message":{"text":"clean-markers.processFile (cyclomatic 16): clean-markers.processFile 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":"clean-markers.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"507f54680ab8c975fef77efde59db11eabb986374e33304e1f19c07e05890748"}},{"ruleId":"D1","level":"warning","message":{"text":"process-quality.aggregateProcessQuality (cyclomatic 16): process-quality.aggregateProcessQuality has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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":"process-quality.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbe044c260777d3b33d31b79216440b53d4eb2056f78a9a6361d3318f8c7855"}},{"ruleId":"D1","level":"warning","message":{"text":"funnel-velocity.parseStatusLog (cyclomatic 16): funnel-velocity.parseStatusLog 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":"funnel-velocity.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e280de98032882ab99f23a3d8a1a410c51354a5b74adb110e490cf2a8cf0ca5d"}},{"ruleId":"D1","level":"warning","message":{"text":"contacts.parseContacts (cyclomatic 16): contacts.parseContacts 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":"contacts.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7433b3db538525fe16b57096aa833a436bebe5d82f3a5cfbbbfc7e8b429f9502"}},{"ruleId":"D1","level":"warning","message":{"text":"debrief-sync.applyDebriefSync (cyclomatic 16): debrief-sync.applyDebriefSync 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":"debrief-sync.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d95ec4b73898e067ccb887c6834f30de0581f5ad16348264075e66a59ef82"}},{"ruleId":"D1","level":"warning","message":{"text":"workable.parseWorkableWidget (cyclomatic 16): workable.parseWorkableWidget 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":"providers/workable.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"762c67789004044286dc8375403f2ba29c8d6d013a0e22234837f4889dbb308a"}},{"ruleId":"D1","level":"warning","message":{"text":"pinpoint.parsePinpointResponse (cyclomatic 16): pinpoint.parsePinpointResponse has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 128). 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":"providers/pinpoint.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b35370377eb7d11eb5e135da53323f410491606949e16fa9d7b37f2cab78853"}},{"ruleId":"D1","level":"warning","message":{"text":"discover-ats.dedupeAgainstPortals (cyclomatic 16): discover-ats.dedupeAgainstPortals 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":"discover-ats.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"260e932cfb2a1b165ffd266afeae3a4296a98b1665ce438d5aecc031792794fd"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.unpersonalizedFiles (cyclomatic 16): doctor.unpersonalizedFiles 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":"doctor.mjs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4048d61097da9ca22d29ce602bd62883ddbabd90edb8af3f4556c80f55b87f"}},{"ruleId":"D1","level":"warning","message":{"text":"github-evidence.searchAuthoredCommits (cyclomatic 16): github-evidence.searchAuthoredCommits 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":"github-evidence.mjs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"060614aa3deff06c35c39cc06be2db8ca122cb9f8d42ef374e0fceb63b9c31f5"}},{"ruleId":"D1","level":"warning","message":{"text":"github-evidence.countAuthoredCommits (cyclomatic 16): github-evidence.countAuthoredCommits has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bd3c89febbd8a17cf355de59086dc04107bdabe624093111366f6759b53136"}},{"ruleId":"D1","level":"warning","message":{"text":"i18n-drift.compareStructure (cyclomatic 16): i18n-drift.compareStructure 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":"i18n-drift.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60e41da59f2e12c3a33527ed9566ccddb896f2c69f63d6217818f5efe026a83"}},{"ruleId":"D1","level":"warning","message":{"text":"learn.blockReason (cyclomatic 16): learn.blockReason 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":"learn.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"20019cdedc476570f174096cc99c4d28822a65720cfba9fa0ed49fdacd859153"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-audit.auditPlugin (cyclomatic 16): plugin-audit.auditPlugin 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":"plugin-audit.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd320e4bc0e3de3ae54353202ac47c06d2ab5f30a14d27c19ee2baf06d787bb"}},{"ruleId":"D1","level":"warning","message":{"text":"token.mintToken (cyclomatic 16): token.mintToken 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":"plugins/h1b-sponsor/token.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e8d0b5999489454b2d4450ccb0c2c69ee73707899b8fa65cb0e74cf3b2fc24"}},{"ruleId":"D1","level":"warning","message":{"text":"careerviet.parseListingPage (cyclomatic 16): careerviet.parseListingPage 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":"providers/careerviet.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1153d41735bfada175d7c133a04f6367b402d8518a7e7e479d92817ddd766be"}},{"ruleId":"D1","level":"warning","message":{"text":"hiringroom.parseJsonLdJobs (cyclomatic 16): hiringroom.parseJsonLdJobs 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":"providers/hiringroom.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"393d18e6fb0232e38f3a0568daab34436e3defef604eb0613690884820213515"}},{"ruleId":"D1","level":"warning","message":{"text":"jazzhr.parseJazzHRList (cyclomatic 16): jazzhr.parseJazzHRList has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jazzhr.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf4a002f6cff460cedbf4e03da03df5612a1d518565c8b8783fabb0e4c36588"}},{"ruleId":"D1","level":"warning","message":{"text":"jibeapply.parseJibeapplyResponse (cyclomatic 16): jibeapply.parseJibeapplyResponse has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 64). 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":"providers/jibeapply.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"946a2967ea22294a44df6b3408157244bda97bf89ac18d61a36d6d570c15b2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"magneto.parseCards (cyclomatic 16): magneto.parseCards 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":"providers/magneto.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcce1684521efd27232bd1d8774bd0798579410edb49149ab7d7802bb4bcb33"}},{"ruleId":"D1","level":"warning","message":{"text":"origin-guard.checkRequest (cyclomatic 16): origin-guard.checkRequest 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":"web/src/lib/origin-guard.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948e8fb670b73c84c814ff60f614fca624d1c7dd41dd872939793be7cfdfa8c"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.parseTracker (cyclomatic 16): tracker.parseTracker 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":"tracker.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa71a5d69de4170932a4214405e22b123a7bc2c89df1eb30e1f9ca774bc1855"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.historyId (cyclomatic 16): tracker.historyId 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":"tracker.mjs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"330af16322e1e0e277c45a2f47c60d393b5e4be557402e33a4e9d4a32df1c26f"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.reconcileGitignore (cyclomatic 16): update-system.reconcileGitignore 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":"update-system.mjs"},"region":{"startLine":4190}}}],"partialFingerprints":{"codehealthFindingId/v1":"085a5334edecdcff7a97bfa510b6b95607428d08aa4db6176215c0d70b59509d"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-structure.verifyStructure (cyclomatic 16): verify-cv-structure.verifyStructure has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-structure.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bd1df5460e04d6c019c15ea9b5b3a6f2f9a2f93c250355779b3c08db767a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 16): route.POST has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/route.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"12141102b22c51c9813d493d0087c7bed39fea212d36b8b0550dc83a426c122c"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 16): route.POST has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 70). 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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9603083fa3d20f5d1df419bfd241b7de76443c814518d7936da8aea64abba981"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 16): route.POST has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/tracker/delete/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9444b47ef80f3e0d18551877ada23a2bc831c14fbc2c20c524e436943fe5ca07"}},{"ruleId":"D1","level":"warning","message":{"text":"route.GET (cyclomatic 16): route.GET 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 item inside it that branches (toOffer). 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":"web/src/app/api/whats-new/route.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"514a2cbb987ac1901810e5623ccc5ec8a29148415f8fab742d4bed9655c15b07"}},{"ruleId":"D1","level":"warning","message":{"text":"triage-row.TriageRow (cyclomatic 16): triage-row.TriageRow 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":"web/src/components/inbox/triage-row.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e11b2651823bd0bb44870000509f2a9cf8c670a1af0fe8a448240403e45e923"}},{"ruleId":"D1","level":"warning","message":{"text":"status-select.StatusEditor::onChange (cyclomatic 16): status-select.StatusEditor::onChange 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":"web/src/components/status-select.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a339ab3c2174330d207d166fdec06b3cd2db8d85294992797156a0701d67cbf"}},{"ruleId":"D1","level":"warning","message":{"text":"job-stream.readJobStream::consume (cyclomatic 16): job-stream.readJobStream::consume 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":"web/src/lib/job-stream.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94de03e55f64a4f4ee5af0de7d36dfdea8cb7678257d44ec39f14f610fb96eb"}},{"ruleId":"D1","level":"warning","message":{"text":"data.enrichFromScanHistory (cyclomatic 16): data.enrichFromScanHistory 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":"dashboard/internal/data/career.go"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdbfbff988da361011891cfe0822f05e7dcc93d2240c71616862d0e4f7db5f8"}},{"ruleId":"D1","level":"warning","message":{"text":"data.LoadPDFManifest (cyclomatic 16): data.LoadPDFManifest 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":"dashboard/internal/data/pdf.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8ec96e54ca732ab77f75a0fe90fd99d3eb1e91fffdef265b3098c9272f3e39"}},{"ruleId":"D1","level":"warning","message":{"text":"buildCompanyCanonicalizer (cyclomatic 16): buildCompanyCanonicalizer has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"21360f740ae54a0cab9bc53553c907bfce65922fb8aedfa1bc2a02c6c13ccfb3"}},{"ruleId":"D1","level":"warning","message":{"text":"parseBlacklist (cyclomatic 16): parseBlacklist 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":"scan.mjs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"086fe9aedc238144c244d3923cd2990ccd29a445648246073ca8df87c666f50b"}},{"ruleId":"D1","level":"warning","message":{"text":"matchInvite (cyclomatic 16): matchInvite has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 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":"invite-match.mjs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"75714e1953df579802b69c58f13df45f586c69a72a379a91c867eb9590804255"}},{"ruleId":"D1","level":"warning","message":{"text":"computeRunStats (cyclomatic 16): computeRunStats has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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":"stats.mjs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"4096b1893d35ca3c3ab444c5027e123af2b3f01ecc5249a3ba607fef1a7c08ae"}},{"ruleId":"D1","level":"warning","message":{"text":"resolveTemplate (cyclomatic 16): resolveTemplate has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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":"cv-templates.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff13787cc05039d0c4b9582a2f722de98c75910ee03e708b3baea92d01d08dd"}},{"ruleId":"D1","level":"warning","message":{"text":"planExpiredHistoryRows (cyclomatic 16): planExpiredHistoryRows 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":"liveness-core.mjs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0208d19b68241516f235ab0ac4e899fa9263e4f6825c8b42a8429212c379cc13"}},{"ruleId":"D1","level":"warning","message":{"text":"headingKind (cyclomatic 16): headingKind 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":"jd-years.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad73acca3f3dffd0e2c008ddeb465ca0a304f0ae0721db6029ae10c8984cfb27"}},{"ruleId":"D1","level":"warning","message":{"text":"readConfig (cyclomatic 16): readConfig has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e6b05e2a774b97e4bc14dffd98359a1dbaabc7841e3e1a9905b2b43d35b7c8"}},{"ruleId":"D1","level":"warning","message":{"text":"parseGrokEvent (cyclomatic 16): parseGrokEvent 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":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9fbb7d3c8163f1243b0ec9fc00a5ce0689728dce8c971292ada5b80f7aaa56"}},{"ruleId":"D1","level":"warning","message":{"text":"buildPrompt (cyclomatic 16): buildPrompt 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":"web/src/lib/run-prompts.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6268783a02bcbb5081f7c3d48234023847ddd96aba4453b857ac71aebe4f4aec"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 319): main has cognitive complexity 319 (threshold 15). Drivers by points: if/else 151 (272 pts), boolean chains 87, loops 33 (61 pts), ternaries 28 (56 pts), other 10, error handling 5 (7 pts) (nesting depth added 179). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3257017779928835ce6d4e3da079d773e12d862fbfb14da967376f5ef823870"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeTracker::mergeUnderLock (cognitive 238): mergeTracker::mergeUnderLock has cognitive complexity 238 (threshold 15). Drivers by points: if/else 80 (147 pts), ternaries 16 (42 pts), boolean chains 30, loops 7 (14 pts), error handling 2 (4 pts), other 1 (nesting depth added 102). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3908d91f1b3fc176a7c3c68842e0abae6f65f16ac218eb6376c99e094479a578"}},{"ruleId":"D2","level":"warning","message":{"text":"explore-provider.ExploreProvider (cognitive 175): explore-provider.ExploreProvider has cognitive complexity 175 (threshold 15). Drivers by points: if/else 63 (89 pts), ternaries 22 (39 pts), boolean chains 23, error handling 11 (14 pts), loops 6 (9 pts), match/switch 1 (nesting depth added 49). None of this is in the body itself: all 175 points belong to 19 function literals inside it that branch (lines 175, 466, 213, \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":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"345e0ae84d1d93d4941060ca11280397c73d74eba044f2f472fd6a4e9aca307e"}},{"ruleId":"D2","level":"warning","message":{"text":"apply (cognitive 166): apply has cognitive complexity 166 (threshold 15). Drivers by points: if/else 53 (83 pts), error handling 18 (28 pts), ternaries 14 (23 pts), loops 10 (18 pts), boolean chains 14 (nesting depth added 57). Of this number, 164 points are the body\u0027s own statements and 2 belong to 17 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":"update-system.mjs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ec3a5ab3af1b8b6c2b5a411f95128bdf069da62ccf63b51b384a38a97b8c4"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-ats-full.main (cognitive 163): scan-ats-full.main has cognitive complexity 163 (threshold 15). Drivers by points: if/else 79 (160 pts), ternaries 28 (51 pts), boolean chains 44, error handling 5 (14 pts), loops 7 (11 pts) (nesting depth added 117). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c16f58ea8e56c2e243151f8a616386cb2d78196d6bca66049d1ad9471c292b"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-portals.validatePortalsConfig (cognitive 156): validate-portals.validatePortalsConfig has cognitive complexity 156 (threshold 15). Drivers by points: if/else 68 (156 pts), loops 9 (29 pts), boolean chains 24, ternaries 5 (17 pts) (nesting depth added 120). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (validate-portals.validatePortalsConfig::validateEntryList) 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":"validate-portals.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"369a6570cb8aa0c9aca48cfda03031639fdcbda651c96bf09a9c41ab39528591"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-pdf-flags.syncTrackerPdfFlags (cognitive 148): sync-pdf-flags.syncTrackerPdfFlags has cognitive complexity 148 (threshold 15). Drivers by points: if/else 46 (92 pts), ternaries 5 (23 pts), boolean chains 13, error handling 6 (11 pts), loops 4 (9 pts) (nesting depth added 74). 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":"sync-pdf-flags.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cf45e6e19a997a7ad145d8d67ff13eb7019c7cd61fd31bf198a588ad9e7e98"}},{"ruleId":"D2","level":"warning","message":{"text":"runSelfTest (cognitive 145): runSelfTest has cognitive complexity 145 (threshold 15). Drivers by points: if/else 77 (102 pts), boolean chains 16, loops 11, ternaries 4 (8 pts), error handling 2 (4 pts), other 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"796c67000c378758d061829036571243f424e14f7022c114e431aa2a2b2bf22e"}},{"ruleId":"D2","level":"warning","message":{"text":"aggregate-tokens.main (cognitive 126): aggregate-tokens.main has cognitive complexity 126 (threshold 15). Drivers by points: if/else 36 (106 pts), loops 6 (11 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 77). Of this number, 123 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/aggregate-tokens.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb48cbc333f7dfdcd3abecdd810a0b8f6dced21e22ec4dee03f02859136d254d"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 122): route.POST has cognitive complexity 122 (threshold 15). Drivers by points: if/else 61 (73 pts), ternaries 17 (22 pts), boolean chains 15, error handling 7 (9 pts), loops 3 (nesting depth added 19). Of this number, 46 points are the body\u0027s own statements and 76 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":"web/src/app/api/run/route.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76e97ef3908eeccf333beefe5a68c55c57f64328c5526e9b586a8d44a2cb569"}},{"ruleId":"D2","level":"warning","message":{"text":"apply-provider.ApplyProvider (cognitive 120): apply-provider.ApplyProvider has cognitive complexity 120 (threshold 15). Drivers by points: if/else 49 (73 pts), boolean chains 15, ternaries 5 (14 pts), error handling 7 (11 pts), loops 5 (7 pts) (nesting depth added 39). None of this is in the body itself: all 120 points belong to 12 function literals inside it that branch (lines 223, 107, 316, \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":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"084492e09555a50a8329ee0838d03fa4844e5fac15da1e1c44dea13d9d30e9c1"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.locallyModifiedSystemFiles (cognitive 119): update-system.locallyModifiedSystemFiles has cognitive complexity 119 (threshold 15). Drivers by points: if/else 18 (55 pts), loops 9 (25 pts), error handling 9 (19 pts), boolean chains 12, ternaries 3 (8 pts) (nesting depth added 68). Of this number, 102 points are the body\u0027s own statements and 17 belong to 2 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":"update-system.mjs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50256795ccaa80282e6a8fb75eae0a064a244628c14a4b6d971718d66663f60"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 111): main has cognitive complexity 111 (threshold 15). Drivers by points: if/else 29 (46 pts), ternaries 17 (37 pts), boolean chains 12, loops 4 (9 pts), error handling 3 (6 pts), other 1 (nesting depth added 45). Of this number, 101 points are the body\u0027s own statements and 10 belong to 11 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":"check-liveness.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"87510d88285b055299da474bc86c1f3df2cb4d3cc6ec7065647c32937575b2da"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 105): fetch has cognitive complexity 105 (threshold 15). Drivers by points: if/else 18 (51 pts), boolean chains 22, loops 6 (15 pts), error handling 4 (12 pts), ternaries 4 (5 pts) (nesting depth added 51). Of this number, 84 points are the body\u0027s own statements and 21 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":"providers/arbeitsagentur.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"32624891d5345a2d0e741596815aa7fa119a3549b47ba478ee19466c94c2a1fb"}},{"ruleId":"D2","level":"warning","message":{"text":"doImport (cognitive 99): doImport has cognitive complexity 99 (threshold 15). Drivers by points: if/else 23 (44 pts), ternaries 6 (22 pts), loops 9 (17 pts), other 7, boolean chains 6, error handling 2 (3 pts) (nesting depth added 46). Of this number, 45 points are the body\u0027s own statements and 54 belong to 12 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":"career-profile.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe8a7c21e03d488d3c8634b0b1382852fdaa440b1137874bf9df2821763a747"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 95): fetch has cognitive complexity 95 (threshold 15). Drivers by points: if/else 20 (56 pts), ternaries 5 (13 pts), loops 4 (9 pts), boolean chains 8, error handling 3 (8 pts), other 1 (nesting depth added 54). Of this number, 88 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55560e78fc8e4be4d10184dc49b7ef04e3ceb8d916322809b5f9c70b75029d7"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchCsb (cognitive 94): fetchCsb has cognitive complexity 94 (threshold 15). Drivers by points: if/else 13 (56 pts), ternaries 4 (18 pts), loops 5 (15 pts), boolean chains 4, error handling 1 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"546cfc7a30fb074d823879a66f5102c6582b5f39afba51d00ca11fa6da9c44b2"}},{"ruleId":"D2","level":"warning","message":{"text":"inbox-triage.InboxTriage (cognitive 91): inbox-triage.InboxTriage has cognitive complexity 91 (threshold 15). Drivers by points: boolean chains 28, if/else 23 (28 pts), ternaries 16 (22 pts), error handling 5 (7 pts), loops 6 (nesting depth added 13). Of this number, 18 points are the body\u0027s own statements and 73 belong to 27 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":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e37aacaca9951ebc7c42aaef63df607eaba0bc40debe87a030f41933e73767"}},{"ruleId":"D2","level":"warning","message":{"text":"runSelfTest (cognitive 90): runSelfTest has cognitive complexity 90 (threshold 15). Drivers by points: if/else 50 (59 pts), boolean chains 16, loops 9, error handling 5, ternaries 1 (nesting depth added 9). Of this number, 86 points are the body\u0027s own statements and 4 belong to 10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baedfb815ae59fde2c7f3f073f8ed8096b41caf8ae75baf830f4b5357937b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"salary-gap.printSummary (cognitive 89): salary-gap.printSummary has cognitive complexity 89 (threshold 15). Drivers by points: ternaries 15 (38 pts), if/else 19 (25 pts), loops 11 (24 pts), boolean chains 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf6fabd91daccb7e6c68904dc80cd437d535060eba4fece40e9e1cfba2f1816"}},{"ruleId":"D2","level":"warning","message":{"text":"buildEvidence (cognitive 89): buildEvidence has cognitive complexity 89 (threshold 15). Drivers by points: boolean chains 33, if/else 17 (28 pts), other 10, ternaries 7 (10 pts), loops 8 (nesting depth added 14). Of this number, 65 points are the body\u0027s own statements and 24 belong to 17 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":"github-evidence.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"283538a900a977f45724386f39953bc7e48f0414b0d8a27af16072fad084d176"}},{"ruleId":"D2","level":"warning","message":{"text":"followups-view.FollowupsView (cognitive 86): followups-view.FollowupsView has cognitive complexity 86 (threshold 15). Drivers by points: ternaries 23 (55 pts), if/else 16 (17 pts), boolean chains 12, error handling 1, loops 1 (nesting depth added 33). Of this number, 29 points are the body\u0027s own statements and 57 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":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb72280c009a399fd0c195ebb22a0eaa64e4c43475ae678ef1190a00b07e46a"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extractForm (cognitive 86): extract.extractForm has cognitive complexity 86 (threshold 15). Drivers by points: if/else 27 (49 pts), boolean chains 25, ternaries 4 (8 pts), loops 3 (4 pts) (nesting depth added 27). None of this is in the body itself: all 86 points belong to 10 function literals inside it that branch (lines 23, 52, 91, \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":"web/src/lib/apply/extract.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"076aaee63822e275ffc9cbaf1053e5a600c0e18c0f97a0981cdf74c673a8ae1c"}},{"ruleId":"D2","level":"warning","message":{"text":"export-ats-text.parseCvMarkdown (cognitive 85): export-ats-text.parseCvMarkdown has cognitive complexity 85 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 9 (25 pts), ternaries 4 (14 pts), boolean chains 7 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42e170cb3d581ebe8d5c8a921b2b0ed5645d8f81cea1d14b0596916ab9d43fa"}},{"ruleId":"D2","level":"warning","message":{"text":"checkUrlLiveness (cognitive 85): checkUrlLiveness has cognitive complexity 85 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 19, error handling 8 (15 pts), other 7, ternaries 5 (7 pts), loops 4 (5 pts) (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 56 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":"liveness-browser.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1a31abd6381099dadc20d691719ca5295f0fb42b955b0fe82a33221485510"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.handleKey (cognitive 84): PipelineModel.handleKey has cognitive complexity 84 (threshold 15). Drivers by points: if/else 30 (73 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 47). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef477095ca35aa8e4391c642c4c6e732bc41525d017fa48b176551cf10a91f50"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 81): route.POST has cognitive complexity 81 (threshold 15). Drivers by points: if/else 34 (42 pts), error handling 11 (16 pts), boolean chains 11, ternaries 7 (11 pts), loops 1 (nesting depth added 17). Of this number, 25 points are the body\u0027s own statements and 56 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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"34af8edae4a1e04da391e68c4fa97ce33f73b62dd678d29c8bdc22eb6e4018f2"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-check.diagnose (cognitive 78): coverage-check.diagnose has cognitive complexity 78 (threshold 15). Drivers by points: ternaries 15 (33 pts), if/else 17 (28 pts), boolean chains 17 (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":"coverage-check.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d6c8ec458ab0bc9d7ce9c3a71af8a478dd6d065f9130b2411a9d6ca9903087"}},{"ruleId":"D2","level":"warning","message":{"text":"extractPanelists (cognitive 78): extractPanelists has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 7 (14 pts), ternaries 7 (13 pts), boolean chains 12, other 1 (nesting depth added 35). Of this number, 56 points are the body\u0027s own statements and 22 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":"panelist-roles.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40dcbd01b7c7b7907760bbd998d0bef55516f8dcc902b49432d139f934d20fe"}},{"ruleId":"D2","level":"warning","message":{"text":"export-ats-text.formatAtsText (cognitive 77): export-ats-text.formatAtsText has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (37 pts), ternaries 9 (21 pts), boolean chains 19 (nesting depth added 27). Of this number, 31 points are the body\u0027s own statements and 46 belong to 7 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":"scripts/export-ats-text.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"862be5b20e2bdcbbb1ee3dbda9dab8eed8c21dc9a48ceac09fae628c548dfa9d"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-view.PipelineView (cognitive 76): pipeline-view.PipelineView has cognitive complexity 76 (threshold 15). Drivers by points: ternaries 19 (33 pts), boolean chains 21, if/else 17 (21 pts), loops 1 (nesting depth added 18). Of this number, 21 points are the body\u0027s own statements and 55 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":"web/src/components/pipeline-view.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"df96b7c97bb46760dbcd85ad0ee31db9d971d5f452fe95b41ff909ab43c97bec"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 75): fetch has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (49 pts), boolean chains 8, ternaries 5 (8 pts), loops 3 (6 pts), error handling 1 (3 pts), other 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gupy.mjs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"128ec6099faa5dc427a14b1dc70c59def635a93ff4e5819412e35b71803b434f"}},{"ruleId":"D2","level":"warning","message":{"text":"rollback (cognitive 73): rollback has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (43 pts), error handling 8 (15 pts), loops 6 (8 pts), boolean chains 4, ternaries 2, other 1 (nesting depth added 26). Of this number, 65 points are the body\u0027s own statements and 8 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":"update-system.mjs"},"region":{"startLine":5558}}}],"partialFingerprints":{"codehealthFindingId/v1":"172b8286945bd1308dddf00a3f284381f1a1ba78d4805597c73fdb224621bd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"selfTest (cognitive 71): selfTest has cognitive complexity 71 (threshold 15). Drivers by points: boolean chains 67, loops 3, if/else 1. Of this number, 59 points are the body\u0027s own statements and 12 belong to 34 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":"salary-gap.mjs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f35b764777cf5cc24642d99c8f9508566da7ab4326decfd6164b96194d3087"}},{"ruleId":"D2","level":"warning","message":{"text":"printSummary (cognitive 71): printSummary has cognitive complexity 71 (threshold 15). Drivers by points: loops 13 (24 pts), if/else 18 (22 pts), ternaries 7 (18 pts), boolean chains 6, other 1 (nesting depth added 26). Of this number, 69 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7c181a4fa0de07daf0dd627209e8363127fd5738b1f7ac6631b8e45a891807"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 70): fetch has cognitive complexity 70 (threshold 15). Drivers by points: if/else 15 (32 pts), ternaries 8 (21 pts), boolean chains 10, error handling 2 (6 pts), loops 1 (nesting depth added 34). Of this number, 66 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eightfold.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4bec61e2c4ae07e16652df0e75aa94dbecb59405c31bc45a6c0187f4aa8bcc"}},{"ruleId":"D2","level":"warning","message":{"text":"mapTrackerToApps (cognitive 69): mapTrackerToApps has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 17, loops 4 (5 pts), ternaries 1 (3 pts), other 1 (nesting depth added 31). Of this number, 68 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":"salary-gap.mjs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaffec15cdf28221589586f02a41248fdbab2884c0791938de29a76b69b72ab"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 69): fetch has cognitive complexity 69 (threshold 15). Drivers by points: if/else 37 (77 pts), ternaries 22 (50 pts), boolean chains 15, loops 5 (11 pts), error handling 4 (10 pts), other 2 (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workday.mjs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"9775eafa8694743a8a3237bc3e37084e1f1e6013af0d83aa6e9e5140a45ca6a4"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 69): main has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 5 (13 pts), boolean chains 9, ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 31). Of this number, 68 points are the body\u0027s own statements and 1 belongs to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b99142cb5846380945882057be7c232a071654065faaa583bb1ef5a1a32f0db"}},{"ruleId":"D2","level":"warning","message":{"text":"reply-matcher.matchCandidates (cognitive 68): reply-matcher.matchCandidates has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 23, loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc21582149a5780e7f43a3df02590b1464d134cecff45ae48adad9de2f6cb191"}},{"ruleId":"D2","level":"warning","message":{"text":"reconcile-pipeline.reconcile (cognitive 67): reconcile-pipeline.reconcile has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (44 pts), boolean chains 9, loops 8 (9 pts), ternaries 4 (5 pts) (nesting depth added 22). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reconcile-pipeline.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb3431aca15175368e3ed7e2defab39882cb1a6676f23eb005966d8a4e9fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"session.fillSession (cognitive 66): session.fillSession has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (36 pts), error handling 7 (17 pts), boolean chains 5, ternaries 1 (5 pts), loops 2 (3 pts) (nesting depth added 32). Of this number, 59 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4d797ae1a2ac6e69f610c846d3bd47fe6d2f1f3a42e16757272d01289ca005"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 66): main has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 10 (20 pts), boolean chains 10, loops 5 (9 pts), error handling 2 (4 pts) (nesting depth added 24). Of this number, 40 points are the body\u0027s own statements and 26 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":"reply-watch.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3f49050214884f683e006f32861bf4439c949b89e39ed422f05f71e120c80d"}},{"ruleId":"D2","level":"warning","message":{"text":"discover-ats.resolveCompany (cognitive 64): discover-ats.resolveCompany has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (32 pts), ternaries 7 (22 pts), boolean chains 9, loops 1 (nesting depth added 29). Of this number, 63 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f1d195ade778d721c763ad01c67c2403e66bfcab4389e91b809fe4d567a317"}},{"ruleId":"D2","level":"warning","message":{"text":"apply-view.FieldRow (cognitive 64): apply-view.FieldRow has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 18 (52 pts), boolean chains 11, if/else 1 (nesting depth added 34). Of this number, 57 points are the body\u0027s own statements and 7 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":"web/src/components/apply-view.tsx"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49ddb2d1010d258531ccd05e33d6fd0fa6bf84943356e4c7869c19a6e9fd129"}},{"ruleId":"D2","level":"warning","message":{"text":"fold (cognitive 63): fold has cognitive complexity 63 (threshold 15). Drivers by points: if/else 12 (25 pts), ternaries 9 (17 pts), boolean chains 12, loops 5, other 4 (nesting depth added 21). Of this number, 59 points are the body\u0027s own statements and 4 belong to 12 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":"salary-gap.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2863b850c51581547050cb78442a3b6785dbdad83c67ed6f914dd3e6c136fe"}},{"ruleId":"D2","level":"warning","message":{"text":"today-dashboard.TodayDashboard (cognitive 62): today-dashboard.TodayDashboard has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 17 (33 pts), boolean chains 18, if/else 10, error handling 1 (nesting depth added 16). Of this number, 43 points are the body\u0027s own statements and 19 belong to 13 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":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b7effab6a1d1427332916ea1c2542d2fa84d2e94441de6f2cf1cf7bf580207"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 62): fetch has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 9, ternaries 4 (9 pts), loops 5 (7 pts), error handling 2 (5 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":"providers/peoplesoft.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"857066a05aba50b1b195d1c53f8c7619d835bcb9168292bba19578c0ac39d76c"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-portals.validatePortalsConfig::validateEntryList (cognitive 61): validate-portals.validatePortalsConfig::validateEntryList has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (39 pts), boolean chains 9, ternaries 3 (9 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (validate-portals.validatePortalsConfig) 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":"validate-portals.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22c43fc4869a9a24e78230853d160916da425b06e562cf788b46747263be8e0"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze (cognitive 60): analyze has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 14, loops 5 (6 pts), ternaries 6, other 1 (nesting depth added 13). Of this number, 41 points are the body\u0027s own statements and 19 belong to 25 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":"analyze-patterns.mjs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6de19f75326d8b0074ad0de11d977b701f44673f2e1a429a7908529bf835f6"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-patterns.parseReport (cognitive 58): analyze-patterns.parseReport has cognitive complexity 58 (threshold 15). Drivers by points: boolean chains 27, if/else 19 (25 pts), loops 3 (6 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":"analyze-patterns.mjs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e9b0c73375efd84d87c8e0422b97ca239e916f2d36e18919803d0afbb4644f"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.factClaims (cognitive 58): verify-cv-facts.factClaims has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 8 (31 pts), loops 4 (10 pts), if/else 2 (9 pts), boolean chains 8 (nesting depth added 36). Of this number, 57 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":"verify-cv-facts.mjs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"163ec05f95c31f30a3b647efbeb99374e3c7f587058bcac512bd0dd14bf79399"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 58): route.POST has cognitive complexity 58 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 8, error handling 6 (8 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 15). Of this number, 32 points are the body\u0027s own statements and 26 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":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"366a3c19d52d07dc3124c001bc388c633ad76473bd6cd005d3d1fff9a14cd8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"_engine.validateManifest (cognitive 57): _engine.validateManifest has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 15, ternaries 7, loops 3 (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":"plugins/_engine.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3208b961f8e3262c0576e82c2aac67dacdc9734b606eb0046f1d7823271fcac"}},{"ruleId":"D2","level":"warning","message":{"text":"data.ComputeProgressMetrics (cognitive 57): data.ComputeProgressMetrics has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 8 (11 pts), match/switch 2 (4 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":"dashboard/internal/data/career.go"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"db177d6810d997948cb64fd16b6c9aca358fa880b866e442635cfa5e8cececd2"}},{"ruleId":"D2","level":"warning","message":{"text":"renderSummary (cognitive 57): renderSummary has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (26 pts), ternaries 9 (21 pts), loops 4 (7 pts), other 2, boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cba5eb9efe962ab5d730adaf3828d495ed6d20e56e04c34884d7ec4eb75346b"}},{"ruleId":"D2","level":"warning","message":{"text":"runSelfTest (cognitive 57): runSelfTest has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 11, loops 8, ternaries 4, error handling 2 (3 pts) (nesting depth added 8). Of this number, 50 points are the body\u0027s own statements and 7 belong to 13 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":"build-cv-latex.mjs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77905dd35600ee7b423d4ed840d43b5652fdbe9ace9f69cdc27c044f4c06ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"parseCv (cognitive 57): parseCv has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 8 (18 pts), boolean chains 3, other 1 (nesting depth added 24). Of this number, 30 points are the body\u0027s own statements and 27 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":"career-profile.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c9792479fbe343d15e5e8efcbfe7d56dd82fb7391fd37531c0ad2b359bdc52"}},{"ruleId":"D2","level":"warning","message":{"text":"data.ComputeStatsMetrics (cognitive 56): data.ComputeStatsMetrics has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 10 (13 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 22). Of this number, 53 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/stats.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ba75d502abda28297e3109a9ebf7e056cb93d4794f251ffcaa4ea2ffb9fdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 56): main has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 4 (7 pts), ternaries 3 (7 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-interamt.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39f30c6240689ac8ced8b8076fc3463d00160c761a0dc32d6e7fc03793e216f"}},{"ruleId":"D2","level":"warning","message":{"text":"computeVelocity (cognitive 55): computeVelocity has cognitive complexity 55 (threshold 15). Drivers by points: if/else 8 (34 pts), ternaries 3 (10 pts), loops 3 (6 pts), boolean chains 5 (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":"funnel-velocity.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58a4bb63fbcff613deb2fdc9bcb66379962ca15248e4847315a108ace788ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"upskill.runSelfTest (cognitive 54): upskill.runSelfTest has cognitive complexity 54 (threshold 15). Drivers by points: if/else 33 (44 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b3cfa8c86ffdc7e4e5f68bfbf1d578a63ddf7c7a9ec504082c719a4b8f1b72"}},{"ruleId":"D2","level":"warning","message":{"text":"explorer-view.ExplorerView (cognitive 54): explorer-view.ExplorerView has cognitive complexity 54 (threshold 15). Drivers by points: boolean chains 34, ternaries 7 (11 pts), if/else 7 (8 pts), error handling 1 (nesting depth added 5). Of this number, 37 points are the body\u0027s own statements and 17 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":"web/src/components/explore/explorer-view.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dc6febd678abdd9131450e2ea8644947a08ccb49ba609bdd0a9434eb6a2ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.collectSeenUrls (cognitive 53): scan.collectSeenUrls has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 10, loops 5 (8 pts), ternaries 1 (3 pts) (nesting depth added 23). Of this number, 51 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7810f19817f385953a3b2dfd132abf6143f7b3d18ace4cef0ef144e4114752"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-ingest.CvIngest (cognitive 53): cv-ingest.CvIngest has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 12, ternaries 7 (11 pts), error handling 2, loops 1 (nesting depth added 12). Most of this is not in the body itself: 11 of the 53 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 45, save, a function literal at line 203, \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":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3cdcfaf24dab17f5a3d562678e9a6c69e07aab586fbbc7b16666d14978e5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"computePortalStats (cognitive 53): computePortalStats has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 9, loops 4 (7 pts), ternaries 2, error handling 1, other 1 (nesting depth added 24). Of this number, 52 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":"stats.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1456a7be0ac4ffeef53fe7c70ec3144f06f4571760e9d828c5ede3fee0c3a11f"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 53): main has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 9 (17 pts), ternaries 2 (5 pts), boolean chains 1, other 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-dayforce.mjs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e8e27c5621043c29e5ce19ced435bac2252941e17cc7bf44f43ef056c86248"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.renderMarkdown (cognitive 52): build-cv-html.renderMarkdown has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 10 (15 pts), boolean chains 7, loops 6 (7 pts) (nesting depth added 14). Of this number, 41 points are the body\u0027s own statements and 11 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":"build-cv-html.mjs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5990a14635a2e627d8ddd70f8e7667afc675dcc05e822993f51530b87ebcb55"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-sync-check.main (cognitive 52): cv-sync-check.main has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 5 (18 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 26). 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":"cv-sync-check.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"838c1e6f17d57c38afb32a66bbb2b9c7da6baa53fbfcd131181318492b81214f"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n-drift.extractHeadings (cognitive 52): i18n-drift.extractHeadings has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 8, ternaries 2 (8 pts), loops 2 (3 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":"i18n-drift.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"843eb6a5c1dd080614dac12c83a999f4f93df429386d4a8c22623c2a63e68999"}},{"ruleId":"D2","level":"warning","message":{"text":"cssDeclarations (cognitive 52): cssDeclarations has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 11, ternaries 3 (11 pts), loops 3 (8 pts) (nesting depth added 23). Of this number, 51 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84cd56884f0e2fcf06df2d158d5d653a4ea562f54d725a891a3aa0b4791818b"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-pdf.generatePDF (cognitive 50): generate-pdf.generatePDF has cognitive complexity 50 (threshold 15). Drivers by points: if/else 33 (40 pts), boolean chains 6, error handling 2, loops 1, ternaries 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":"generate-pdf.mjs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bc3e1ce185a3bd8cfec8763c830432fde4fcfb87bea40e30cf1019898317a0"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-structure.runCli (cognitive 50): verify-cv-structure.runCli has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (23 pts), ternaries 5 (14 pts), boolean chains 5, loops 3 (5 pts), error handling 3 (nesting depth added 16). Of this number, 49 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":"verify-cv-structure.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a859b19c26b6f0974c50be6180813da40f504af7d7e29559568c8758c919ddc2"}},{"ruleId":"D2","level":"warning","message":{"text":"employer-source.scanEmployer (cognitive 50): employer-source.scanEmployer has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 11 (21 pts), if/else 9 (14 pts), boolean chains 10, error handling 2 (3 pts), loops 2 (nesting depth added 16). Of this number, 23 points are the body\u0027s own statements and 27 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":"web/src/lib/core/employer-source.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5614877633e051d8972d5d413bf7c6ac81ed26fac26f0baf3da2b87859310a24"}},{"ruleId":"D2","level":"warning","message":{"text":"appModel.Update (cognitive 50): appModel.Update has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 1 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 27). Of this number, 48 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/main.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b766fa40fce6b3521cad2e93b27a958b61705e61f609b5123c179beab967fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeAnswers (cognitive 50): normalizeAnswers has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 22, if/else 11 (15 pts), ternaries 6 (7 pts), other 5, loops 1 (nesting depth added 5). Of this number, 45 points are the body\u0027s own statements and 5 belong to 5 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":"onboard-write.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f8cb11938b210d1c1d165588f9a9a31d17c61097bc5c45ed574e7ac1572b92"}},{"ruleId":"D2","level":"warning","message":{"text":"walk-tree.walkTree::walk (cognitive 49): walk-tree.walkTree::walk has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (36 pts), error handling 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/walk-tree.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdfdafb44c804744cf25e312f381a3eada77af18f6bd0801b74953a4f308b60"}},{"ruleId":"D2","level":"warning","message":{"text":"runBatchFromManifest (cognitive 49): runBatchFromManifest has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 14, error handling 6 (7 pts), other 4, ternaries 1 (3 pts), loops 1 (nesting depth added 11). Of this number, 48 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":"generate-pdf.mjs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"839964b61435a02b6c62722818b4631f707276b7d7197fbe9427933c0a0073a5"}},{"ruleId":"D2","level":"warning","message":{"text":"parseYearsRequirement (cognitive 49): parseYearsRequirement has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 6 (17 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 23). Of this number, 37 points are the body\u0027s own statements and 12 belong to 11 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":"jd-years.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420e4ffa729162589fb265c97216b0b707eefa3327628f98d88e4d8b5449d49"}},{"ruleId":"D2","level":"warning","message":{"text":"printSummary (cognitive 49): printSummary has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 10 (31 pts), if/else 6 (10 pts), loops 3 (6 pts), boolean chains 2 (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":"assessment-log.mjs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"da043e1e4d00c9015acca21e0bb48478c146114293a8446632af460443c98dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"contact-extract.main (cognitive 48): contact-extract.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 16, ternaries 3 (7 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":"contact-extract.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e337a71450628c047faebfc759585cedc90ee358064c4e32df0f15070387311c"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 48): route.POST has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 9 (13 pts), error handling 6 (8 pts), boolean chains 4, loops 1 (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 24 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":"web/src/app/api/assistant/route.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"57acdb15caf8c4718bbf93831af22da1b5cec2bd4078b5e0aab529e93795049e"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-json-object.extractJsonObject (cognitive 48): extract-json-object.extractJsonObject has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (37 pts), loops 5 (6 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 18). Of this number, 44 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/extract-json-object.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce5ada9c7d6e253d9d933ad35f2181a5ddb9dab6142ea9f18493e324f67b279"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerModel.renderAll (cognitive 48): ViewerModel.renderAll has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 8 (20 pts), boolean chains 2 (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":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d462ffbb1aaf47d3777f0741a72c988bd674179aaf32eb4112f13df414ca7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"computeResponsiveness (cognitive 48): computeResponsiveness has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 11 (20 pts), boolean chains 5, loops 1, other 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":"company-history.mjs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"746e82f87afe6662b57e269182c495af89d19c5b90b775d2b1c0fce87a764ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"computePortalRecommendations (cognitive 48): computePortalRecommendations has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 16, ternaries 4 (7 pts), loops 4, other 3, error handling 1 (nesting depth added 10). Of this number, 44 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":"stats.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1537b81fab3402ce8015b2fae4b076731de6741e0fd5433c45c4e171fb57ca78"}},{"ruleId":"D2","level":"warning","message":{"text":"parseRecruiteeResponse (cognitive 48): parseRecruiteeResponse has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 7 (15 pts), boolean chains 5, loops 3 (5 pts), error handling 1 (3 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":"providers/recruitee.mjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fb224ca348b62f8b8ff19af52fc13cdf05fe9b1a80bca058a41745c18907b4"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 48): fetch has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8, ternaries 4 (6 pts), loops 3, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/techinasia.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c491deb31bf2595b50bc924cb443514f5670a6564de460a2c2eb864cf1202e74"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnose.verifyFill (cognitive 47): diagnose.verifyFill has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 14, ternaries 3 (6 pts), loops 3 (nesting depth added 12). Most of this is not in the body itself: 9 of the 47 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 218, 214, 219). 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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"421d65a23c0e3da187cf94b8274f841e6bf41f854fcbabd701acf318fe33ef4e"}},{"ruleId":"D2","level":"warning","message":{"text":"cmdRun (cognitive 47): cmdRun has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 6 (11 pts), boolean chains 5, loops 2 (4 pts), other 1 (nesting depth added 15). Of this number, 46 points are the body\u0027s own statements and 1 belongs to 6 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":"plugins.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d948b6aab7226a49042d8f88564ce177119975c3557d9a9cea5a15ec7295f7"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 47): fetch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 10, ternaries 4 (8 pts), loops 2 (3 pts), error handling 1 (2 pts), other 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe193fff58cab66012092e5f361988ad482e1c530ce3dade5f0cf019ad75834"}},{"ruleId":"D2","level":"warning","message":{"text":"computeStatsMetrics (cognitive 47): computeStatsMetrics has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 8 (16 pts), other 7, boolean chains 4, loops 1 (nesting depth added 18). Of this number, 45 points are the body\u0027s own statements and 2 belong to 10 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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f27eb83b0cf87c00c4d579ea4e6dc8c48878068263f5545e3b482a4afe1b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"fingerprint-core.findCrossListings (cognitive 46): fingerprint-core.findCrossListings has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 7 (13 pts), loops 3 (4 pts), boolean chains 3 (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":"fingerprint-core.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a061e1ae46446e96a8847f9c4252a4ce6ddd951f2a660b6de7e1e5c735ff4c"}},{"ruleId":"D2","level":"warning","message":{"text":"vc-portfolios.parseA16zPayload (cognitive 46): vc-portfolios.parseA16zPayload has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 3 (10 pts), boolean chains 7, loops 4 (5 pts), error handling 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e039ce8d24ed634f880c848bd2a1f0d58e3d0963817c6982cb05a7850f854f11"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-ats.auditAts (cognitive 46): verify-ats.auditAts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 27 (31 pts), loops 4 (7 pts), boolean chains 6, ternaries 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":"verify-ats.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"725507426992689ddce471c22ac3955d0f373f5b72a481028d0792f14fa8cf77"}},{"ruleId":"D2","level":"warning","message":{"text":"data.ParseApplications (cognitive 46): data.ParseApplications has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 5, loops 2 (nesting depth added 20). Of this number, 42 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a2e80ffded2bf0560083417cb1b6340c096954a031aeb989bae680ae0b149e"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 46): main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 4 (7 pts), boolean chains 5, ternaries 4, error handling 1 (2 pts), other 2 (nesting depth added 12). Of this number, 41 points are the body\u0027s own statements and 5 belong to 9 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":"rank-pipeline.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1806b635f8480edb7eac3ff77e437dfab007c20eea6e132c7f79b47da32b1782"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 46): fetch has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03263736e2ebbb4239823baf881a9cfd8f2024c7ceb5239662da47e57199441"}},{"ruleId":"D2","level":"warning","message":{"text":"company-history.buildCompanyCards (cognitive 45): company-history.buildCompanyCards has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 8 (9 pts), loops 6 (8 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":"company-history.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f463caf28fdbe03cdb5e91d515d8dbe878e66fbd2b9129a65f0b152109f5b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ashby.formatLocation (cognitive 45): ashby.formatLocation has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 8, loops 3 (8 pts), ternaries 3 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ashby.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac5267ea32d6fec7c2474ecc6d48e0ea3c0eb531a20e235abbaef1f2cf89288"}},{"ruleId":"D2","level":"warning","message":{"text":"computeRejectionLatency (cognitive 45): computeRejectionLatency has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 6 (8 pts), boolean chains 7, loops 2, other 1 (nesting depth added 15). Of this number, 43 points are the body\u0027s own statements and 2 belong to 6 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":"rejection-latency.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a632d7a676f66b5983b61abb26d684fb6d580ea36f17871228737ded2fc666"}},{"ruleId":"D2","level":"warning","message":{"text":"parseIcs (cognitive 45): parseIcs has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 15, ternaries 7 (9 pts), other 1 (nesting depth added 6). Of this number, 42 points are the body\u0027s own statements and 3 belong to 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b282cccdb5ef54fa29c23db50b306cc3b775df43674f8fd32d961762e930285"}},{"ruleId":"D2","level":"warning","message":{"text":"stats.printSummary (cognitive 44): stats.printSummary has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 16 (18 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb13bb577d79e7e5b690e7d151427bff8d4a1342f581ae794415aa4a8f6b0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.revertPaths (cognitive 44): update-system.revertPaths has cognitive complexity 44 (threshold 15). Drivers by points: error handling 5 (19 pts), if/else 9 (17 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 23). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"695f6962e5348124db8789c9dd91023a43d80fe7d507d56367df7c06b0a67304"}},{"ruleId":"D2","level":"warning","message":{"text":"verifyOffers (cognitive 44): verifyOffers has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (25 pts), ternaries 5 (8 pts), boolean chains 5, error handling 3 (5 pts), loops 1 (nesting depth added 16). Of this number, 32 points are the body\u0027s own statements and 12 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":"scan.mjs"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b93ecd076b0dd42a1c8826eab1f4be7fc8bf6ebc7e09ab3baa0ba66fa76ac0b"}},{"ruleId":"D2","level":"warning","message":{"text":"readDom (cognitive 44): readDom has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 7 (12 pts), boolean chains 10, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 16). None of this is in the body itself: all 44 points belong to 8 function items inside it that branch (a function literal at line 966, (anonymous)::strippedText, a function literal at line 1002, \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":"browser-extract.mjs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"393eea75f1f67b4854a84a589b3be2e3ffc528b8f1d9be9287715bcd725d933f"}},{"ruleId":"D2","level":"warning","message":{"text":"callOpenRouter (cognitive 44): callOpenRouter has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), error handling 3 (6 pts), other 3, boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3ba50cad4da8d44e00e6dee29bf17aef85719dbbbbb8ee7efbcdd8072a8986"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduled-jobs-view.ScheduledJobsView (cognitive 43): scheduled-jobs-view.ScheduledJobsView has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 13 (17 pts), boolean chains 13, if/else 9, error handling 4 (nesting depth added 4). Most of this is not in the body itself: 11 of the 43 points are its own statements and the rest belongs to 7 function items inside it that branch (loadData, handleDelete, handleTriggerOsScheduler, \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":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8263b5c53370265f14affc59db991c9537974fc4d063ed5cf69c40c51ea326f"}},{"ruleId":"D2","level":"warning","message":{"text":"data.parseStatusLedger (cognitive 43): data.parseStatusLedger has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 6 (11 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 23). Of this number, 42 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":"dashboard/internal/data/funnel_history.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"16069e3248c3102e790a1a8d627a90995056297905f11913ba88e114cdeafac0"}},{"ruleId":"D2","level":"warning","message":{"text":"renderSummary (cognitive 43): renderSummary has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 6 (13 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 20). Of this number, 42 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":"linkedin-join.mjs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d8d4e3f9cdd363104ac924535f730daaa952448b3bde6967592329d78b8a85"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-hn.main (cognitive 42): scan-hn.main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 5, loops 2 (4 pts), error handling 1 (3 pts), 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":"scan-hn.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4af3485c73c8736c75ab696991041c34262f33b703074dcc30edbff664e9f4"}},{"ruleId":"D2","level":"warning","message":{"text":"assistant-console.AssistantConsole::send (cognitive 42): assistant-console.AssistantConsole::send has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, loops 4 (7 pts), ternaries 3 (6 pts), error handling 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (assistant-console.AssistantConsole) 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d35b1b5eac22488de25ce9881b50df67f8d3eadb6220968b13c5b1170fb4deb"}},{"ruleId":"D2","level":"warning","message":{"text":"documents.discoverDocuments (cognitive 42): documents.discoverDocuments has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (28 pts), error handling 4 (7 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 19). Of this number, 41 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":"web/src/lib/documents.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94b431a33df49d10c2b0cc447dbab57a9212533ad3bd78a0d8761d82796c671"}},{"ruleId":"D2","level":"warning","message":{"text":"data.enrichAppURLsByCompany (cognitive 42): data.enrichAppURLsByCompany has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (9 pts), boolean chains 3 (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":"dashboard/internal/data/career.go"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"59879cbc37e90d62b205ed64b4275549e0e0f88181d482f0e7819a501f27301c"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch::runQuery (cognitive 42): fetch::runQuery has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 7 (13 pts), boolean chains 5, error handling 1 (3 pts), loops 1 (2 pts), other 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":"providers/workday.mjs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd00ed4a860e0a2bc065f9db8e771d0fad591c51e085b6a8c1300473853e6966"}},{"ruleId":"D2","level":"warning","message":{"text":"parseMarkdownRows (cognitive 42): parseMarkdownRows has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, ternaries 4 (6 pts), loops 2 (3 pts), other 3 (nesting depth added 16). Of this number, 39 points are the body\u0027s own statements and 3 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":"tracker.mjs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea8a57375fe2a3f3accda60fa814d2d51e8e7e09e790388c03bebfbc46d54bc"}},{"ruleId":"D2","level":"warning","message":{"text":"check-jd-archive.checkJdArchive (cognitive 41): check-jd-archive.checkJdArchive has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 9 (23 pts), if/else 6 (11 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 20). Of this number, 40 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":"check-jd-archive.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc84e1465c33f90441b4b9ba99c1cd95f7155a0c0888fbb48af21aefdb570bd"}},{"ruleId":"D2","level":"warning","message":{"text":"extractContacts::add (cognitive 41): extractContacts::add has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 8, loops 2 (4 pts), ternaries 4, other 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f345ab6447f9d138ac4b5924a11e58e49fd2df0553ffde75da5bb31fba5761b"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 41): fetch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (9 pts), boolean chains 3, error handling 1 (3 pts), ternaries 2 (3 pts), other 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfebff2ddcedc89f64b71df4ca17742fe7d10aacfa5aec485875462ab5a629e0"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 41): fetch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"11805a1bb97c7a3e40a95bdb0c482c6ed86c8923102ef1987431e69c37dd2f56"}},{"ruleId":"D2","level":"warning","message":{"text":"searchInteramt (cognitive 41): searchInteramt has cognitive complexity 41 (threshold 15). Drivers by points: error handling 11 (26 pts), if/else 8 (13 pts), loops 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-interamt.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"763a9a3f7849ba292805b6282755e04cdb01f244953da73eff231be18db87328"}},{"ruleId":"D2","level":"warning","message":{"text":"personalization.scanHeadings (cognitive 40): personalization.scanHeadings has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 3 (11 pts), loops 2 (5 pts), boolean chains 3 (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":"lib/personalization.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e79ee3f2e7d204436ca0264a028b805c4f60227ef35ef9c79cf10d48229e2"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery-card.DiscoveryCard (cognitive 40): discovery-card.DiscoveryCard has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 10 (25 pts), boolean chains 15 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/discovery-card.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"636112d0ca117fab189b56d045f65490185b113ff4785115f854e3d7719ff26a"}},{"ruleId":"D2","level":"warning","message":{"text":"personalization-file.mergeSections (cognitive 40): personalization-file.mergeSections has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 7 (16 pts), boolean chains 5, loops 3 (nesting depth added 15). Of this number, 38 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":"web/src/lib/personalization-file.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e0adc2e3e76a0711a73db9fff702e490a19f0c06ed7270fd80e0b696e58c44"}},{"ruleId":"D2","level":"warning","message":{"text":"checkMainChannel (cognitive 40): checkMainChannel has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 11, if/else 8, error handling 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bf79fce7976518d125581888274e37540c90ddad9ea2794628cc8f59a768fc"}},{"ruleId":"D2","level":"warning","message":{"text":"scanBoard (cognitive 40): scanBoard has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, ternaries 3 (6 pts), error handling 2 (3 pts), loops 3, other 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":"scan-dayforce.mjs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ed900f8d85c26f56202ef00c90db9df6c6dad41f1524e57a04902a4c1b0afe"}},{"ruleId":"D2","level":"warning","message":{"text":"parseEightfoldResponse (cognitive 40): parseEightfoldResponse has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (3 pts), other 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":"providers/eightfold.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3485ba9d642d991aea7790339c50dc4d1d1f925ca5ebb31cdb0d29d1a9c7ae23"}},{"ruleId":"D2","level":"warning","message":{"text":"applyAdd (cognitive 40): applyAdd has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 5, 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":"add-entry.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c09bf74151d7be8354f15f30f33dc485879d705e15855732b39618dc8667aff"}},{"ruleId":"D2","level":"warning","message":{"text":"notion.parsePageChunk (cognitive 39): notion.parsePageChunk has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 8, ternaries 5 (8 pts), loops 2 (3 pts) (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 19 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":"providers/notion.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbddb3a40bda56d30d3ad7eac7d3d185a5dcd7faa02b48115e844b607d449b5"}},{"ruleId":"D2","level":"warning","message":{"text":"prevueaps.parsePrevueapsResponse (cognitive 39): prevueaps.parsePrevueapsResponse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 5 (11 pts), boolean chains 6, error handling 1 (3 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/prevueaps.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"589bcd462e360033d3c90d36e5bf325fbd093c9dfbd030f0f94410a072352bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"run-history-drawer.RunHistoryDrawer (cognitive 39): run-history-drawer.RunHistoryDrawer has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 11 (34 pts), boolean chains 4, if/else 1 (nesting depth added 23). Most of this is not in the body itself: 2 of the 39 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). 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":"web/src/components/scheduled-scans/run-history-drawer.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ab4cd2cb4f3190dabf54d35e8e6b02e64732f7450a0cecd631ad10feb7ec64"}},{"ruleId":"D2","level":"warning","message":{"text":"view-model.statsModel (cognitive 39): view-model.statsModel has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 13 (27 pts), if/else 5 (6 pts), boolean chains 5, loops 1 (nesting depth added 15). Of this number, 33 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics/view-model.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cef6a9ddbf8853b1a8c404bfe8e3a2f246fe8c074143a2374441511364f4bd"}},{"ruleId":"D2","level":"warning","message":{"text":"renderMarkdown (cognitive 39): renderMarkdown has cognitive complexity 39 (threshold 15). Drivers by points: loops 8 (13 pts), ternaries 7 (12 pts), if/else 8 (9 pts), boolean chains 3, other 2 (nesting depth added 11). Of this number, 33 points are the body\u0027s own statements and 6 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":"github-evidence.mjs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001ea4c063274a79fd3cc68eb1ba7843c0745ffeb0274a30ebbcc537c345849"}},{"ruleId":"D2","level":"warning","message":{"text":"parseCompensation (cognitive 39): parseCompensation has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 8 (9 pts), boolean chains 8, other 8 (nesting depth added 4). Of this number, 26 points are the body\u0027s own statements and 13 belong to 6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ashby.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0372a0d702b4a032ad3b7c6e5745809d23cbaa64ce57c2a0c73cb097191c639e"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.runCli (cognitive 38): verify-cv-facts.runCli has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 3 (6 pts), ternaries 3 (5 pts), boolean chains 3, error handling 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":"verify-cv-facts.mjs"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd45d2a9cd4747dbdd07822da32432adf7acef04e9d47d632f13ce4ceb6cf037"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonc-parse.stripJsoncSyntax (cognitive 38): jsonc-parse.stripJsoncSyntax has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 6, loops 2 (4 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":"jsonc-parse.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9783646d6589f355d7f45789ae020a061250bc8f7949138150fba51537eca60e"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.main (cognitive 38): doctor.main has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 10 (13 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db29f8419e5ee819ac4879a56f21897c9c29b45aa98ba1d9e4e7f14f04624c4"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.unpersonalizedFiles (cognitive 38): doctor.unpersonalizedFiles has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 4 (14 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1ca16b41870b57131f775166a2b6b3fcc35fbbc9a068b0a985df048d424532"}},{"ruleId":"D2","level":"warning","message":{"text":"persist-evaluation-report.writeEvaluationArtifacts (cognitive 38): persist-evaluation-report.writeEvaluationArtifacts has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 11, ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"persist-evaluation-report.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aba8c600f48b7445c00cf47c2a21da10e53f28f312317af4227680f0d933309"}},{"ruleId":"D2","level":"warning","message":{"text":"api.requestJson (cognitive 38): api.requestJson has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (23 pts), error handling 5 (7 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 18 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6c2a1e325e7459ef8a75d1c9f9a68ad65542f359f1730736bd3578395aaad5"}},{"ruleId":"D2","level":"warning","message":{"text":"assistant-history.cleanMessages (cognitive 38): assistant-history.cleanMessages has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 12, boolean chains 11 (nesting depth added 8). Most of this is not in the body itself: 2 of the 38 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 11, 7). 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":"web/src/lib/assistant-history.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"85173e741d4ecb170dfd85f8e2d7708bf819a1b4178f683c4cd3e6982f82a89c"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-yaml-edit.setSection (cognitive 38): profile-yaml-edit.setSection has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 2 (6 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/profile-yaml-edit.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fc970d7a73eeaafd2a2d9dfcb2e81f8daf98cdcab6a750b99f6ef96d7917d6"}},{"ruleId":"D2","level":"warning","message":{"text":"report-persist.persistEvaluation (cognitive 38): report-persist.persistEvaluation has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 10, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 6). Of this number, 30 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-persist.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc57d53cf6262e6f411396defe92990ea64119a062cfb71f954c5196f4aaeab"}},{"ruleId":"D2","level":"warning","message":{"text":"data.deriveNoteFields (cognitive 38): data.deriveNoteFields has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 4, loops 4, match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/derive.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a858ecc8156b3d6997bfc2168a15ea3114923c5eb0739fe38b659ee22a8f6115"}},{"ruleId":"D2","level":"warning","message":{"text":"StatsModel.renderPieChart (cognitive 38): StatsModel.renderPieChart has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/stats.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5697d924eb79dbcfd1c5cc9fd556a21459b4d49aa49aed081210d242aa53749c"}},{"ruleId":"D2","level":"warning","message":{"text":"classifyRows (cognitive 38): classifyRows has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (18 pts), other 8, ternaries 3 (6 pts), boolean chains 3, loops 3 (nesting depth added 12). Of this number, 37 points are the body\u0027s own statements and 1 belongs 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":"close-stale.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e4769a66c3d3044e7314e8a6fbaac36778c934056181cf301af4e081435cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-title-check.parseCvExperience (cognitive 37): cv-title-check.parseCvExperience has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 3 (6 pts), boolean chains 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":"cv-title-check.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b190c8676d057bd0719ce617ac420682a0978a783ae738c49a6652421a52ca6a"}},{"ruleId":"D2","level":"warning","message":{"text":"reply-proposals.readReplyProposals (cognitive 37): reply-proposals.readReplyProposals has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 5, error handling 2 (3 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/reply-proposals.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37d2302927f42beaa9a1706271e473f223330a28a2232ae7a416d82a905354"}},{"ruleId":"D2","level":"warning","message":{"text":"hiringroom.parseJsonLdJobs (cognitive 37): hiringroom.parseJsonLdJobs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (22 pts), error handling 2 (5 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a052450bf60d574791452897855fd33bc781bc6d290157f0b643419a4ab9687"}},{"ruleId":"D2","level":"warning","message":{"text":"platsbanken.parsePlatsbankenResponse (cognitive 37): platsbanken.parsePlatsbankenResponse has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 11 (21 pts), boolean chains 8, if/else 4 (7 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":"providers/platsbanken.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad045921147588160bb94143e3f595922788d1e0264460c91f7a3f3d5697f61"}},{"ruleId":"D2","level":"warning","message":{"text":"namedWithNewActivity (cognitive 37): namedWithNewActivity has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 12, ternaries 4 (5 pts), loops 2 (4 pts), other 1 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 9 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":"github-evidence.mjs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6c45f084ef638797611d11cb5c298b3bb96b7d306d7657dfe642959e061c46"}},{"ruleId":"D2","level":"warning","message":{"text":"buildCandidates (cognitive 37): buildCandidates has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (12 pts), boolean chains 10, loops 2 (nesting depth added 14). Of this number, 31 points are the body\u0027s own statements and 6 belong to 6 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":"company-funded.mjs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7e2be72fe80102599b6afab6dbf4d7030939482505625a8543d52f0a0788c0"}},{"ruleId":"D2","level":"warning","message":{"text":"greenhouse.buildOfficeMap::walk (cognitive 36): greenhouse.buildOfficeMap::walk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 3 (11 pts), loops 3 (8 pts), boolean chains 2 (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":"providers/greenhouse.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e08c6d41eb2b961e4f51a91d6e76bd0dcdc1fc955451417d8d367c8d5b47bc"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-rescue.fromLdJson (cognitive 36): jd-rescue.fromLdJson has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 5 (13 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 20). Of this number, 33 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":"batch/jd-rescue.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5889ed062079b9a7c7144228b65ed958b928b49f8db5aee5d7c27c177dbef6e9"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-latex.main (cognitive 36): build-cv-latex.main has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 16, if/else 8, ternaries 4 (6 pts), loops 3 (4 pts), error handling 2 (nesting depth added 3). Of this number, 30 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-latex.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"978137f970d08946a30778d7db80115e31e0f87c5769bdec07065bb42eedc2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"contacts.printSummary (cognitive 36): contacts.printSummary has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 10, loops 5 (10 pts), boolean chains 2 (nesting depth added 12). Of this number, 32 points are the body\u0027s own statements and 4 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":"contacts.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed17c12bc7af1f325af107a75b23862747b351d32617695c5b8a31616cb8202"}},{"ruleId":"D2","level":"warning","message":{"text":"fill-stream.readFillResult (cognitive 36): fill-stream.readFillResult has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 3 (6 pts), boolean chains 5, error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/fill-stream.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b118e893b1ba265a33d5a940dcddf180a5a7f26687ba4a6641c20f918c2e46"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.runScanner (cognitive 36): scan.runScanner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 3, ternaries 2 (3 pts), loops 2, error handling 1 (nesting depth added 6). None of this is in the body itself: all 36 points belong to 10 function literals inside it that branch (lines 282, 345, 362, \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":"web/src/lib/core/scan.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"00525a6ab40bf06c9f1dc552baaf29fcb13f5ce75b3140fa3787c89611d04e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzeFromContent (cognitive 36): analyzeFromContent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 6 (12 pts), boolean chains 3, loops 2, other 2 (nesting depth added 14). Of this number, 32 points are the body\u0027s own statements and 4 belong to 9 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":"followup-cadence.mjs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b318b95e2e7d8190b09fc2296b1a41892105256192baddc481f27b171b5689dd"}},{"ruleId":"D2","level":"warning","message":{"text":"seedBackfill (cognitive 36): seedBackfill has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 2 (5 pts), boolean chains 4, other 4, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-seed.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e0327e5aabbda24d42791adbc0a898ce8696eedb860ffb63aea68746bc0667"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-pdf.scanNesting (cognitive 35): generate-pdf.scanNesting has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 5, 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":"generate-pdf.mjs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7e61b45fd30618944e37d2b9ba93527b72c45b9c1c6f9a95c35cc997dc494e"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.discoverAlternates (cognitive 35): verify-portals.discoverAlternates has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 3 (6 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24e46a5b3f77b873ee5a5c722d4c2c68fafe5f2e673c301ce978f7ae0b632e7"}},{"ruleId":"D2","level":"warning","message":{"text":"generalist-world.stripNonRendered (cognitive 35): generalist-world.stripNonRendered has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/generalist-world.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0955d261d6e563d21e452aa5a9768bd8013d0cf3c941ffc31477efef29a5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"data.acquireTrackerLock (cognitive 35): data.acquireTrackerLock has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/tracker_lock.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c736020e4813dd54f70e55667f2c900871586f27ea866b84b8762f84b8ab63af"}},{"ruleId":"D2","level":"warning","message":{"text":"attemptDirLock (cognitive 35): attemptDirLock has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), error handling 5 (9 pts), boolean chains 3, other 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa3fd459454adfff0f1dc5893056d013f53149c9f6fa0be8cad1aa04bbac623"}},{"ruleId":"D2","level":"warning","message":{"text":"attemptDirLock (cognitive 35): attemptDirLock has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), error handling 5 (9 pts), boolean chains 3, other 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1bff3a84ab92e0f34dff5239f7f8f05da0bb878f51ae7fa6ad799f54046c63"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchHnDiscovery (cognitive 35): fetchHnDiscovery has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 5 (14 pts), boolean chains 9, if/else 4 (9 pts), 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":"company-funded.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef7c777d32ea7f11b6e3559bc96ae0c45a8e320860e48533cbf2db38199f3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"computeCalibration (cognitive 35): computeCalibration has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (4 pts), other 2 (nesting depth added 10). Of this number, 32 points are the body\u0027s own statements and 3 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":"calibrate.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c974025c0d3e5311036da1830dd24b8394169bcc9d8876d08c0cd0949dfa1"}},{"ruleId":"D2","level":"warning","message":{"text":"createCachedLookup (cognitive 35): createCachedLookup has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (11 pts), other 10, ternaries 8 (9 pts), boolean chains 3, loops 2 (nesting depth added 2). Most of this is not in the body itself: 8 of the 35 points are its own statements and the rest belongs to 8 function items inside it that branch (cachedLookup, a function literal at line 312, a function literal at line 262, \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":"providers/_dns-cache.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac38dbc04d675dd8a28c8c95b39c610f3185faeb4eb0ebc827012cf0ba6caaa"}},{"ruleId":"D2","level":"warning","message":{"text":"archiveJdOnInterview (cognitive 35): archiveJdOnInterview has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 8 (10 pts), boolean chains 7, other 4, 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":"lib/status-hooks.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c3b5612d752a1811b6153b7439604961aa3bcd373c413e5463fa6dea76ad6f"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.buildCooldownFilter (cognitive 34): scan.buildCooldownFilter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 6, loops 1 (nesting depth added 18). Most of this is not in the body itself: 2 of the 34 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1344, 1375, 1373). 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":"scan.mjs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3e8ca0296122a38d999be86dceb16dce70a0b0e1148c6ca1df41a2e5757f50"}},{"ruleId":"D2","level":"warning","message":{"text":"reply-matcher.classifyReply (cognitive 34): reply-matcher.classifyReply has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 13, ternaries 1 (2 pts), loops 1 (nesting depth added 6). Of this number, 31 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c2b9134a2a253cc340686ebe58410a9068d70c822fa3d4105142783b02fe14"}},{"ruleId":"D2","level":"warning","message":{"text":"ics-interview.printSummary (cognitive 34): ics-interview.printSummary has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 10 (25 pts), if/else 5 (6 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"65700ee9edb5a3c1da324a7c5643ac30a28a2f68e5847ac0dca79853f46b2a16"}},{"ruleId":"D2","level":"warning","message":{"text":"panelist-roles.readIcsText (cognitive 34): panelist-roles.readIcsText has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 8, ternaries 1 (4 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":"panelist-roles.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"453cca76e1578a129dc0d80826a5855825f95d33f18b5b6e0a044a23332ac8e4"}},{"ruleId":"D2","level":"warning","message":{"text":"paylocity.parsePaylocityBoard (cognitive 34): paylocity.parsePaylocityBoard has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 7 (14 pts), boolean chains 5, 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":"providers/paylocity.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7355cf30a81305e0afec413cbd62361b88f287ab63c48e1ce83a30fdbc448308"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.configuredTemplateVariantsFromProfileSource (cognitive 34): update-system.configuredTemplateVariantsFromProfileSource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 26 (50 pts), boolean chains 10, loops 3 (4 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource::parseScalar) 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":"update-system.mjs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e93c4365dcf100b7245a846781f075d2a1ecbddb139c1368f5cd35903aa64"}},{"ruleId":"D2","level":"warning","message":{"text":"session.openSession (cognitive 34): session.openSession has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, ternaries 4 (6 pts), error handling 2 (nesting depth added 5). Of this number, 31 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aa6889aa0bdf1e83791497c1e1e79ecedaad2ba0b8492b29bac97a2aa32f70"}},{"ruleId":"D2","level":"warning","message":{"text":"buildCompanyCanonicalizer (cognitive 34): buildCompanyCanonicalizer has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (9 pts), boolean chains 3, ternaries 1 (3 pts), other 1 (nesting depth added 19). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"5186ff2ca279799fe0f5aed025cb0b6649fea5b7e3b620336a108c151393ec18"}},{"ruleId":"D2","level":"warning","message":{"text":"htmlToText (cognitive 34): htmlToText has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 1 (4 pts), boolean chains 2, loops 2, other 2 (nesting depth added 15). Of this number, 28 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":"closing-soon.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5a710f5c42fbf625a238fe7ac11db3288e477acd8602e5435381ba31a58534"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-pdf.normalizeTextForATS (cognitive 33): generate-pdf.normalizeTextForATS has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 5 (9 pts), boolean chains 8, loops 1 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 17 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"772e4ec6e1ba10c4d8f6df82621c578495672e3455791580cc732d93bb051edc"}},{"ruleId":"D2","level":"warning","message":{"text":"assistant-console.AssistantConsole (cognitive 33): assistant-console.AssistantConsole has cognitive complexity 33 (threshold 15). Drivers by points: if/else 71 (92 pts), boolean chains 69, ternaries 35 (56 pts), error handling 12 (14 pts), loops 7 (11 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (assistant-console.AssistantConsole::send) 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1de4ce0144e1334afc6b6bdfdbeb96c9dfcf79e51f5d0383080d75c0e95ab20"}},{"ruleId":"D2","level":"warning","message":{"text":"job-store.JobsProvider (cognitive 33): job-store.JobsProvider has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 8 (9 pts), boolean chains 7, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 178, 147, 219, \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":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2959c2714169a3440fa0814babf0aab4d7360c89aa7fa18e0e5d2ad1e73fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"report-view.ReportView (cognitive 33): report-view.ReportView has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 22, ternaries 5 (7 pts), if/else 2 (4 pts) (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 14 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":"web/src/components/report-view.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"881a8c6725e3a0c016523117835e80d4c2277a46738bdacc9a6cc884ed284265"}},{"ruleId":"D2","level":"warning","message":{"text":"data.CanonicalizeLocation (cognitive 33): data.CanonicalizeLocation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/stats.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd7051454742ac29731ea3e45ac87b0e71c3c16d0048435327ac4446f013789"}},{"ruleId":"D2","level":"warning","message":{"text":"trackerLock.release (cognitive 33): trackerLock.release has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/tracker_lock.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e133160b3c1c543c3014ce80ee1ca3cbc1a7f394ed90ad132656014a64a53a"}},{"ruleId":"D2","level":"warning","message":{"text":"writeVcf (cognitive 33): writeVcf has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 9 (13 pts), boolean chains 3, other 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":"contacts.mjs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"da569ab4ef414f8018bfa97f852cbc29645ae3f91423ff355633653c88a373d0"}},{"ruleId":"D2","level":"warning","message":{"text":"roleFuzzyMatch (cognitive 33): roleFuzzyMatch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, ternaries 3 (4 pts), other 2 (nesting depth added 4). Of this number, 30 points are the body\u0027s own statements and 3 belong to 16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"role-matcher.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"249c221e9103d2575c1428b5c55d0255ab9f821d07ce12d10a5e0f789651778f"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-patterns.buildPatternSignals (cognitive 32): analyze-patterns.buildPatternSignals has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 4 (9 pts), boolean chains 4, ternaries 3 (nesting depth added 12). 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, 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":"analyze-patterns.mjs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2110605f71644d22be8047af333895da3adf4a3c45b789a626cb0a0bbd9c2500"}},{"ruleId":"D2","level":"warning","message":{"text":"ultipro.extractCandidateOpportunityDetail (cognitive 32): ultipro.extractCandidateOpportunityDetail has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), error handling 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd604c4caa7e37c562b3279ba55a239d58979950e63b06029ef12919673cfbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-match.parseMatchArgs (cognitive 32): keyword-match.parseMatchArgs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 3, 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":"keyword-match.mjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6bacdfca6432896b597ab9bd3768448645bcdd5c014c4c9b577e4000793cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"pageup.parsePageupListing (cognitive 32): pageup.parsePageupListing has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pageup.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"189bb6dfed134d612f2c01b5cb6dbafee0804217ebde227fcf9e5ce5f677f7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"results-list.ResultsList (cognitive 32): results-list.ResultsList has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 12 (23 pts), boolean chains 8, if/else 1 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/results-list.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"545360f3918d6b084cef27777ca163239a012f00dfd041e9d12e71a727a6b08d"}},{"ruleId":"D2","level":"warning","message":{"text":"data.loadJobURLs (cognitive 32): data.loadJobURLs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35fd702cfdb5b57cbc7501290766f368368a49a13ef11c5da95575487746942"}},{"ruleId":"D2","level":"warning","message":{"text":"data.parseMarkdownLinks (cognitive 32): data.parseMarkdownLinks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bfa1a9ddd394cb55d67bc10790d19eec4fd502d0af9fc47810f18324ca60c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerModel.Update (cognitive 32): ViewerModel.Update has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 2 (3 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c504617d4540dcfd0228c51e61e438b207507b62d564344d696a59cfa58631f1"}},{"ruleId":"D2","level":"warning","message":{"text":"query (cognitive 32): query has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5, loops 2 (4 pts), ternaries 2 (3 pts), other 1 (nesting depth added 7). Of this number, 30 points are the body\u0027s own statements and 2 belong to 3 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":"tracker.mjs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe943d0118cedbdc28fcdca10ded542cfd3f2f971c5436a2716d9d3c752fe82"}},{"ruleId":"D2","level":"warning","message":{"text":"extractKeywords (cognitive 32): extractKeywords has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 15). Of this number, 22 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"523df2883cf6f24fabf515a005061b9fb11a5d73db710d05c32fd4049d4bf775"}},{"ruleId":"D2","level":"warning","message":{"text":"checkFreshness (cognitive 32): checkFreshness has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts), other 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dc5aad1712f4ddae52b880a34b10a861eeb52d1b898250f0688a1e39b1af63"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeTechInAsiaJob (cognitive 32): normalizeTechInAsiaJob has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 9, ternaries 3 (5 pts), error handling 1 (2 pts), 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":"providers/techinasia.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab8f782d17dc9b37d34bbd656328806d03e7593511d75dd7e0aa4237689079f"}},{"ruleId":"D2","level":"warning","message":{"text":"dir-lock.createRelease (cognitive 31): dir-lock.createRelease has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). None of this is in the body itself: all 31 points belong to one function literal inside it that branches (line 897). 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":"lib/dir-lock.mjs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb0a1a4e4364e4e3afc771a0d232526112a2e3e0743ccc964ab6c8a9333cd5a"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-payload-schema.validatePayload (cognitive 31): cv-payload-schema.validatePayload has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, loops 3, ternaries 2 (3 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cv-payload-schema.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d71a614513b46459224171fb3e326f9bb4db17d8ee6c96932d62b0f58f4b31"}},{"ruleId":"D2","level":"warning","message":{"text":"stats.computeScanStats (cognitive 31): stats.computeScanStats has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 12). Of this number, 30 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":"stats.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"325578e41993a70f434524b79a6675112d58d793881147103820cf4832431fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-ats-full.runSeedScan (cognitive 31): scan-ats-full.runSeedScan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (5 pts), error handling 3 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 11). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 930, 922). 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":"scan-ats-full.mjs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"721e7f9f902380e8ab27fe72703f80207a6ac47eccbee37c7cbbe411e902692f"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.configuredTemplateVariantsFromProfileSource::parseScalar (cognitive 31): update-system.configuredTemplateVariantsFromProfileSource::parseScalar has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (update-system.configuredTemplateVariantsFromProfileSource) 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":"update-system.mjs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c72efca8af93e87c56297830c7cc9199db0f178a64d200592489ecd91b4505d"}},{"ruleId":"D2","level":"warning","message":{"text":"dir-lock.createRelease (cognitive 31): dir-lock.createRelease has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). None of this is in the body itself: all 31 points belong to one function literal inside it that branches (line 897). 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":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b260004e0527fcd4de8acf9645202777b86a92b13eaa5726bf5285716fc10b"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-interpret.captureCandidates (cognitive 31): agent-interpret.captureCandidates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 14, loops 1 (nesting depth added 9). None of this is in the body itself: all 31 points belong to 3 function literals inside it that branch (lines 28, 29, 54). 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":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"82347564a807501587b420510a5623b3b3a98243f704a8cb6d10c4c0b34c7936"}},{"ruleId":"D2","level":"warning","message":{"text":"data.enrichFromScanHistory (cognitive 31): data.enrichFromScanHistory has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (9 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":"dashboard/internal/data/career.go"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"415bb5bbfb7a8f44505cdb6c18985e62c4b6e067d98ba76b4919fbc96f9d13e1"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeTracker::parseTsvContent (cognitive 31): mergeTracker::parseTsvContent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, other 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":"merge-tracker.mjs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9ecfe8a876e20d08822dc5fdd03ff6f704033d043cec5629fa55b129254550"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 31): main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (6 pts), other 5, error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b876c17e2e22bb0ee96744cfe30b0a16a16cc17490955cc855968823cf68de9"}},{"ruleId":"D2","level":"warning","message":{"text":"main::processJobs (cognitive 31): main::processJobs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, error handling 1 (3 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":"scan-ats-full.mjs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"093736953fd0451792eff071607a14acb06b4fbb0d1e822797141df6ea10d984"}},{"ruleId":"D2","level":"warning","message":{"text":"createRelease::release (cognitive 31): createRelease::release has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1972608aa9bad016aa3de2d5536aab3707a4671f804030d4814d00dcdd2f5ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"createRelease::release (cognitive 31): createRelease::release has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"49085150ab72aaa2815ad2d87d248e6ae812d2a32611fafcb5d25a70b509cced"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchTextMeta (cognitive 31): fetchTextMeta has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 3 (6 pts), boolean chains 5, ternaries 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":"company-funded.mjs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b0672c245f6fe349f952dc9ee490fec8bd6ba425c943f39af32798e2e726f1"}},{"ruleId":"D2","level":"warning","message":{"text":"atsLint (cognitive 31): atsLint has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 8, ternaries 3 (8 pts), loops 2 (3 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad3c348d4bf311fcd3ea869ec10893d749c6d81f284d89bbcb495dd8f751390"}},{"ruleId":"D2","level":"warning","message":{"text":"compileLatexFile (cognitive 31): compileLatexFile has cognitive complexity 31 (threshold 15). Drivers by points: error handling 6 (14 pts), if/else 10 (13 pts), loops 1 (2 pts), boolean chains 1, ternaries 1 (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, 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":"generate-latex.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc79513566a2bbdb4ca954b3a87f2bc190dc1cb57ae71bb55d6f08293e3477"}},{"ruleId":"D2","level":"warning","message":{"text":"computeProgressMetrics (cognitive 31): computeProgressMetrics has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (12 pts), other 9, boolean chains 4, loops 3, ternaries 3 (nesting depth added 6). Of this number, 28 points are the body\u0027s own statements and 3 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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a05b1b9905535ecf802e1583338e00aa25c120f400c19ac8faa1652967b900"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-patterns.buildPredictedDiscardReasonSignals (cognitive 30): analyze-patterns.buildPredictedDiscardReasonSignals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 pts), boolean chains 6, ternaries 1 (nesting depth added 11). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a707703a114bd6bf7a3a13451b78a5e0bff9bd9666813b63cb440f10182f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"_engine.discoverPlugins (cognitive 30): _engine.discoverPlugins has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), error handling 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). Of this number, 23 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24600d3496c9c7c070fdf097255dc06f979f4478e07a5baa3a46d047cf6fccd"}},{"ruleId":"D2","level":"warning","message":{"text":"ultipro.parseListPage (cognitive 30): ultipro.parseListPage has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c15dc6079c737eae90de6607ff65ed101e1da93377ac7d9e367f064efd9e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"branded-successfactors.classifyUnknownHostSeeds (cognitive 30): branded-successfactors.classifyUnknownHostSeeds has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, error handling 2 (4 pts), loops 3 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"branded-successfactors.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47996a7816feeb9314c730dcd8a2d957d4256deec07db1007541e82ad503b67"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-templates.loadAtsRules (cognitive 30): cv-templates.loadAtsRules has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 1, 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":"cv-templates.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c62bd10d16d1ee080cff42bfb8e960bbb1514280365d69968f924eb5a4ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"career-profile.validateProfile (cognitive 30): career-profile.validateProfile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7, ternaries 2 (4 pts), loops 3 (nesting depth added 5). Most of this is not in the body itself: 13 of the 30 points are its own statements and the rest belongs to 2 function items inside it that branch (checkFact, a function literal at line 31). 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":"lib/career-profile.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca580934e27e1e09edff0f493af836b380afe8a7a465b6fcad6e1a6122a1cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"clean-markers.processFile (cognitive 30): clean-markers.processFile has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (18 pts), if/else 5 (8 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":"clean-markers.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4879fe49a030292a6b9366276272bb070edc4ab98eb7863f8cae7002294905a2"}},{"ruleId":"D2","level":"warning","message":{"text":"followup-seed.parseCliArgs (cognitive 30): followup-seed.parseCliArgs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (26 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":"followup-seed.mjs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e030febfecbe64e4d8042cc7f10175497622bc7c457c1114fc96719e1e3cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"vc-portfolios.parseYCPayload (cognitive 30): vc-portfolios.parseYCPayload has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6 (11 pts), boolean chains 6, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef1c38710ab107f82c2f06efb53a6c6c8f3a0531c6230aa3b2744e465a8fe55"}},{"ruleId":"D2","level":"warning","message":{"text":"export-ats-text.normalizeProfile (cognitive 30): export-ats-text.normalizeProfile has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 19, 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":"scripts/export-ats-text.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48b275bc1afa8c0d6415c8fed38fb6005526de677d64685703ffa48a4c853a9"}},{"ruleId":"D2","level":"warning","message":{"text":"company-history.factLine (cognitive 30): company-history.factLine has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (11 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/company-history.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e621450b3e380dc5ebd96daafb138631e97e0e4800229a4b5e9e19289f1b8afb"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-sort.sortRows (cognitive 30): pipeline-sort.sortRows has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (8 pts), ternaries 6 (8 pts), boolean chains 3 (nesting depth added 12). Of this number, 19 points are the body\u0027s own statements and 11 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":"web/src/lib/core/pipeline-sort.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85ad63fe06e0207f0e22cd7de572c2ff25399c148df761041f4e327b941a805"}},{"ruleId":"D2","level":"warning","message":{"text":"states.readCanonicalStates (cognitive 30): states.readCanonicalStates has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 4 (7 pts), boolean chains 3, loops 1 (2 pts), error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/states.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2a8c2d6c7f51139ce86e34e202378fc918119fe756ea55eec0f778ed4c68ca"}},{"ruleId":"D2","level":"warning","message":{"text":"headlineText (cognitive 30): headlineText has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (9 pts), loops 3 (5 pts), boolean chains 2, other 2 (nesting depth added 14). Of this number, 20 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":"generate-pdf.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb681f129b742e22a6fa2506539af1bb12d9121e125c7212d445aaebfe0dfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch::split (cognitive 30): fetch::split has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 2 (5 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1, other 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":"providers/workday.mjs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bf87e80b1c01d2209ee225b1e3105d3d053595160ff9eb02ba727c93a133e0"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeProfile (cognitive 30): normalizeProfile has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 11, other 10, ternaries 8, 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a15f1dc660a4995f6f2a034766c59a4533d7ceed3253c1fcc633c4ae62852e8"}},{"ruleId":"D2","level":"warning","message":{"text":"parseCliArgs (cognitive 30): parseCliArgs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, loops 1, other 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":"archive-posting.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8660ab58628d54ea31da385aa0966febba67d991415e50e87b2d8342d440e374"}},{"ruleId":"D2","level":"warning","message":{"text":"parseClaudeEvent (cognitive 30): parseClaudeEvent has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 12, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8389eb59db66119412b2a5ee6e32d8937bee0ef8083ff6a2bd1a85dd4f86c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"parseListPage (cognitive 30): parseListPage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, ternaries 4 (6 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":"providers/adp-workforcenow.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff831e254e64054da28718f0fc923895a0b54efef16010418ffc3304b7eccf3"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 30): main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, ternaries 4 (6 pts), other 2 (nesting depth added 4). Of this number, 27 points are the body\u0027s own statements and 3 belong to 4 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":"hired-share.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3550574874bb30f117c52fddf668f25899e4d286bf371eeec1d0e4510c07006c"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.findUnmined (cognitive 29): verify-portals.findUnmined has cognitive complexity 29 (threshold 15). Drivers by points: if/else 2 (10 pts), loops 4 (10 pts), ternaries 2 (7 pts), boolean chains 2 (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":"verify-portals.mjs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ba3d62cd92a15f33b6e85a67d02cb747743745ba5364ea2ceb8ef3a7a5b3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"debrief-sync.parseArgs (cognitive 29): debrief-sync.parseArgs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debrief-sync.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddb1e48bd9e43387bc14211d356a18006feaef3bd535ab53e0568d247c2a2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"smartrecruiters.parseSmartRecruitersResponse (cognitive 29): smartrecruiters.parseSmartRecruitersResponse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 10, ternaries 4, error handling 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to one function literal inside it that branches (line 212). 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":"providers/smartrecruiters.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d00741cc720afa8821a5666c53b3db7c17d90b5bce1bb9c1aa2b83572ef289"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.onboardingState (cognitive 29): doctor.onboardingState has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 12 (13 pts), boolean chains 9, error handling 2 (4 pts), if/else 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"434bbc2780eb21e67eef620f168a6d506e05384de16a14a8792cf56159acf7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"filter-audit.audit (cognitive 29): filter-audit.audit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 13). Of this number, 27 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":"filter-audit.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc1fd4e2bf724cbbab0d095763d3e3610de964f5fa27984675ec278f1694d77"}},{"ruleId":"D2","level":"warning","message":{"text":"intake.listSourceFiles::walk (cognitive 29): intake.listSourceFiles::walk has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf34676b2380efea6df6d928f4b64007c536c35ff11e597e8c101011b0677d"}},{"ruleId":"D2","level":"warning","message":{"text":"magneto.parseCards (cognitive 29): magneto.parseCards has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 4 (9 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/magneto.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a4fd4488efae814ff8ff25404284b9069209d67e94853eb96010d086dcf57"}},{"ruleId":"D2","level":"warning","message":{"text":"export-ats-text.loadProfile (cognitive 29): export-ats-text.loadProfile has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 4 (8 pts), boolean chains 4, ternaries 1 (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":"scripts/export-ats-text.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d566a6212739f0f86818f9deb5ddbd68b2534fe287c349132cf490f00dc5025"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 29): route.GET has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 4 (8 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv-pdf/route.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be7ae0a57544fb081745a1289c1c0fbd2503017652203e30772c8dcca434e7f"}},{"ruleId":"D2","level":"warning","message":{"text":"apply-view.ApplyView (cognitive 29): apply-view.ApplyView has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 25, ternaries 2 (3 pts), if/else 1 (nesting depth added 1). 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0e5502363e21389139c58a9d70f499ec1d09ea0c1dacb4d92886bd5acb2e68"}},{"ruleId":"D2","level":"warning","message":{"text":"job-card.JobCard (cognitive 29): job-card.JobCard has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 13 (15 pts), boolean chains 9, if/else 4, error handling 1 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/job-card.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257a1e26e05d4ebf0793bae2d2e6e2786796a8587137765bbbadd9d650fad6d"}},{"ruleId":"D2","level":"warning","message":{"text":"run-cli-support.parseCodexEvent (cognitive 29): run-cli-support.parseCodexEvent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ad919f092af8ce2fd12f161888b5b3ee8cd4ca4f9ca14de98f280136544346"}},{"ruleId":"D2","level":"warning","message":{"text":"renderInPage (cognitive 29): renderInPage has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), error handling 4 (6 pts), ternaries 5 (6 pts), other 3 (nesting depth added 4). Of this number, 24 points are the body\u0027s own statements and 5 belong to 5 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":"generate-pdf.mjs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d2585f05f4b085b0b2c5dac87ceeb5f28b6e9a34284633bda86c7f4520b4f6"}},{"ruleId":"D2","level":"warning","message":{"text":"parseTracker (cognitive 29): parseTracker has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, ternaries 1 (3 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90676d8a87949aade450d25943c5d55dd29bf8b2b1f1486ff008160b3fa1fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"scanJd (cognitive 29): scanJd has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (5 pts), boolean chains 4, other 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-skill-gap.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e884bd7ebb25fb086a6af004ef97a634696e93ab9da10adadb1304bed0454c"}},{"ruleId":"D2","level":"warning","message":{"text":"computeUrgency (cognitive 29): computeUrgency has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 3 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d4993cbd522222a5449b7a1f3e76ccb2582253ba1132a583273c0b8df1f931"}},{"ruleId":"D2","level":"warning","message":{"text":"searchAuthoredCommits (cognitive 29): searchAuthoredCommits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c8f4eda166f905a08ab7604a842d6fbb7c60a3c9085edb8b477e9da6b73053"}},{"ruleId":"D2","level":"warning","message":{"text":"archiveUrl (cognitive 29): archiveUrl has cognitive complexity 29 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 7 (9 pts), boolean chains 3, ternaries 2 (3 pts), other 2, loops 1 (nesting depth added 9). 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":"archive-posting.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d1387a8dc8b78e0c60954627ff4c991bda66a72cbea02d0a993dc8fdacf79"}},{"ruleId":"D2","level":"warning","message":{"text":"cli-flags.validateFlags (cognitive 28): cli-flags.validateFlags has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, ternaries 3 (6 pts) (nesting depth added 6). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 150, a function literal at line 123, a function literal at line 117, \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":"lib/cli-flags.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5007efac3a3ad01da18b9a40a19a9e8f19ac17ff15d20b08b3f7256b4168b483"}},{"ruleId":"D2","level":"warning","message":{"text":"detect-reposts.detectRepostsInGroup (cognitive 28): detect-reposts.detectRepostsInGroup has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 17). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"detect-reposts.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dca5bcafeeb4b3ea9e83c4e0e0a96827fdcf1eaecbc88de6562e05572b71bec"}},{"ruleId":"D2","level":"warning","message":{"text":"breezy.parseBreezyResponse (cognitive 28): breezy.parseBreezyResponse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 5 (9 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/breezy.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c0aa1d5bfb43b92904e06d8ca676093fc9419ccd03844861143b8cdaadc989"}},{"ruleId":"D2","level":"warning","message":{"text":"discover-ats.main (cognitive 28): discover-ats.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 3 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 14 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"df623a3852a9f8292dc7386062fa1ebbaf6a6bf7a0b19cb7a4761a77930a6050"}},{"ruleId":"D2","level":"warning","message":{"text":"intake.main (cognitive 28): intake.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"364853ff6296783c42ed164e3d98bd055929da78f967cad60eb7e5a7bc925681"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-match.runSelfTest (cognitive 28): keyword-match.runSelfTest has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 5, error handling 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":"keyword-match.mjs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"58be30869c103413862f78bdba6b39a33911085bf34216a36a8dbb12684de9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"pythonorg.parsePythonOrgFeed (cognitive 28): pythonorg.parsePythonOrgFeed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, loops 1, 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":"providers/pythonorg.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b536d627df829f350c423cd4adc15702d5bf4123e03cf77206dfb4821666f"}},{"ruleId":"D2","level":"warning","message":{"text":"wttj.normalizeWttjHit (cognitive 28): wttj.normalizeWttjHit has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 13, if/else 8, ternaries 7. 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":"providers/wttj.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf424b5b8c387bae969d56caae313513d8b65eb0953519d95c759d73b5306cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"skip-blockers.rankSkipBlockers (cognitive 28): skip-blockers.rankSkipBlockers has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (9 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 15). Of this number, 26 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":"skip-blockers.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68da3499a57190c2972f7ca905626178fbb0eee4a8244a4749b773b571e5598"}},{"ruleId":"D2","level":"warning","message":{"text":"drive.snapshot (cognitive 28): drive.snapshot has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 4 (7 pts), boolean chains 4, loops 3 (nesting depth added 13). Of this number, 25 points are the body\u0027s own statements and 3 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":"web/src/lib/apply/drive.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0225da0c966d84e93909ed10c3948679565fecc840c937a274e6779ca50bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerModel.styleLine (cognitive 28): ViewerModel.styleLine has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"2615749b5899087f39feea0efb94d61cc1be417abcc42a3fefa3fa22e8799478"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshotConfiguredTemplateVariants (cognitive 28): snapshotConfiguredTemplateVariants has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 4 (6 pts), loops 4 (5 pts), boolean chains 2, other 2, ternaries 1 (2 pts) (nesting depth added 9). Of this number, 25 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":"update-system.mjs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee4a1dbf52bbc995111c28591313526fbf3621ec01d43beee7104777c08b20"}},{"ruleId":"D2","level":"warning","message":{"text":"renderSummary (cognitive 28): renderSummary has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (13 pts), loops 4 (7 pts), if/else 4 (6 pts), boolean chains 1, other 1 (nesting depth added 14). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"107cdeeed3846cfcdd80fec04c43252b9b40ce3e8e15bfa83fac2bb92ef3565c"}},{"ruleId":"D2","level":"warning","message":{"text":"printResults (cognitive 28): printResults has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (9 pts), boolean chains 7, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbe2550bb57a6513005fe881bc1594e9ad57e3377fa3fc6795f99ef268c2c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"aggregateGaps (cognitive 28): aggregateGaps has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 7 belong to 8 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":"upskill.mjs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e9b34352d535dff105a999cd9ed7d61f61e79f2ca5c8ce10d9bbc38b7b96c8"}},{"ruleId":"D2","level":"warning","message":{"text":"parseFormState (cognitive 28): parseFormState has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (9 pts), boolean chains 6, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72ee698d599241e81df797e9b5ba5e098c65cbf78a39ded8f65167edef48134"}},{"ruleId":"D2","level":"warning","message":{"text":"appendNote (cognitive 28): appendNote has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, ternaries 3 (5 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fix-slugs.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42332362f2b51925b6258abf358ba704ecf0833d55ada2d38103e317f728e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"recruitee.assembleLocation (cognitive 27): recruitee.assembleLocation has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 5 (8 pts), boolean chains 7 (nesting depth added 8). Most of this is not in the body itself: 13 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 270). 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":"providers/recruitee.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d12e29e5680c5df3b5fa2104f890566f0523f4a8032fb63a7d43141e0c1f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"hired-wall-build.buildSvg (cognitive 27): hired-wall-build.buildSvg has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 10). Of this number, 24 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":"hired-wall-build.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe41cecc7c7547b62608c314c433ff9bb9e06402573aa8c6d2ce82d3e2d151"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin-join.renderCompanyAnswer (cognitive 27): linkedin-join.renderCompanyAnswer has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce10a236aba6840faa58c5572a5d09672f1a3dee2d10ace8ff87ef2bd291654"}},{"ruleId":"D2","level":"warning","message":{"text":"dover.parseDoverPage (cognitive 27): dover.parseDoverPage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (8 pts), boolean chains 7, 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":"providers/dover.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8cae7d91400daa11a441756a370aa63f9e54448c2ae676283989d2cf7aa3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"jobvite.parseJobviteXml (cognitive 27): jobvite.parseJobviteXml has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobvite.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6875d4c1ac62563f2af5520b22ae50099a97c087960a8b3baa97c2891b8d71"}},{"ruleId":"D2","level":"warning","message":{"text":"career-ops.readLanguageConfig (cognitive 27): career-ops.readLanguageConfig has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9591ed62428610c979a5fe5e2d0d1329852d5b7ccfb46d830a05ca734bdb5995"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-yaml-edit.trailingComment (cognitive 27): profile-yaml-edit.trailingComment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 10, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/profile-yaml-edit.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bf9dd42bfb913d4b5c4109617dee24685eef68a28b3410f86e7f94ce4de279"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.renderPreview (cognitive 27): PipelineModel.renderPreview has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e4fc74eb77de6d4ebbb071b3d2faec44ab61c04b65478fc75487c8e6d0ded0"}},{"ruleId":"D2","level":"warning","message":{"text":"buildProjects (cognitive 27): buildProjects has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (13 pts), boolean chains 11, if/else 3 (nesting depth added 5). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 522, a function literal at line 496, a function literal at line 496, \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":"build-cv-html.mjs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f89bc7d3d2caab96da3adf498f7ba864809f70bc9c2fe162c508df7bfb460c5"}},{"ruleId":"D2","level":"warning","message":{"text":"checkLivenessViaApi (cognitive 27): checkLivenessViaApi has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9, error handling 3 (4 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-api.mjs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7185284b2d41978fe1121021cf7553743d1fdd480c65e5aee820fcdabd5272"}},{"ruleId":"D2","level":"warning","message":{"text":"readBoundedText (cognitive 27): readBoundedText has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 4 (9 pts), ternaries 2 (4 pts), boolean chains 2, loops 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c73b73bff2bc4f8fe41955cf8a37d1f6db3b13a0c84cb13bb30ae4fbccd310"}},{"ruleId":"D2","level":"warning","message":{"text":"canonicalizeArchetype (cognitive 27): canonicalizeArchetype has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 15, if/else 11, other 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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cdb69248335150be33f11f00a82d2bfbb3f7b6f6a893ba62a8c3ba2b03d45f"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.loadReApplyWindows (cognitive 26): scan.loadReApplyWindows has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 9, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc90b1335c067c0722651d0a03ac6395f26ba16599b6ace89feed56f58ffb36"}},{"ruleId":"D2","level":"warning","message":{"text":"stats.computeAllStats (cognitive 26): stats.computeAllStats has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (14 pts), if/else 3 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7800ea49cd642a38819b5ff88b2969dd398e9553023690356c5b223ba440b90"}},{"ruleId":"D2","level":"warning","message":{"text":"careerviet.parseListingPage (cognitive 26): careerviet.parseListingPage has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4 (8 pts), boolean chains 2, error handling 1 (2 pts), loops 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":"providers/careerviet.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ff517c38605371243498a62e1d429773638c8c21af778705d568e754a1068f"}},{"ruleId":"D2","level":"warning","message":{"text":"oraclecloud.parseOracleResponse (cognitive 26): oraclecloud.parseOracleResponse has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 5 (9 pts), boolean chains 5, 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":"providers/oraclecloud.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3059ff12efdae2490828c049d87940badd305f4ae4371ee6fe1383558239adce"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduled-jobs-store.validateScheduledStore (cognitive 26): scheduled-jobs-store.validateScheduledStore has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, 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":"web/src/lib/scheduled-jobs-store.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1751f320a9243117fb47f3dce7c05ab5c4d5eadc8e982c3a95446136a237a7"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 26): route.POST has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10, ternaries 6 (8 pts), boolean chains 4, error handling 4 (nesting depth added 2). Of this number, 23 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c6cab40d282c5fa7dbbd97b7c227972d98267fdec4af9dc4b2acfde052573c"}},{"ruleId":"D2","level":"warning","message":{"text":"drive-action.executeAction (cognitive 26): drive-action.executeAction has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (10 pts), ternaries 4, error handling 1 (nesting depth added 1). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive-action.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8355303bbf847fbd367ba3b1ecc70be2fe33d822b75531adaf67db16bae5d56"}},{"ruleId":"D2","level":"warning","message":{"text":"personalization.coercePersonalization (cognitive 26): personalization.coercePersonalization has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/personalization.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eea91f78c26dbddfe3a014708a7a7bd7da4e8372bac77efc20b916bd29e45a"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.Update (cognitive 26): PipelineModel.Update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3665ac341b06d81335f5dac19caf9db184e5533a725450fec6a96cb38e73c4"}},{"ruleId":"D2","level":"warning","message":{"text":"requisitionIdsForDedup (cognitive 26): requisitionIdsForDedup has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 6 (9 pts), boolean chains 4, other 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e5c0a49cbf86d4889258f0709eb3455f29d5449f071ee0d8475797ddf65af5"}},{"ruleId":"D2","level":"warning","message":{"text":"matchJurisdiction (cognitive 26): matchJurisdiction has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), other 3, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cc1b5e7da2d2e1273bafe6c637808ab88dd57fc77538768647b3f66477c6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"runSelfTest (cognitive 26): runSelfTest has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 17, if/else 3 (5 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 3). Of this number, 23 points are the body\u0027s own statements and 3 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":"discover-ats.mjs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"4716856be15e6b3224308663e4739ad7c9035a17e5e7347335d2c9e0423a6a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"installLivenessRouteGuard (cognitive 26): installLivenessRouteGuard has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, ternaries 2 (6 pts), error handling 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 352). 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":"liveness-browser.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"df23796b8e38f7a2fea8b1aa8579a263bbf6ba25dd3bcee87e7a0b3c9fa93a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"joinConnections (cognitive 26): joinConnections has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 3 (4 pts), ternaries 3 (4 pts) (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 12 belong to 7 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":"linkedin-join.mjs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c07d1171d2f490141f6435521046f375788fe66e740d4d2de101b745f24f240"}},{"ruleId":"D2","level":"warning","message":{"text":"computeTrackerStats (cognitive 26): computeTrackerStats has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, ternaries 3, loops 1, other 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":"stats.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"beea714f6d65b33c6166989ac3fefaf5970997724e3356e253afea2c285f9759"}},{"ruleId":"D2","level":"warning","message":{"text":"detectChallenge (cognitive 26): detectChallenge has cognitive complexity 26 (threshold 15). Drivers by points: error handling 5 (12 pts), if/else 4 (9 pts), loops 3 (4 pts), other 1 (nesting depth added 13). Of this number, 25 points are the body\u0027s own statements and 1 belongs to 7 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":"scan-dayforce.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7634626782a383382a48ac576dd65199aefb836b0373d4c856f58fb05356c27"}},{"ruleId":"D2","level":"warning","message":{"text":"mentionsIn (cognitive 26): mentionsIn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 13, ternaries 6 (8 pts), loops 3 (5 pts), other 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"257c6a38c97be4635d52ed46c50c59071576346fff4a6cc5e3bc700f8ccd7603"}},{"ruleId":"D2","level":"warning","message":{"text":"computeClosingSoon (cognitive 26): computeClosingSoon has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 1, other 1 (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 2 belong to 6 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":"closing-soon.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c956196c5341d434b48cec8d83b0dd59caef1ebc8d3ed27a29b935765daa51f"}},{"ruleId":"D2","level":"warning","message":{"text":"languageVersions (cognitive 26): languageVersions has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 9, ternaries 6 (8 pts), if/else 4 (6 pts), other 2, loops 1 (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 7 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/recruitee.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f55cf9f6bad83ea2ee272da3f49149a97c9d6e19413f2724ffe21d717ce4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-templates.discoverIn (cognitive 25): cv-templates.discoverIn has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (5 pts), loops 3 (4 pts) (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4ccfcac186d4ef4457447353a36eedbf1e3d622901bebe7a2d1b51ca047840"}},{"ruleId":"D2","level":"warning","message":{"text":"ics-interview.firstEvent (cognitive 25): ics-interview.firstEvent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e32dfaa8d2a7646717d1a186df2186cbaf3d7a9656b8f9542453033c7f235c"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin-join.parseCsv (cognitive 25): linkedin-join.parseCsv has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0e7ad7c4ddfb44dc7ed8245f4b5e31128bcc65bacb1ce6c1e19eb8cd688788"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin-join.main (cognitive 25): linkedin-join.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 7 (8 pts), boolean chains 3 (nesting depth added 2). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"linkedin-join.mjs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d94d09900be04722565ebb22f94f3c69dcfda49bdbfca8897a1efec6904b99"}},{"ruleId":"D2","level":"warning","message":{"text":"negotiation-roi.analyze (cognitive 25): negotiation-roi.analyze has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 5 (10 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":"negotiation-roi.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a7757be8633645b8ad1590d8000f2f50359e92c7489fa6bcf0bd2947ef79ed"}},{"ruleId":"D2","level":"warning","message":{"text":"onboard-write.buildPortals (cognitive 25): onboard-write.buildPortals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 3, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"onboard-write.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b0af0557f7e7c2f53e6ae163048b9ddbd0529ac17384b6b642780b922afadf"}},{"ruleId":"D2","level":"warning","message":{"text":"_apify.fetchJson (cognitive 25): _apify.fetchJson has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (4 pts), boolean chains 2, error handling 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":"plugins/apify/_apify.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cba913ba19bb3664f2af5903ce60ada4e8d1eb79cc0d70e4ecf42853477dc32"}},{"ruleId":"D2","level":"warning","message":{"text":"_helpers.authResultsClauses (cognitive 25): _helpers.authResultsClauses has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/gmail/_helpers.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2358918427edfaa5e60d81559bfc4460fb18ac1482b69b794bea79bb6460af3e"}},{"ruleId":"D2","level":"warning","message":{"text":"adp-workforcenow.extractSalary (cognitive 25): adp-workforcenow.extractSalary has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 8, if/else 4 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37e6421c5cafd220fae83e126a974ce52f13e13e83edd48845faa27887af761"}},{"ruleId":"D2","level":"warning","message":{"text":"clearcompany.parseClearCompanyPage (cognitive 25): clearcompany.parseClearCompanyPage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 5 (7 pts), boolean chains 6, loops 1 (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/clearcompany.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb30998e9ee5b3d5b47aafb72f4dd9e1c25e7cf450a3bd0c793fd76dbfea7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"garena.parseGarenaResponse (cognitive 25): garena.parseGarenaResponse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), boolean chains 6, loops 1 (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/garena.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"48118ad766bdd05e8b11d72863783cba74eafedc20ece91eb89854496ef74603"}},{"ruleId":"D2","level":"warning","message":{"text":"reeval-candidates.printSummary (cognitive 25): reeval-candidates.printSummary has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (19 pts), loops 3 (4 pts), boolean chains 1, if/else 1 (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":"reeval-candidates.mjs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b91930012943c33aec58ac447207f7491fdb813f88a284072c6c2363026c8d"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 25): route.GET has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 7, if/else 6 (7 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 42, 62). 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":"web/src/app/api/portals/verify/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"318289ac8992141d06ab6754142b8ca5a9e1dfe088e2505d6b2729d2e3b68b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"section-card.BulletRow (cognitive 25): section-card.BulletRow has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, ternaries 5 (7 pts), if/else 4 (6 pts) (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 10 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":"web/src/components/cv-studio/section-card.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66737d2877d6f2e26974b2651cf34fcce541a9f236d6d4a2f19f7dca103e4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"first-score-view.FirstScoreView (cognitive 25): first-score-view.FirstScoreView has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), error handling 3 (4 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 65, a function literal at line 44, a function literal at line 53, \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":"web/src/components/explore/first-score-view.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b004906b1083565b1b97010d22ff88c92c3fadbee5a41616f93066e2a24b81f"}},{"ruleId":"D2","level":"warning","message":{"text":"cadence-settings.CadenceSettings (cognitive 25): cadence-settings.CadenceSettings has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 7 (8 pts), boolean chains 4, error handling 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (save, toggle, a function literal at line 38, \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":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea0e8c45fe52dba4fad686f80a7058432e986026501d8153604d4c1fc006f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"drive.driveSession (cognitive 25): drive.driveSession has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2a19d3babe9c51f4b5abecb5d40a0c77525be4841820b0423c8201f22ef18e"}},{"ruleId":"D2","level":"warning","message":{"text":"studio.resolveStudio (cognitive 25): studio.resolveStudio has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (8 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/studio.mjs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfe43ec5b1726628920364ce5937b9d1e7726b19ce48f1764afbd4667a1ac97"}},{"ruleId":"D2","level":"warning","message":{"text":"clauseBounds (cognitive 25): clauseBounds has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 3 (4 pts), other 4 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa63959d3f4f0b1d60579400a60c15b23712242c5a7b4958da8aa1ce3cb5307"}},{"ruleId":"D2","level":"warning","message":{"text":"buildStatusHistory (cognitive 25): buildStatusHistory has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (7 pts), boolean chains 5, loops 3, other 2 (nesting depth added 5). Of this number, 23 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":"tracker.mjs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b02c003dc2055991bf6372cbb0dccaf947737b8caea3318352511aa54b992c"}},{"ruleId":"D2","level":"warning","message":{"text":"acquireDirLock (cognitive 25): acquireDirLock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6, other 2, boolean chains 1, error handling 1, loops 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"827c9e88fc7c92f234c44ca3ccc311c3b1e92426db6b94ac1912dfa974e63016"}},{"ruleId":"D2","level":"warning","message":{"text":"acquireDirLock (cognitive 25): acquireDirLock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6, other 2, boolean chains 1, error handling 1, loops 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe70b0e49739ca1827722315399b03151b8f8b129cf71d725b48cf7eacd99cd"}},{"ruleId":"D2","level":"warning","message":{"text":"planExpiredHistoryRows (cognitive 25): planExpiredHistoryRows has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts), other 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":"liveness-core.mjs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"715dab2360a179971a5b0dec1c2c1e67e1d82732ed3f9cbbc284b81397362bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"addEntry (cognitive 25): addEntry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (9 pts), other 8, ternaries 2 (4 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad609404574736e27554fe9a011b0b3ac6e9b931f95a28f50fb00cd13ed85a9"}},{"ruleId":"D2","level":"warning","message":{"text":"computeReevalCandidates (cognitive 25): computeReevalCandidates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, ternaries 4 (6 pts), other 2, loops 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 5 belong to 11 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":"reeval-candidates.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5d74bada71186094aa70db918614ac3848b5f2b6efb0cecada30b6415ac618"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker-parse.scanMarkdownLinks (cognitive 24): tracker-parse.scanMarkdownLinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-parse.mjs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"80326259addee76f4ebbe6a043976d98b5eb0f493cc2341a2239d400a03f55c8"}},{"ruleId":"D2","level":"warning","message":{"text":"classify-tier.classifyTier (cognitive 24): classify-tier.classifyTier has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 8). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"classify-tier.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdc184e55c2f7d223516108e778ddea8ea9f113ab7e99d3a0b44246990b0854"}},{"ruleId":"D2","level":"warning","message":{"text":"funnel-velocity.parseStatusLog (cognitive 24): funnel-velocity.parseStatusLog has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c936120329270525752082626daee7d81f4936420a799c3f5eddbe7165f64bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"closing-soon.readDate (cognitive 24): closing-soon.readDate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 4 (7 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":"closing-soon.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b3168b906087fca482ee187addfa4422655c2541419e9c8cccde694cbfca5"}},{"ruleId":"D2","level":"warning","message":{"text":"discover-ats.dedupeAgainstPortals (cognitive 24): discover-ats.dedupeAgainstPortals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4096dcfe5ac0968831b38d9517fc996dfa37dbdde290b288ad66e1d2658f3b59"}},{"ruleId":"D2","level":"warning","message":{"text":"reserve-report-num.runCli (cognitive 24): reserve-report-num.runCli has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 4 (5 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db99ae235ff99c4f9816adfb9e4e293efc3e8cfa98697f9db974a210a12495e"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-cover-letter.buildRecipientBlock (cognitive 24): generate-cover-letter.buildRecipientBlock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 3 (5 pts), boolean chains 2, loops 2 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2035ac21ed116aa8691a6d507bc3812af0eb93606c76f0f28566f7dc416f9e7"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n-drift.formatReport (cognitive 24): i18n-drift.formatReport has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (8 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 14). 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":"i18n-drift.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01c0fcb95b62e9dc6795cb6d69daf6d57061c3cfe2ec912c8729abd10ba97b"}},{"ruleId":"D2","level":"warning","message":{"text":"echojobs.normalizeEchojobsJob (cognitive 24): echojobs.normalizeEchojobsJob has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, ternaries 4, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/echojobs.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac3e4e8137180201387f1be1b05b30ed18102703d9653d37c95bbcf82c30b1"}},{"ruleId":"D2","level":"warning","message":{"text":"thehub.fetchScope (cognitive 24): thehub.fetchScope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/thehub.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab84304690512fe63d7462313a34f67134a60b60df848c3315c19788d528bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.unsafeManifestPathReason (cognitive 24): update-system.unsafeManifestPathReason has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddecd4beccebc6d4364759fa16a392b655c17909a7a88e3ace41dda20186b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 24): route.POST has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (5 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c428f659d4091d5633ce6101f3ca573e20e44e576d3442e07d87d62e559c95"}},{"ruleId":"D2","level":"warning","message":{"text":"assistant-status-confirmation.StatusConfirmationCard (cognitive 24): assistant-status-confirmation.StatusConfirmationCard has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, ternaries 4 (8 pts), if/else 6 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-status-confirmation.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d43cdecc0498116e9397d725af31a8987efa2db7097ddd8d8d8af145eb513c"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-usage-scan.createUsageScanner.scan (cognitive 24): claude-usage-scan.createUsageScanner.scan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (6 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1fb0e7f88dfee8a09cc5d07dd6770f8d0533c19111fa0475ed3fc1f2bd3327"}},{"ruleId":"D2","level":"warning","message":{"text":"posting-url.markdownLinkTargets (cognitive 24): posting-url.markdownLinkTargets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/posting-url.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78b9c015f30a687f3a3b66291ed6e677335bd4fc41e2a7ac54b23c69d1baa7c"}},{"ruleId":"D2","level":"warning","message":{"text":"data.CanonicalizeArchetype (cognitive 24): data.CanonicalizeArchetype has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, 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":"dashboard/internal/data/stats.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5701b8df110b667237567e3b8c5c698e915a15ff4a0dab245029e0834e98e90f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 24): main.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 1 (nesting depth added 8). Of this number, 21 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":"dashboard/main.go"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"26427c852bf7cdecd3d8ae5c9d0652511659b5dbb2227fdcbbf0056177bbdc41"}},{"ruleId":"D2","level":"warning","message":{"text":"buildSalaryFilter (cognitive 24): buildSalaryFilter has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 9, other 4. Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1080, 1061, 1070, \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":"scan.mjs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56aa178fded57beb346a800ac1c04ec093b9a1cea9c3d847f2e26d674471ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"toolFragments (cognitive 24): toolFragments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 pts), boolean chains 5, other 2 (nesting depth added 9). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 849). 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":"verify-cv-facts.mjs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d1bccf78c56be714bb592e4cc3ab4225b9737301e59f340f0e5621f2de65ba"}},{"ruleId":"D2","level":"warning","message":{"text":"runHistorySeedScan (cognitive 24): runHistorySeedScan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 4 (5 pts), loops 2, boolean chains 1, other 1, ternaries 1 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 11 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":"scan-ats-full.mjs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5766fe28f83a269276e0456bb5a81a693508800d17e99836cdf53fbfe1cabc6"}},{"ruleId":"D2","level":"warning","message":{"text":"mapTrackerCaptureLinks (cognitive 24): mapTrackerCaptureLinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 2 (3 pts), error handling 1, other 1 (nesting depth added 9). Of this number, 23 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":"check-jd-archive.mjs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a06973bf33c08f12c5c70e12ee0411d022563f6a9c2164025671e6e4b383c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"lintPayload (cognitive 24): lintPayload has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 5 (7 pts), boolean chains 3 (nesting depth added 7). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 414, 410, 411, \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":"ats-payload.mjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f364503651d4a59023437f92c4ed50ca4c6ad6e394f43733e3a7c23adeedd027"}},{"ruleId":"D2","level":"warning","message":{"text":"seedFollowup (cognitive 24): seedFollowup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 3 (5 pts), other 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-seed.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"113ed0d97820bc1b3ff46e0c116fb2640f54cf63648bccc85e70d39a9d6bc9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"buildRow (cognitive 24): buildRow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, other 4, ternaries 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ad9e36aa028a2f7299c52625f6b5aade8f3ed409d6571de1e7dcd9d63168f8"}},{"ruleId":"D2","level":"warning","message":{"text":"application-answers.main (cognitive 23): application-answers.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"application-answers.mjs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"453ce8ac7e77424dc28048db468e554e4bc635efc235c9d8301a1998ec506302"}},{"ruleId":"D2","level":"warning","message":{"text":"archive-posting.main (cognitive 23): archive-posting.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 6). 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: 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":"archive-posting.mjs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e7d316085022e67f2c24ae995dec30726265d6e8cfe88030a1b7e5cd61b08b"}},{"ruleId":"D2","level":"warning","message":{"text":"_registry.validateRegistryEntry (cognitive 23): _registry.validateRegistryEntry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 10. 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":"plugins/_registry.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1e62602c321984e994a55252b4a0e1f421e6e3e00986a010782bc8944b8f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-years.mentionsIn::consider (cognitive 23): jd-years.mentionsIn::consider has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10, boolean chains 9, 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":"jd-years.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e80e017275b8291b09aef1788dcc7e34e32900fd23c7be97d7727ce2271e53"}},{"ruleId":"D2","level":"warning","message":{"text":"check-table-freshness.printSummary (cognitive 23): check-table-freshness.printSummary has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 4 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"79726eac018f93c610a797f18705120061845a8c373cd8a4ba64d47c730b2eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"process-quality.aggregateProcessQuality (cognitive 23): process-quality.aggregateProcessQuality has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"process-quality.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fc5f4d39ba7494d8a4ce1f126d54284151ff442863245c9614e363ee483c08"}},{"ruleId":"D2","level":"warning","message":{"text":"funnel-velocity.selfTest (cognitive 23): funnel-velocity.selfTest has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 16, loops 5, if/else 2. Of this number, 19 points are the body\u0027s own statements and 4 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":"funnel-velocity.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd42cca568ef46dc0a32abd8a4dbc7d65858290f46d2e28c67ad83608a58613"}},{"ruleId":"D2","level":"warning","message":{"text":"workable.parseWorkableWidget (cognitive 23): workable.parseWorkableWidget has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3cd1d7a395bee4f81bc908b9cb7d1c6daf0d863c3fee8eb1e83deb9748a25d"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-latex.validateLatexContent (cognitive 23): generate-latex.validateLatexContent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d767605e1bd08f7ed0110218ef203c82e4050795877cdb15cc30b5a897f79ef"}},{"ruleId":"D2","level":"warning","message":{"text":"hired-wall-build.main (cognitive 23): hired-wall-build.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-wall-build.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbf2f68a955eb780379abc918b553b7f41d7056c64631a507e67ada5ffa11bf"}},{"ruleId":"D2","level":"warning","message":{"text":"learn.apply (cognitive 23): learn.apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"learn.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbc73aca85a84b81c9703bf37d0ea0ef7cb9c1b0da17adb137c422cbb05f773"}},{"ruleId":"D2","level":"warning","message":{"text":"4dayweek.normalize4dwJob (cognitive 23): 4dayweek.normalize4dwJob has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 6, if/else 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/4dayweek.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee982f1aee1505f485d131f7edf2d371d970d7288fa5414278d1da5cdc83e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dassault.parseHits (cognitive 23): dassault.parseHits has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (9 pts), error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/dassault.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb75bbb0729be9123278d940cd5ea229a16edcc7599e2131ac91492171db95e"}},{"ruleId":"D2","level":"warning","message":{"text":"oraclecloud.resolveSite (cognitive 23): oraclecloud.resolveSite has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 6, if/else 3 (6 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/oraclecloud.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0056ab8cb58eb4d640b156dcef3d2db2ced7ebdad5a83a1e6769dbb32acb2538"}},{"ruleId":"D2","level":"warning","message":{"text":"remotli.normalizeRemotliJob (cognitive 23): remotli.normalizeRemotliJob has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 8, 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":"providers/remotli.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"459f79f4c8583d819e101b812f2fe6efb8e5ffb96dc2cf490a3abc6209a2f67d"}},{"ruleId":"D2","level":"warning","message":{"text":"telegram-channel.parseChannelPage (cognitive 23): telegram-channel.parseChannelPage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, ternaries 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":"providers/telegram-channel.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"10276a09b2fad2715e0e65b72c061f8f1740ae37bb2c7a1ac74264709d724084"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.loadConfiguredTemplateVariants (cognitive 23): update-system.loadConfiguredTemplateVariants has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 8, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eb1b016d3d6681ea05f6c80910bd1438929066847cdfc939f087a310d806bb"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.reconcileGitignore (cognitive 23): update-system.reconcileGitignore has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db0118d155ec6806987b18e44feabae0786791de38ad2fc33a581934fcf2693"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluation-options.selectedEvaluationInstructions (cognitive 23): evaluation-options.selectedEvaluationInstructions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-options.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbd1bbb5ae10cfd51f636176ef67ec897125b34cecb54da22d0551860cb9a9d"}},{"ruleId":"D2","level":"warning","message":{"text":"explore-ai.makeAiStreamParser.feed (cognitive 23): explore-ai.makeAiStreamParser.feed has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/explore-ai.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a451b84b2476e4aa90877e514e53464ef0d23955ec5d72d6614f0c8e3cc438"}},{"ruleId":"D2","level":"warning","message":{"text":"report.issueBody (cognitive 23): report.issueBody has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (16 pts), boolean chains 7 (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da19d155b5d753691c754f1081dd280d5bceacff1748d9797aa532ce2a17065"}},{"ruleId":"D2","level":"warning","message":{"text":"data.LoadPDFEntriesByPath (cognitive 23): data.LoadPDFEntriesByPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd56df546086a70dc8a507dcbd08874cb265f4c74cbb1d50efbd1612acfaacaf"}},{"ruleId":"D2","level":"warning","message":{"text":"data.LoadPDFManifest (cognitive 23): data.LoadPDFManifest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f16827dad275768be0a51ebece1335ccf7e52155bf446037a3f5e68c70e19a"}},{"ruleId":"D2","level":"warning","message":{"text":"data.runStatusWriter (cognitive 23): data.runStatusWriter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6 (nesting depth added 2). Of this number, 20 points are the body\u0027s own statements and 3 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":"dashboard/internal/data/status_writer.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"21480cfc710831c69f0bf0cf21547be317cbeb391bb3ceab130be1b64df18f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerModel.renderTableBlock (cognitive 23): ViewerModel.renderTableBlock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (9 pts) (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f760067db8362cfe3216105bc9057f3bc1fc7e9743b39914cb8c0f3d6fcf108a"}},{"ruleId":"D2","level":"warning","message":{"text":"rejectUserLayerPaths (cognitive 23): rejectUserLayerPaths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, error handling 1, loops 1, ternaries 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 6 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad088518fb07b10a53d82390d4a241dbe5c0b8715e51c8177a6aee0b80714e28"}},{"ruleId":"D2","level":"warning","message":{"text":"computeRelocationAdjustment (cognitive 23): computeRelocationAdjustment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, ternaries 2 (3 pts), other 2 (nesting depth added 2). Of this number, 20 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb1b7766db4bdf9172a78e0b4f75473384ff9ec1336836d5cc161296313d6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"collectTemplatePlaceholders (cognitive 23): collectTemplatePlaceholders has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 3 (6 pts), loops 3 (5 pts), boolean chains 2, other 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 4 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":"check-jd-archive.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6007931ad61ad818084b166effc6c8fb991e9678e510351f4600a828eab3cb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"findUnarchivedApplications (cognitive 23): findUnarchivedApplications has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (5 pts), boolean chains 3, other 3, loops 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c547ec8694ddf36ead4098573036cc9525c72d2abffff368f985e02a10ed03"}},{"ruleId":"D2","level":"warning","message":{"text":"renderTable (cognitive 23): renderTable has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 3 (6 pts), boolean chains 3, loops 3, other 2 (nesting depth added 6). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1072, 1101, 1096, \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":"tracker.mjs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccebc810bc6cc021240419636d0e7d8d8d61e4a68df4008d6db044bfef99fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"validatePayloadShape (cognitive 23): validatePayloadShape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 9, ternaries 1 (nesting depth added 4). Of this number, 19 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":"ats-payload.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda132676f47bed7cacb066394ac66eed8132b6b917fe12dba149c0d7854dda3"}},{"ruleId":"D2","level":"warning","message":{"text":"findUnclaimedEntries (cognitive 23): findUnclaimedEntries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, ternaries 3 (6 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":"audit-portals.mjs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d4098dd66abd22a9e70c3948e000d637e159cb397858e4478cdf2d0c55c6f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_http.readBodyCapped (cognitive 22): _http.readBodyCapped has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4a51a7d518acd098b617827de210e394f671bd0eec2ef6a7bdd2a28b218b85"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.scopeInflationClaims (cognitive 22): verify-cv-facts.scopeInflationClaims has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 11). Of this number, 17 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b3c35a883bc412ba77ff478e292c97521be2c6b1623ad50710d7a1b597e07b"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.parseAtsSlug (cognitive 22): verify-portals.parseAtsSlug has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (7 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1faeb6f778e26def45f4d4aab23cf06c9ee919aec19473a67109fb868bf3a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"invite-match.buildClarificationDraft (cognitive 22): invite-match.buildClarificationDraft has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), ternaries 3 (4 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":"invite-match.mjs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"51735342169b623e529f66bb8a2488e6a489e02f5a2c419152624afc303724a7"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.main::resolveEntries (cognitive 22): scan.main::resolveEntries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4222}}}],"partialFingerprints":{"codehealthFindingId/v1":"420262e50b59c990fa4f1223f1b4e0b7563a97190745615ac7ea2cd8c5fd8d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"detect-reposts.loadAggregatorCompanies (cognitive 22): detect-reposts.loadAggregatorCompanies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 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":"detect-reposts.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6500a32417e6a30649da64b1ff6b4a9928a5eda48fb90347125c25ebbcdcdc5c"}},{"ruleId":"D2","level":"warning","message":{"text":"company-history.loadStatusLogSource (cognitive 22): company-history.loadStatusLogSource has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edcb7e207fb0367aa24f3fc189fec29e862974c29c62aa3cfb329f34e958ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"contacts.parseContacts (cognitive 22): contacts.parseContacts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 3, 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":"contacts.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"92387798b3b3de9eb6331a7efff28f164082a49f2fc8a1b6a92c78b2899352eb"}},{"ruleId":"D2","level":"warning","message":{"text":"debrief-sync.applyDebriefSync (cognitive 22): debrief-sync.applyDebriefSync has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 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":"debrief-sync.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2b53e3a62ca013b3d137f7a5c66544ca0364b797110d6d05e17666d611e090"}},{"ruleId":"D2","level":"warning","message":{"text":"discover-ats.parseCompanyInput (cognitive 22): discover-ats.parseCompanyInput has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 11, ternaries 4 (9 pts), loops 2 (3 pts), error handling 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":"discover-ats.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ee6c74927f918ee444c0e7717440d05409612b2d3d1cb3fd7cc054ffccf8f"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n-drift.main (cognitive 22): i18n-drift.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"i18n-drift.mjs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6588a76b6ce9d196ba392effc3bb60be58455d902a0a7297e014a9d12d814277"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-audit.auditPlugin (cognitive 22): plugin-audit.auditPlugin has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin-audit.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e008fa6a8c5b44c9c0fed88589cba3a4227ae61501a97111d408089a4f614ede"}},{"ruleId":"D2","level":"warning","message":{"text":"beesite.parseSearchResult (cognitive 22): beesite.parseSearchResult has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 6, ternaries 4 (6 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/beesite.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cb8d3b5fd71d400bd0948a6bed633ed40258fec9931fab2399aa315f8e0d33"}},{"ruleId":"D2","level":"warning","message":{"text":"getonbrd.normalizeGetonbrdJob (cognitive 22): getonbrd.normalizeGetonbrdJob has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 3, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/getonbrd.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"050ed40e31eb2bce18a90af97943ac4357903b5d1d61909550a5701c72e118d5"}},{"ruleId":"D2","level":"warning","message":{"text":"homerun.parseHomerunFeed (cognitive 22): homerun.parseHomerunFeed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/homerun.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c0e81362205e5e29f94019a9b5c87b89bcccbae7af2a4682d63f5a0951e410"}},{"ruleId":"D2","level":"warning","message":{"text":"kalibrr.normalizeKalibrrJob (cognitive 22): kalibrr.normalizeKalibrrJob has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 3 (5 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/kalibrr.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8383433c1855060f2a165ae49d1a7f8aaef5d2106221c8f038fe0f31d462372"}},{"ruleId":"D2","level":"warning","message":{"text":"redrover.parseRedRoverResponse (cognitive 22): redrover.parseRedRoverResponse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, ternaries 1 (2 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":"providers/redrover.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecc4316fd1a50c6f5b588b39041183be06c24ab89645ba387aff09374426f66"}},{"ruleId":"D2","level":"warning","message":{"text":"taleo.parseTaleoResponse (cognitive 22): taleo.parseTaleoResponse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, ternaries 2 (4 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":"providers/taleo.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2f3647c4b4727480f5401f3700f0c47dbb1aa193262addedb60b906c25868e"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 22): cli.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 5, ternaries 2 (3 pts), error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaffolder/bin/cli.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e215dbcddcd46bf7528787265de89ddd7ae00676193656c6d226dd692c7a46"}},{"ruleId":"D2","level":"warning","message":{"text":"vc-portfolios.fetchYCCompanies (cognitive 22): vc-portfolios.fetchYCCompanies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"600efb91c05cd7398bba3c74741136177a18bbcebe2e9ace132290cdb5c5e8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.historyId (cognitive 22): tracker.historyId has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, ternaries 2 (3 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":"tracker.mjs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdf2c8711c77a11e9816330cd0e1e5d4dab5ecbc3931c4781beab99a5d40232"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-plugin-registry.validateRegistry (cognitive 22): validate-plugin-registry.validateRegistry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-plugin-registry.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd00407dcdf2c7ff5c20216eea8b36c854d61aaee7d4567ea44465d7ee7972cb"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-ats.runSelfTest (cognitive 22): verify-ats.runSelfTest has cognitive complexity 22 (threshold 15). Drivers by points: loops 15, boolean chains 3, if/else 3, ternaries 1. Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ad942e444e40c459221ffacb11321aa9944d09313d5698b9a672221ba02c38"}},{"ruleId":"D2","level":"warning","message":{"text":"triage-row.TriageRow (cognitive 22): triage-row.TriageRow has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 9 (16 pts), boolean chains 6 (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":"web/src/components/inbox/triage-row.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b4995759d8377804a6baee2d5844a3e2fb69d2f2e3adaa6f83b07016cb6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"mobile-nav.MobileNav (cognitive 22): mobile-nav.MobileNav has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 56, a function literal at line 166, onTouchMove, \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":"web/src/components/mobile-nav.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb896028f4998f5b5c61acf09a668b7456dceb562279c33e945da80cbdef124"}},{"ruleId":"D2","level":"warning","message":{"text":"weekly-digest.runSelfTest (cognitive 22): weekly-digest.runSelfTest has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, error handling 4, if/else 3, loops 1, ternaries 1. Of this number, 19 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":"weekly-digest.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db117b8b9a6e755ba552313abeac19d43792ec3395811bb446226cc95f2517f"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.handleDiscardPicker (cognitive 22): PipelineModel.handleDiscardPicker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3498139c5ae078fc4ea535c68bf0631615212dcace6f2180e623cc7301999d"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.renderBodyWindow (cognitive 22): PipelineModel.renderBodyWindow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (nesting depth added 9). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e4776a3553a00c267c2cd3e0c6bf5e2bab162296f07e148a2ab837801077f"}},{"ruleId":"D2","level":"warning","message":{"text":"parseBlacklist (cognitive 22): parseBlacklist has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, ternaries 3 (6 pts), loops 1, other 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":"scan.mjs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"615bbb7e5ab0c289c01285b45d6993df6d1e75629bfd6ae575454018632fddfd"}},{"ruleId":"D2","level":"warning","message":{"text":"unminedHints (cognitive 22): unminedHints has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts), boolean chains 3, other 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ebb2c522f4e221ae26e505ebabacee1dae3c4f1c1c7b4bf8d6f751572517ad"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 22): (anonymous) has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 4 (9 pts), boolean chains 1, ternaries 1 (nesting depth added 9). Of this number, 20 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":"upskill.mjs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d07593d20d515838436af925e661bf2ace5d5bb4aca620cf96cbfeee78032b"}},{"ruleId":"D2","level":"warning","message":{"text":"loadFreeModels (cognitive 22): loadFreeModels has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4 (8 pts), boolean chains 2, other 2, error handling 1 (nesting depth added 6). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 153, a function literal at line 138, priorityOf, \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":"openrouter-runner.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb569da6bf99d6e017f0decbdadcfa8eee2e3ae0648dc86aaf46125af00077a"}},{"ruleId":"D2","level":"warning","message":{"text":"parseSessionFile (cognitive 22): parseSessionFile has cognitive complexity 22 (threshold 15). Drivers by points: other 7, if/else 4 (6 pts), boolean chains 4, loops 2 (3 pts), error handling 1, ternaries 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":"weekly-digest.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfc1f04ee2ff0f09fb5e517a370184ad6a931bda555c2b8026772f68881045b"}},{"ruleId":"D2","level":"warning","message":{"text":"extractRows (cognitive 22): extractRows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 7 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":"check-table-freshness.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f18b29378fa6b0c9e68526ba8a88f470254e37d76add36366ca78c5d43028fa"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-rescue.main (cognitive 21): jd-rescue.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 3 (4 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/jd-rescue.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"554d700d5bf26174b01599d4259da705d97c21dccbae2759076b376d3de26e21"}},{"ruleId":"D2","level":"warning","message":{"text":"history-ats-seeds.atsBoardUrlOf (cognitive 21): history-ats-seeds.atsBoardUrlOf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"history-ats-seeds.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"356e38dbd87de9cec139bdfdd6da1fbce2e45805d523cb28036c5adcc1be2d17"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-templates.auditUserTemplates (cognitive 21): cv-templates.auditUserTemplates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 1 (4 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e77f4f68d58244c321b597c7cf7292cb1cd67f83bf494bde74de35adf1af363"}},{"ruleId":"D2","level":"warning","message":{"text":"workday.chooseSplitFacet (cognitive 21): workday.chooseSplitFacet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (nesting depth added 6). Of this number, 19 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":"providers/workday.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff3a3a22a7d2dda132fe0cb7d632bb369b1c49e04514acbb9aa9776436c5eb"}},{"ruleId":"D2","level":"warning","message":{"text":"reply-matcher.getAppDomains (cognitive 21): reply-matcher.getAppDomains has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a7ffaf00602d9978e427f99135df5d88962e7c9a7655a02fc2aabf13710357"}},{"ruleId":"D2","level":"warning","message":{"text":"contact-extract.appendContact (cognitive 21): contact-extract.appendContact has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 155, 171, 166, \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":"contact-extract.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1559dda6df0601da09d1c24e3990b9da8f33ece535b3fc813c614b6d76731d20"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-cover-letter.main (cognitive 21): generate-cover-letter.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 6, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d029a60ebbf7ef3c9b51684872a968ec07150990266867bc69f50e7d3dfad0bf"}},{"ruleId":"D2","level":"warning","message":{"text":"github-evidence.runCli (cognitive 21): github-evidence.runCli has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 3, error handling 2, boolean chains 1 (nesting depth added 3). Of this number, 20 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":"github-evidence.mjs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"af43037b66247b1089387a419f6f6d3c3f96fb22c7c52ce6c9eaab5b84bf76de"}},{"ruleId":"D2","level":"warning","message":{"text":"merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch (cognitive 21): merge-tracker.mergeTracker::mergeUnderLock::fuzzyTierMatch has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (9 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":"merge-tracker.mjs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2db5cd102ecdbc276ab49c1550e22918a13d558358a23fff3cd04f7211ba7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"install-h1b-index.installIndex (cognitive 21): install-h1b-index.installIndex has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 7, error handling 3, if/else 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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"be451bbb4ea053c1ea0ee46ce1722aeee15fd9f136733550027ae3f38cc516c9"}},{"ruleId":"D2","level":"warning","message":{"text":"neogov.parseNeogovPage (cognitive 21): neogov.parseNeogovPage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/neogov.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e180d045926584404808b8d8efc47214ab2e4a2aeac8b9c12732c6ad2cc96be5"}},{"ruleId":"D2","level":"warning","message":{"text":"peoplesoft.requestWithSession (cognitive 21): peoplesoft.requestWithSession has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 3 (6 pts), boolean chains 3, error handling 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":"providers/peoplesoft.mjs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc1d4edbadc71d11537fe4e6949e8b6e9bdfffffae63d3600b8fd5c9be216ce"}},{"ruleId":"D2","level":"warning","message":{"text":"torre.normalizeTorreOpportunity (cognitive 21): torre.normalizeTorreOpportunity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, ternaries 3 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 2 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":"providers/torre.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6efd313ada21b4698f7a975fa8406bcdd024f9b55698e713167c86e3139fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.localUserPaths (cognitive 21): update-system.localUserPaths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (2 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":"update-system.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0671487093a45545d593de263f55f9520ec6cd05eb97f9a4a9aa4de66bde6d"}},{"ruleId":"D2","level":"warning","message":{"text":"route.writeStatus (cognitive 21): route.writeStatus has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 7 (8 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":"web/src/app/api/status/route.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"867567b214b858245e520189e0867073efc3f9860cd62b79004bbed34a4fcfde"}},{"ruleId":"D2","level":"warning","message":{"text":"config-form.ConfigForm (cognitive 21): config-form.ConfigForm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 4, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 48, 89, 72, \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":"web/src/components/config-form.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7fce6924839aec9d16f7064dc5681c33a5ddbc5d157e7f57e628d6be0922e3"}},{"ruleId":"D2","level":"warning","message":{"text":"portals-config.setListInText (cognitive 21): portals-config.setListInText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 3 (4 pts), ternaries 2 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/portals-config.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0755058bb647903acba9106ef540c8abdda285a2e9e3eda99bfa0611b69bb3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker-table.parseApplications (cognitive 21): tracker-table.parseApplications has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/tracker-table.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bc142e15f78c0ad02eb6f499df3870f34b8e4b1b257925f60bb2ba0b62a97e"}},{"ruleId":"D2","level":"warning","message":{"text":"buildContentFilter (cognitive 21): buildContentFilter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 854, 864, 839, \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":"scan.mjs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c701eda78c45d9f51af82014c45e9013c609791c5a6aa23b6c4b69bcbdcae8"}},{"ruleId":"D2","level":"warning","message":{"text":"rawTextRanges (cognitive 21): rawTextRanges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6305a955dbd9fef8b6a013e2adb1e0a243aa54a8217b1c70cc9931714542377"}},{"ruleId":"D2","level":"warning","message":{"text":"syncIndex (cognitive 21): syncIndex has cognitive complexity 21 (threshold 15). Drivers by points: other 8, loops 4 (5 pts), ternaries 3 (5 pts), if/else 1 (2 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":"tracker.mjs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473b848e3e48dd7ca3d929aa2ac83438fc5632b48a5f674c3e1b11b4a62ebc2"}},{"ruleId":"D2","level":"warning","message":{"text":"computeRunStats (cognitive 21): computeRunStats has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 5 (8 pts), boolean chains 2, loops 1, other 1 (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 2 belong to 9 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":"stats.mjs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"264c7705ac26dc1ce2ad0bf1a033cd8996ac86509a59ace1fe57b3074f5a09f3"}},{"ruleId":"D2","level":"warning","message":{"text":"makeGuardedFetch (cognitive 21): makeGuardedFetch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 9). None of this is in the body itself: all 21 points belong to 6 function items inside it that branch (guardedFetch, hostOk, isLoopbackHost, \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":"plugins/_engine.mjs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e422ce00ae20c08a79b365eb6455e8dda3ec05ccfd28e1f9a1c2770fe24c7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"hiredRows (cognitive 21): hiredRows has cognitive complexity 21 (threshold 15). Drivers by points: other 8, ternaries 3 (6 pts), if/else 2 (4 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":"hired-share.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a8f9ff6417d0ee285c9aac356ae6c06403ba75bf9207f1b14085a13e683ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"liveness-core.classifyLiveness (cognitive 20): liveness-core.classifyLiveness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 4, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-core.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec55652fdd5843c5a54b2e7f6ed7855d5d689f53c0e65872fb8ddd2e411fea5"}},{"ruleId":"D2","level":"warning","message":{"text":"assessment-log.main (cognitive 20): assessment-log.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 4 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, 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":"assessment-log.mjs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62bf0b3d3f3e71a46500810de8dc7d2438b5b9a1832a1abc36beea5f070cd67"}},{"ruleId":"D2","level":"warning","message":{"text":"audit-portals.auditCompanies::worker (cognitive 20): audit-portals.auditCompanies::worker has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 2 (4 pts), ternaries 2 (4 pts), error handling 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6125930fc919a31d445ecc0be880f17f4b4dc4bcc4bab3eada60c8f2c4ad31e5"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-pdf.extractSectionBlocks (cognitive 20): generate-pdf.extractSectionBlocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0bb040378afeeea781f94acabf7ebedbf92ae0aaa2f737bee0643965d5547"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.verifyOne (cognitive 20): verify-portals.verifyOne has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"758f1a58df60f0306d7231c57160e079f137df00135772a30b5ee560b5dd1155"}},{"ruleId":"D2","level":"warning","message":{"text":"company-history.runSelfTest (cognitive 20): company-history.runSelfTest has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 2, loops 1, ternaries 1. Of this number, 17 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":"company-history.mjs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dfbbb5ed09dfee62bf2182ee9cf67247a0ec67a6c71ce21165c718df2e0c42"}},{"ruleId":"D2","level":"warning","message":{"text":"parse-gojobs-html.inputFiles (cognitive 20): parse-gojobs-html.inputFiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/recipes/gojobs/parse-gojobs-html.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda63c28ba2675e8742c781c92bf84df2a680e80c794a31f519aef815b2536ff"}},{"ruleId":"D2","level":"warning","message":{"text":"latex-content.extractMacroBodies (cognitive 20): latex-content.extractMacroBodies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/latex-content.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c27f08fc8ebd3c27f5236aec01550756cad81fdf0f9bc7df838e78e2686dd5"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n-drift.compareStructure (cognitive 20): i18n-drift.compareStructure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (9 pts), boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"i18n-drift.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c28d8fad5057f56f87ebd6d8e6b82774a9e334df335874f8e0f295178bc37c"}},{"ruleId":"D2","level":"warning","message":{"text":"a16z-speedrun-talent.normalizeSpeedrunJob (cognitive 20): a16z-speedrun-talent.normalizeSpeedrunJob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6 (7 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f540fa4e69a909b3c4c6246147314de30ae9191802f71cecf0aa41dab6a6678"}},{"ruleId":"D2","level":"warning","message":{"text":"icims.pickLocation (cognitive 20): icims.pickLocation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f049d933c2ad26b985cf326a1c43a333d4eff86f584cf32ffb0e5ca2fa6a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"itviec.parseListingPage (cognitive 20): itviec.parseListingPage has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). 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":"providers/itviec.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"10467b631611b3d34c88c644439ca89370f8a58febb41b90e7997b60246cd12a"}},{"ruleId":"D2","level":"warning","message":{"text":"jazzhr.parseJazzHRList (cognitive 20): jazzhr.parseJazzHRList has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 2 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jazzhr.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa119ca8f90705e3c45d1bf52ebdb019f0cc41064ef39b1fc8d3aa11e7a87b"}},{"ruleId":"D2","level":"warning","message":{"text":"landingjobs.normalizeLandingJob (cognitive 20): landingjobs.normalizeLandingJob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6, boolean chains 5, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/landingjobs.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff93ae4d2191a59377badc2730261e9003a8d7da2c8ed42f042816230cf93a0"}},{"ruleId":"D2","level":"warning","message":{"text":"personio.addLanguageVersions (cognitive 20): personio.addLanguageVersions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts), ternaries 2 (nesting depth added 7). Of this number, 15 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":"providers/personio.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"024ad58f666307b64424774336f6986891dfe753954d3644e5477210d887791d"}},{"ruleId":"D2","level":"warning","message":{"text":"softgarden.parseWidget (cognitive 20): softgarden.parseWidget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/softgarden.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bc793c6f56f218f4f00959fa5457e0e3ed029832d3916691257e744a3a28a8"}},{"ruleId":"D2","level":"warning","message":{"text":"upskill.analyze (cognitive 20): upskill.analyze has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). 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":"upskill.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e16ceda62e571432b040508ba9fa97f2a1e740f4f62220039c027d8653fc6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduled-jobs-runner.executeJob (cognitive 20): scheduled-jobs-runner.executeJob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (6 pts), error handling 2 (5 pts), ternaries 2 (5 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":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"48122fa44b58010c2d683753019fc8e80cf14afdf9e19d6566c111116ce9aecf"}},{"ruleId":"D2","level":"warning","message":{"text":"page.ApplyPage (cognitive 20): page.ApplyPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 7, error handling 2 (3 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8344b033ada85fbbe7e89e7d83b17a4ecfe23952a397d2bfa5749b5b47ceded"}},{"ruleId":"D2","level":"warning","message":{"text":"worker-card.WorkerCard (cognitive 20): worker-card.WorkerCard has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, ternaries 9 (10 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/worker-card.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0d19a16017ef3e6b66cfefe012af9d0d861c524273cae9ec9a7f8983d8eaf5"}},{"ruleId":"D2","level":"warning","message":{"text":"edit-job-modal.EditJobModal (cognitive 20): edit-job-modal.EditJobModal has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, ternaries 4 (6 pts), if/else 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 31, handleSubmit). 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":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8592e975a10ade72ee3718d5de7fd8586dbde01a753984b10f6938f41e9d66"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-interpret.interpretFormWithAgent (cognitive 20): agent-interpret.interpretFormWithAgent has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), ternaries 3, error handling 1, loops 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 162, 175, 179, \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":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d23d8d8d1d0f1aa6b4d5fd57fc022ed0117412b2535894413396c45db5fac20"}},{"ruleId":"D2","level":"warning","message":{"text":"report-tables.pipeCells (cognitive 20): report-tables.pipeCells has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-tables.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4458dcb050846a50cceb650328a32c086924e396fbbfb274549225022405f86"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.overlayDiscardPicker (cognitive 20): PipelineModel.overlayDiscardPicker has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"86723f8066e0946551307035f8152260d0cc493ce24dfac1ae3b915e44e12d34"}},{"ruleId":"D2","level":"warning","message":{"text":"buildNoResponseFrictionSignals (cognitive 20): buildNoResponseFrictionSignals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (8 pts), other 2, boolean chains 1, loops 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 3 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a1655db428f098504aed1d731e6b3729eeba176bf817c65c6654cd390acca8"}},{"ruleId":"D2","level":"warning","message":{"text":"cmdEvaluate (cognitive 20): cmdEvaluate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 4 (5 pts), ternaries 3, loops 1 (2 pts), boolean chains 1, 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":"openrouter-runner.mjs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f277ef3bbc80f69b2adb14d56aefb4e7d785bf78b95d440ce42f5c93c20bd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"parseLegacyResults (cognitive 20): parseLegacyResults has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 pts), error handling 1 (2 pts), boolean chains 1, loops 1, other 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":"providers/radancy.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5378bad5e165803d3bf70a155d13ce15caeac6118169fd86b84641e3b0e8bb67"}},{"ruleId":"D2","level":"warning","message":{"text":"diffAgainstBaseline (cognitive 20): diffAgainstBaseline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cc27cb9a587ea236eed709beb7506bb556edd946be2fd0e6cef71969fdbd8d"}},{"ruleId":"D2","level":"warning","message":{"text":"gcStaleReportReservations (cognitive 20): gcStaleReportReservations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, error handling 1 (2 pts), loops 1, other 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":"reserve-report-num.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee728595149282782fbbe5f8dadc66f02aaa3e576b0763ad2164eaa3498b5b37"}},{"ruleId":"D2","level":"warning","message":{"text":"atsFromUrl (cognitive 20): atsFromUrl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 1 belongs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d738c74b91463ed941d79ba0fd2dd94ce3e897c3aad17bb80e7793e13b5aa36"}},{"ruleId":"D2","level":"warning","message":{"text":"add-entry.main (cognitive 19): add-entry.main has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), error handling 3 (4 pts), ternaries 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"add-entry.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ac239003fdc7b9b2e81112799b3d72871778e73876feedbe2c427ff82563dd"}},{"ruleId":"D2","level":"warning","message":{"text":"funnel-stages.parseStatusLogStages (cognitive 19): funnel-stages.parseStatusLogStages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 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":"funnel-stages.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cbfc92e8e9cd6daf91ccab2a0200041dbf944f3a21f345fe6d887991d6ad0d"}},{"ruleId":"D2","level":"warning","message":{"text":"url-key.normalizeUrl (cognitive 19): url-key.normalizeUrl has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (6 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 5). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"672c059821dc3d31dce73ea6e0a329adf607fd92c916aac26c4556ccecdf630e"}},{"ruleId":"D2","level":"warning","message":{"text":"token-tracker.estimateCost (cognitive 19): token-tracker.estimateCost has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 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":"utils/token-tracker.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0032773803f88968f64f7e152c1f2868eaaa978e7b34e1669f2b21c61b35bf1f"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-pdf.reorderCvSections (cognitive 19): generate-pdf.reorderCvSections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3, boolean chains 2 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7363cd0bf2cfdf4c4246e722983a793a6fbe84dad8ffdc5d15c8e132df0dec07"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.main (cognitive 19): build-cv-html.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, ternaries 4 (5 pts), loops 2 (3 pts), boolean chains 2, error handling 2 (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":"build-cv-html.mjs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ed13b59550433ab5d822e46278305196ba5ac1c4a1fa0cb5c631a693c75b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-id-cache.openProviderIdCache.save (cognitive 19): provider-id-cache.openProviderIdCache.save has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), error handling 1 (2 pts) (nesting depth added 10). Of this number, 13 points are the body\u0027s own statements and 6 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":"provider-id-cache.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b904d28cd4521b38d78da1346b0310cf6bc323ffd03b5172df6b34feba9a0108"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.buildLocationFilter (cognitive 19): scan.buildLocationFilter has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8, ternaries 1. Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 622, 630). 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":"scan.mjs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d98ee74219bea446022be4d118e80d19ae53a45e7b5d34e04b6d0141e8e7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"workable.parseWorkableMarkdown (cognitive 19): workable.parseWorkableMarkdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, 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":"providers/workable.mjs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0062e40f4d7444d20f08fccf0a75b520a76cb5385b17b4eb6016214412251e95"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-entrypoints.ensureSkillEntrypoints (cognitive 19): skill-entrypoints.ensureSkillEntrypoints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (7 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaffolder/bin/skill-entrypoints.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbfbc06cece6ea36c3b0455e55d162da39cdb28bf7d0621613a8a66eb6f9774"}},{"ruleId":"D2","level":"warning","message":{"text":"reserve-report-num.reserveReportNumbers (cognitive 19): reserve-report-num.reserveReportNumbers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b6aeb62de08a0faef2f412b17b2ab0e895379aefe3387337e3c51740fd59fe"}},{"ruleId":"D2","level":"warning","message":{"text":"keyword-match.resolveKeywords (cognitive 19): keyword-match.resolveKeywords has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e2a42affbb9b40dfabbb8d98db2e92352f8f69e2ab5731759dc339b245e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin-join.renderTsv (cognitive 19): linkedin-join.renderTsv 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). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"96639e4ae995ec66bcabf1b3433948b705e395a5a2848cf975ceca413a98c670"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize-statuses.normalizeStatus (cognitive 19): normalize-statuses.normalizeStatus has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"normalize-statuses.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a944363d604f8cdf67ca9a3c7435b999dd64322bcb9ce4b0447975e56687709"}},{"ruleId":"D2","level":"warning","message":{"text":"api.fetchWithTimeout (cognitive 19): api.fetchWithTimeout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddf52d2e2170708f70ca2c8bef8b94401fe2e7980df67c7513d4bb9bdce1cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"tier.classifyTier (cognitive 19): tier.classifyTier has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 6, ternaries 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":"plugins/h1b-sponsor/lib/tier.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd69aed6499fa09b02d624c7a1822068588996d771d1303c390c575ebdf4af72"}},{"ruleId":"D2","level":"warning","message":{"text":"token.mintToken (cognitive 19): token.mintToken has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 5, boolean chains 4, 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":"plugins/h1b-sponsor/token.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"95400be3ee489ad4faa1e4dccc2c5d59a1b565bd329961226633ee6a30192ced"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin.parseListPage (cognitive 19): builtin.parseListPage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d5f8fce39f3abeb98433d32625d6c721c3248aec05eca7a18b5ee810b3e13a"}},{"ruleId":"D2","level":"warning","message":{"text":"comeet.parseComeetResponse (cognitive 19): comeet.parseComeetResponse has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, ternaries 6, if/else 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 118, 152). 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":"providers/comeet.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bbe2b52842be26b06081697a526650c13f8ff812a99641579acd08ff66e8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"computrabajo.parseCards (cognitive 19): computrabajo.parseCards has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/computrabajo.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a97c3809b38acd65bf54c3db0b9febb025dbb488875fde4f1b6382590570a90"}},{"ruleId":"D2","level":"warning","message":{"text":"rheinmetall.parseVacancies (cognitive 19): rheinmetall.parseVacancies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rheinmetall.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7759af61800f354903534acd15a0bd8a9704e94f7cab8dfe3732bbae04c5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"thehub.normalizeHubJob (cognitive 19): thehub.normalizeHubJob has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 5, if/else 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":"providers/thehub.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa89ef07a5e357dfd9addd4dbadd790d577469bcc205137b836af4a82405e921"}},{"ruleId":"D2","level":"warning","message":{"text":"yourator.resolveYouratorUrl (cognitive 19): yourator.resolveYouratorUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (3 pts), loops 1 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/yourator.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb2d76bfb329e9c68c7ab9aeaf08645caf28123b118111fcdcc4b5189b8bf40"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-batch-input.isPrivateOrInternalHostname (cognitive 19): sync-batch-input.isPrivateOrInternalHostname has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. 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":"sync-batch-input.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3232b4e408b2cda7b915d4cc09bd04a21657e773eee5f199b538c66070cd63a7"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 19): route.POST has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (5 pts), boolean chains 3, error handling 3 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, 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":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbec5ca4d0dc497a3c25620d097787d3a58a3bce3351a9d16b983ff27b1319a3"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 19): route.POST has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 70). 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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c69c0b7e1e39b26a3b9cb2db78cf87c37047fca5c7bc108e66efb1aae6b034"}},{"ruleId":"D2","level":"warning","message":{"text":"session.enrichFromAts (cognitive 19): session.enrichFromAts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, 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":"web/src/lib/apply/session.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fdb9277aa31a0b1111ac8297340e8b7cd8404724096e8683e8b19157c3e383"}},{"ruleId":"D2","level":"warning","message":{"text":"url-key.normalizeUrl (cognitive 19): url-key.normalizeUrl has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (6 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 5). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/url-key.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0d0d1956111c17ee5fd724fb78c5b513956f729d8480e68852e9c891941a4c"}},{"ruleId":"D2","level":"warning","message":{"text":"job-stream.readJobStream::consume (cognitive 19): job-stream.readJobStream::consume has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 6, boolean chains 4, 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":"web/src/lib/job-stream.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1f455656e7d4a2d087d44b08c175a6b04979047f1a0891ae3418d855cac2d9"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-table.parseInbox (cognitive 19): pipeline-table.parseInbox has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-table.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6889fa1cd5b4cd92d5b59b73ad4d04b1c403c41e4cab685dc433439ff851ead2"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.renderAppLine (cognitive 19): PipelineModel.renderAppLine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2c74d5bfe82736b6ab5974b44006fb4b4fd409ff4f5e0cefa33e12b3bd742a"}},{"ruleId":"D2","level":"warning","message":{"text":"redirectToMainCheckout (cognitive 19): redirectToMainCheckout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, 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":"update-system.mjs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e19d44156b183fd3661eab6f9110fae199ff9e29d067c1a0a6742d56b0c5372"}},{"ruleId":"D2","level":"warning","message":{"text":"buildTitleFilterOverrides (cognitive 19): buildTitleFilterOverrides has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1344e967917c2efe908dfdcf5c28d784a5df1215e648a0e8c1bba80eb7e2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"parseCompanyInput::add (cognitive 19): parseCompanyInput::add has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, 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":"discover-ats.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35225a0fe5f61b5edf842d96d329a2c236f74b760a7b96c52f02e16fd57e7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"detectReposts (cognitive 19): detectReposts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, loops 2, ternaries 2 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"detect-reposts.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d7f332b36b163cda0299ae2e5c3a2a7456cec5fed00e291e048313d103f208"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchInContext (cognitive 19): fetchInContext has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 5, if/else 4 (5 pts), ternaries 3 (4 pts), error handling 2 (3 pts), other 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":"providers/_http.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a4a6ea774393663a200b9693fa9a9578ef2510d87c9e4aeefcae1efc800568"}},{"ruleId":"D2","level":"warning","message":{"text":"validateEvaluationShape (cognitive 19): validateEvaluationShape has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts), other 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":"gemini-eval.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11105cfdaafcd75fd1857b74dcb41308bae1e8c26711c6f99a84303704761db"}},{"ruleId":"D2","level":"warning","message":{"text":"findStaleScanQueries (cognitive 19): findStaleScanQueries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (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":"audit-portals.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f96be9b84a66216656e9c712da652b8a86c9f4ab14811615e99d20afae485b"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 19): fetch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 3, 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":"providers/personio.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b000a88d826d61f71bf38a32d6b3ebf739eb62a4bab8194c14179d1da2d21b"}},{"ruleId":"D2","level":"warning","message":{"text":"applyClosures (cognitive 19): applyClosures has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (5 pts), loops 2 (3 pts), boolean chains 1, other 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":"close-stale.mjs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f4906fb6650bf7ce5aee5330f4b75c09c29d9c5d33f6cd7dbd91c3692c249"}},{"ruleId":"D2","level":"warning","message":{"text":"parseGrokEvent (cognitive 19): parseGrokEvent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 2 (4 pts), error handling 1, other 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":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"611135659680b80c911063bd8cd2c1a07d1cbd1b3d94535268cb3b5e7e2ca3ea"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-patterns.buildRoleFamilyInterviewRate (cognitive 18): analyze-patterns.buildRoleFamilyInterviewRate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 5 (6 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 6 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":"analyze-patterns.mjs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b73dadf5f55631aefc8f407a4025073e9ffd10524426caac204e14eb914386"}},{"ruleId":"D2","level":"warning","message":{"text":"check-jd-archive.classifyReportsByTrackerState (cognitive 18): check-jd-archive.classifyReportsByTrackerState has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 2, 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":"check-jd-archive.mjs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5230aaa77b4b56b8ef882bdbab1fec1e4d2519d92550e6438781a19c7949760"}},{"ruleId":"D2","level":"warning","message":{"text":"_http.withRetry (cognitive 18): _http.withRetry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"137ad7418cc24ac7baeeab5c89acf8b6414e4762df89100f12e97b8cc015101f"}},{"ruleId":"D2","level":"warning","message":{"text":"_net.resolveAndValidate (cognitive 18): _net.resolveAndValidate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, 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":"plugins/_net.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc0b89e2d280f6638bcddfa755d44bb966a03982c13bb7075fa67b76275f67"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.buildExperience (cognitive 18): build-cv-html.buildExperience has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (7 pts), if/else 2 (nesting depth added 3). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 474, 450). 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":"build-cv-html.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2301adc90cf5490bd6b53e195011be520a880455f24bd3ee3b5cbb85247660"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.buildEducation (cognitive 18): build-cv-html.buildEducation has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, ternaries 3 (6 pts), if/else 2 (nesting depth added 3). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 585, 565). 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":"build-cv-html.mjs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bbfc941ef644fbcfa9a5c0852e4e903292a78acb67a25fbb34a9e24c60cf42"}},{"ruleId":"D2","level":"warning","message":{"text":"calibrate.loadLedgerReached (cognitive 18): calibrate.loadLedgerReached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"calibrate.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9519eca56751bfca07d28af6a6610e0c333a75afce09985e996a21a90c692dc"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.runUnmined (cognitive 18): verify-portals.runUnmined has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (7 pts), boolean chains 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":"verify-portals.mjs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb809cf20072584ce9d402fae450cd71304dcd8edd0183b6502bfde4283c41b5"}},{"ruleId":"D2","level":"warning","message":{"text":"listing-fingerprint.validateListingFingerprint (cognitive 18): listing-fingerprint.validateListingFingerprint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 4). Of this number, 15 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":"listing-fingerprint.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"267329d030c852e0feaabbdf55bf2be51f669e3d762860fb195600204cf60ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"check-table-freshness.runSelfTest (cognitive 18): check-table-freshness.runSelfTest has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 3 (4 pts), error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 6 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":"check-table-freshness.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d48f1dfc035898984e0ab70eccbf6f84e20d84e74180a5042e3a6f5bbcceb5"}},{"ruleId":"D2","level":"warning","message":{"text":"reply-matcher.checkRoleMatch (cognitive 18): reply-matcher.checkRoleMatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, 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":"reply-matcher.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dec78673953e12392d09181f744e0e5aad83f1c577d969bd0fbf57127f6c17"}},{"ruleId":"D2","level":"warning","message":{"text":"rippling.parseRipplingPage (cognitive 18): rippling.parseRipplingPage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 5 (6 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 133, 154). 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":"providers/rippling.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6616ebef63b6f159ea6919d589b12979d74c45bce38c6526cd5fa53862257a47"}},{"ruleId":"D2","level":"warning","message":{"text":"check.main (cognitive 18): check.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/check.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acdc1d12c5c56f45ca7111982eacc1549071ea69615bc7cef11f6ff546b2815"}},{"ruleId":"D2","level":"warning","message":{"text":"applitrack.parseApplitrackOutput (cognitive 18): applitrack.parseApplitrackOutput has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applitrack.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c32006755f58475354d00ae16499d396bfb4f271a62483c6e802314c8dbf3b"}},{"ruleId":"D2","level":"warning","message":{"text":"arbeitnow.normalizeArbeitnowJob (cognitive 18): arbeitnow.normalizeArbeitnowJob has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 5, boolean chains 4, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/arbeitnow.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c7f1bb0511093022b58055cca9607700361134ca057761ea65fc8842f279f8"}},{"ruleId":"D2","level":"warning","message":{"text":"feishu-jobs.parseFeishuJobsResponse (cognitive 18): feishu-jobs.parseFeishuJobsResponse has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 3 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/feishu-jobs.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb23c8d94154a2ebe35ede6b4ce391fda7ff6aaeea4ebae08076762e394d036"}},{"ruleId":"D2","level":"warning","message":{"text":"flowxtra.normalizeFlowxtraJob (cognitive 18): flowxtra.normalizeFlowxtraJob has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 4, error handling 1 (2 pts) (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: 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":"providers/flowxtra.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b5489f1eaddbd92600c73679cefc98cf7607d0bb5de725283c53c77411f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"ibm.parseIbmResponse (cognitive 18): ibm.parseIbmResponse has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 5, if/else 3 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ibm.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1706859cf235517811b8aa09590e25f15a7241d5b020c517949c65cdd9d995"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-jobs.parseStartupJobsFeed (cognitive 18): startup-jobs.parseStartupJobsFeed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/startup-jobs.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9630bfa514b369c76c2321f7d798dcef965c7705563908fe8a5b164381244bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker-sync-check.buildSyncReport (cognitive 18): tracker-sync-check.buildSyncReport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), boolean chains 5, 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":"tracker-sync-check.mjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d196a5d20a0bde6a97eb739871b0c86eca989ad63ebedd434375612efa9340"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.exportMd (cognitive 18): tracker.exportMd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, ternaries 6, boolean chains 3, loops 1 (2 pts) (nesting depth added 1). 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: 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":"tracker.mjs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b9f119c9930796858cbfaf8b0ddc8fbbd9aea64f03c1537669567fcb85ebd0"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.checkStatus (cognitive 18): update-system.checkStatus has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 4, if/else 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3924}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e89414b8c93170f80e00da5aeae424720048886da2c6e2af7e723d9643f235"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduled-jobs-runner.recordCompletion (cognitive 18): scheduled-jobs-runner.recordCompletion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8 (nesting depth added 1). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (apply, a function literal at line 274). 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":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc85428320e1ff1f06672ebcb31797d2838e1a19710c47c2156036d1b087e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"assistant-console.ConfirmationCard (cognitive 18): assistant-console.ConfirmationCard has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (14 pts), boolean chains 2, if/else 2 (nesting depth added 8). Of this number, 14 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"755a2f524694a4f24e3bb659d22f9c0712f6977e7d7fa76f1a68a060b73e8de6"}},{"ruleId":"D2","level":"warning","message":{"text":"status-select.StatusEditor::onChange (cognitive 18): status-select.StatusEditor::onChange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/status-select.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64942b31dc58d4d1841c6d703e5cf969b05b31aa83b66d42ba553ab68617981"}},{"ruleId":"D2","level":"warning","message":{"text":"analytics-data.normalizeWorkMode (cognitive 18): analytics-data.normalizeWorkMode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 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":"web/src/lib/analytics-data.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"140d4277fb6d32d62456e8e9cef945e3a1615be04f4c1e4e07d869ba70aa517d"}},{"ruleId":"D2","level":"warning","message":{"text":"discover.assembleDedupContext (cognitive 18): discover.assembleDedupContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, boolean chains 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/discover.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b45778d6d865776992fdbd5317af00b0571baa60b7d64e1de823fd2650f085"}},{"ruleId":"D2","level":"warning","message":{"text":"studio.studioReducer (cognitive 18): studio.studioReducer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 3 (7 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/studio.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9289746dfa8f4e6b2d9dcd2b0f8cbc796a1d83f8ae0ced0a4ae27ed07f79a4"}},{"ruleId":"D2","level":"warning","message":{"text":"whats-new.collectWhatsNew (cognitive 18): whats-new.collectWhatsNew has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/whats-new.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a05dff5847974ec9c8195ff9ced3b7e99e60b2bbfc00ee6a95f92b22bc82b44"}},{"ruleId":"D2","level":"warning","message":{"text":"collectSeenCompanyRoles::add (cognitive 18): collectSeenCompanyRoles::add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, other 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":"scan.mjs"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1fd64403fed1e998813439bd4e9bb99aa720b63eb4765b1d8ac6cae3724a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"printSummary (cognitive 18): printSummary has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), loops 3 (6 pts), if/else 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"081052086029dc12d189893791dc4b8b41d38eeaf18a950cf7ab8bd0612bbfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"runAdd (cognitive 18): runAdd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 1, other 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":"verify-portals.mjs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc4e52f82202ab86c6429ef1e49e8c5f97c3bbf87a9302a0b7e9359769d7e11"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchJobPage (cognitive 18): fetchJobPage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 4 (7 pts), boolean chains 1, other 1 (nesting depth added 6). Of this number, 17 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":"openrouter-runner.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc869e747c6e097608fcf8e9d0380ce0e9541d963c54fbdb0834c40bd6ddfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveTemplate (cognitive 18): resolveTemplate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (4 pts), boolean chains 3, error handling 1 (2 pts), other 1 (nesting depth added 4). Of this number, 17 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":"cv-templates.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe8bbffd19fcff66baa587a2ff47be9956000c058e7653edd374690559865b4"}},{"ruleId":"D2","level":"warning","message":{"text":"parseCards (cognitive 18): parseCards has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), other 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb9b5286ff349a4794baf5a4a393d15643af9a732880681732b95320ad309cd"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 18): main has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (6 pts), if/else 5, ternaries 3 (5 pts), boolean chains 1, other 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54f5b09fd0a94ef5f1952427eb922ff8219a6b2f62c6921a8a471b74f1b02e1"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker-parse.markdownLinkDestination (cognitive 17): tracker-parse.markdownLinkDestination has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-parse.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a8b42387385fc0e636bf97535ca28257ca9605b596d148897c841f22b440f3"}},{"ruleId":"D2","level":"warning","message":{"text":"_registry.resolveProvider (cognitive 17): _registry.resolveProvider has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_registry.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ff43b50966fdb1c9a4e5c9490d4e9996b38451c48ffb865e118c7ce326ffce"}},{"ruleId":"D2","level":"warning","message":{"text":"_net.isBlockedV4 (cognitive 17): _net.isBlockedV4 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. 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":"plugins/_net.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed1cb368b415855c21d80a4c58fbd3c3bcce4d248fefc51dc4450767ceddf62"}},{"ruleId":"D2","level":"warning","message":{"text":"zoho-recruit.enrichFromDetails (cognitive 17): zoho-recruit.enrichFromDetails has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/zoho-recruit.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e527705769136b75a1032626c0013e24d373965de99a72c96c3b712dc0d7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"history-ats-seeds.parseTrackerAtsSeeds (cognitive 17): history-ats-seeds.parseTrackerAtsSeeds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"history-ats-seeds.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c402f8229cb6af31f83eac87073491a50d4da68ef3580b382a0a4c7b7e890b0"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.delegatedAuthorshipClaims (cognitive 17): verify-cv-facts.delegatedAuthorshipClaims has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 15 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":"verify-cv-facts.mjs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7f72793891c6bded2adde1105dbb61921e58ab06be8f317a0ae923a83bd44"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.parseCliArgs (cognitive 17): verify-cv-facts.parseCliArgs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 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":"verify-cv-facts.mjs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32481e7344c36b1f73511c21879d4782ca1d8364190ea71cbdefdd5574bd95d"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-pdf.validateLockedSections (cognitive 17): generate-pdf.validateLockedSections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 3). Of this number, 12 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":"generate-pdf.mjs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f07cb92d487e3957ded3e3306acb60ed622bf8b92d5622cedb855aee96270d"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.prepareCandidatePhoto (cognitive 17): build-cv-html.prepareCandidatePhoto has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, ternaries 3, error handling 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":"build-cv-html.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"369c79d05ec54bbbc15dab38875c7b927dd519e9b0dc53d7304ff095274bf5d9"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.loadSectionPartials (cognitive 17): build-cv-html.loadSectionPartials has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"381e4e911778d1a17631a95d48b70fa8af4c95beb81fa607facddf352a3a9938"}},{"ruleId":"D2","level":"warning","message":{"text":"career-profile.reviewFact (cognitive 17): career-profile.reviewFact has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"career-profile.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"032ea1c8d857c4648baa1256542cf28e72b73cabf75a5a627d32bdadc32765c0"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.main (cognitive 17): verify-portals.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 3 (4 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":"verify-portals.mjs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a578a6266ab6a6d85ca2fe4a625ba281c98dd00ca3edb2d160f802e3aaa23a"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.collectSeenCompanyRoles (cognitive 17): scan.collectSeenCompanyRoles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 7, loops 3 (4 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"86df13e99e60b7610dc795611de8ea89f8f4add2734b5211d612669e613ca8db"}},{"ruleId":"D2","level":"warning","message":{"text":"pinpoint.parsePinpointResponse (cognitive 17): pinpoint.parsePinpointResponse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6, boolean chains 2, error handling 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 128). 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":"providers/pinpoint.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e872dfe0bae725ef2f65b708bc8de99005347eefdc0b2cc47f772563e36c96"}},{"ruleId":"D2","level":"warning","message":{"text":"discover-ats.resolveWorkday (cognitive 17): discover-ats.resolveWorkday has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a09a5efce2dd26bef900b972e1b4bae40f982161a9850680dd6959b710fbf9"}},{"ruleId":"D2","level":"warning","message":{"text":"latex-content.extractItemizeItems (cognitive 17): latex-content.extractItemizeItems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/latex-content.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62b008689dc2cadae06f68f0045189bbc27b536daeb5d4bd3ad21fd7d7f07dd"}},{"ruleId":"D2","level":"warning","message":{"text":"filter-audit.readHistory (cognitive 17): filter-audit.readHistory has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (7 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":"filter-audit.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb9978f9ccf817b160a97fb0dea4352efb3845b70c7fe8f77cd406296da6dc6"}},{"ruleId":"D2","level":"warning","message":{"text":"reserve-report-num.occupiedFromFailedBatchState (cognitive 17): reserve-report-num.occupiedFromFailedBatchState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (3 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":"reserve-report-num.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1c7a1fa520efdc6a2da7c66978012ae15ca28cd6f97cc0efb98294f35ea6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"github-evidence.collect (cognitive 17): github-evidence.collect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2651aa5c6bfa108689d25de55e1db0d6448db425fd61716c486a3ffa06c597"}},{"ruleId":"D2","level":"warning","message":{"text":"mjs-files.trackedFiles (cognitive 17): mjs-files.trackedFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (5 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mjs-files.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fb687fdb32b4c72ad5cc582eccc259a9d627298eaa8f27e362d3492dd0d34c"}},{"ruleId":"D2","level":"warning","message":{"text":"story-provenance-check.classifyEntries (cognitive 17): story-provenance-check.classifyEntries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 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":"story-provenance-check.mjs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3cc7a443cbf9977c0b9705a6826924a315e0a9af661cd982c281a15552c378"}},{"ruleId":"D2","level":"warning","message":{"text":"merge-tracker.reportNumbersWithStatus (cognitive 17): merge-tracker.reportNumbersWithStatus has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (3 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":"merge-tracker.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd401c9c43eafb3103ce31a60a345f23552cd71b5354fdf5e879d673d2592ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"plugins.cmdAdd (cognitive 17): plugins.cmdAdd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (5 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins.mjs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaba64ef696c1e194f5a78e717efa04d695fdfecf0944cb09354f4dc3d41e15c"}},{"ruleId":"D2","level":"warning","message":{"text":"install-h1b-index.downloadAsset (cognitive 17): install-h1b-index.downloadAsset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 145). 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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0a0e7cbd3d18a1916575bb90afff91ef488d5f68d2c075decf5c3f0e654d64"}},{"ruleId":"D2","level":"warning","message":{"text":"amazon.buildQuery (cognitive 17): amazon.buildQuery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d82bea244441f3573069d108b07b80f27503d98b68e4966f2a4cb9da9f90407"}},{"ruleId":"D2","level":"warning","message":{"text":"jobicy.parseJobicyResponse (cognitive 17): jobicy.parseJobicyResponse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 5, error handling 1. Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 53, toEpochMs). 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":"providers/jobicy.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a9e8f6ff8cf98e0628cd0876a546af79e5de68e235941f360f8a1bdc62365c"}},{"ruleId":"D2","level":"warning","message":{"text":"mokahr.parseMokaHrJobs (cognitive 17): mokahr.parseMokaHrJobs has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/mokahr.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d182284caa03eb672c5b0325fe6a9496252f9cc5a4ad0c2bf40e0149f9b5e70b"}},{"ruleId":"D2","level":"warning","message":{"text":"personio.parsePersonioListing (cognitive 17): personio.parsePersonioListing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"529fa120eb8ae13efe335c5ef2cf5a9f7e190275499c3f26e07b8ec8cc637bab"}},{"ruleId":"D2","level":"warning","message":{"text":"pracecz.extractResults (cognitive 17): pracecz.extractResults has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, 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":"providers/pracecz.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b58b5b5c552c8a232a2b686ee0c39cc337945a7bf4d1954b5511c3baa444e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"radancy.parseModernResults (cognitive 17): radancy.parseModernResults has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (7 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa157cd88d4f83f6ee126729251de48fcd81967bfe21259720eaf627aa0ca255"}},{"ruleId":"D2","level":"warning","message":{"text":"telegram-channel.employerName (cognitive 17): telegram-channel.employerName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, 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":"providers/telegram-channel.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9951e842ca3407cd80ff38cb889d972a25dec21477176e488e4c680386a87b62"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 17): route.POST has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), error handling 3 (4 pts), if/else 4, boolean chains 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/route.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc84e9b188bdbae0e28a78a2bb909b649b002d8b410a8d0abc060101e02a1f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 17): route.POST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 2 (4 pts), boolean chains 2, error handling 2 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 4 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":"web/src/app/api/tracker/delete/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a950afc1a0a34a25e2e5126c687d2c57eba9e4da1a789895a1b219c440f1fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"follow-up-card.FollowUpCard (cognitive 17): follow-up-card.FollowUpCard has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 6, if/else 2, error handling 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/follow-up-card.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a788e145f724bacf5d3f9413db22b237cddcfb0c1b379997391ac46da872845f"}},{"ruleId":"D2","level":"warning","message":{"text":"portals-view.PortalsView (cognitive 17): portals-view.PortalsView has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 2 (4 pts), loops 1, ternaries 1 (nesting depth added 2). 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":"web/src/components/portals-view.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5882e59726b755bc15a9624a24ad07b23c00ee91e689e9b8746c3a1e05031b6"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.runDiscovery (cognitive 17): scan.runDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 4 belong to 3 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":"web/src/lib/core/scan.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff8193e7508092f7bc301636003e2d9e91b53c346bee78e3bcc9d13aa974b82"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-sankey.classifyLeaf (cognitive 17): pipeline-sankey.classifyLeaf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-sankey.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6889ebcb1568fd98cd0ebbb629633ad67935fed4dd5192dc8a05728ededf71"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-sankey.layoutSankey (cognitive 17): pipeline-sankey.layoutSankey has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 4 (5 pts), boolean chains 3, ternaries 3 (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: 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":"web/src/lib/pipeline-sankey.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed5cba0716beb15d1205614914b503df3a8bfd9cd42ab9e2158d840a920bbe6"}},{"ruleId":"D2","level":"warning","message":{"text":"posting-url.linkDestination (cognitive 17): posting-url.linkDestination has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/posting-url.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"03308779911634455435f056744822b43c18484a538978327b3f1e77bb8bf34f"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduled-jobs.parseScheduledJobInput (cognitive 17): scheduled-jobs.parseScheduledJobInput has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, ternaries 3 (4 pts), error handling 1, if/else 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/scheduled-jobs.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"448eba81465a000c5c2a5874e1b39186f81c98c94449f61ff55e5809221fb94f"}},{"ruleId":"D2","level":"warning","message":{"text":"weekly-digest.extractGapsByCompany (cognitive 17): weekly-digest.extractGapsByCompany has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"70db49c69a5ce38a3feb7d272d6f3eed2febedf2467ded3f1cd385e6b3c5c9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeTracker::buildRow (cognitive 17): mergeTracker::buildRow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 1 (2 pts), other 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":"merge-tracker.mjs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c3a86f9f326c82d94f130e827f6932ce8475bc8d8e3b528ebc5d7a9c0994cd"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeTracker (cognitive 17): mergeTracker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 185 (315 pts), boolean chains 102, ternaries 50 (86 pts), loops 16 (24 pts), other 24, error handling 4 (6 pts) (nesting depth added 176). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2475b4154b9c0f1add537bb360c2fec424c32fd38e266029dce70fc6a2df42"}},{"ruleId":"D2","level":"warning","message":{"text":"cliExecutableOnPath (cognitive 17): cliExecutableOnPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"e273c01071b45a1212ae5ca42b8f0f593ab7e7142be8ba77a9eadd8cadeddee1"}},{"ruleId":"D2","level":"warning","message":{"text":"buildHintStopwords (cognitive 17): buildHintStopwords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), other 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75e0df8c178ff4230e2d52519a4bedf93754c2838ffca9214d4e6d5baf813a3"}},{"ruleId":"D2","level":"warning","message":{"text":"companyHintsFromQuery (cognitive 17): companyHintsFromQuery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, other 2 (nesting depth added 4). Of this number, 15 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":"verify-portals.mjs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9723b4753a908ff93263f8ba929eb06a5f4e9646ccae5bdc6098926f93a39fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"parseFollowups (cognitive 17): parseFollowups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1, other 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":"followup-cadence.mjs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3404453d00e3f5d8ccd47630b5f04368659fa2d0bcd3ec61275a6957d5c37bb"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveRow (cognitive 17): resolveRow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, other 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":"set-status.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af70447111fe2389f5a1ee44317106495d80dfdf7983abd561863e3ce026bab"}},{"ruleId":"D2","level":"warning","message":{"text":"countAuthoredCommits (cognitive 17): countAuthoredCommits has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 5, if/else 3 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: 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":"github-evidence.mjs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f367cfc8c16a7e62128579e2ff8405f08491c7ddd5548a5333d2ce60853e596"}},{"ruleId":"D2","level":"warning","message":{"text":"validateUrlSecurity (cognitive 17): validateUrlSecurity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (4 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d6dc0bf46dd56481f9cd58d7144da07327f1c225760517994c1fc81b17e7ad"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchRssDiscovery (cognitive 17): fetchRssDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f3e20d57b7b5dbb8bc7d8173a0b062625225201197e41853e2b1c7f14d2123"}},{"ruleId":"D2","level":"warning","message":{"text":"proxyFor (cognitive 17): proxyFor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), error handling 1, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5a80b12eb69b9211d4bfc18fb8d4cf0b777970a666d878f5afa0c8f843c713"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveTenant (cognitive 17): resolveTenant has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 4, ternaries 2 (4 pts), 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":"providers/eightfold.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"567fd636db1b7e3ef7a3e5e3cd7873dd248f3b4bee826f7fbb1e162451e00108"}},{"ruleId":"D2","level":"warning","message":{"text":"detectSoftVerbs (cognitive 17): detectSoftVerbs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"role-clarity.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b155af65ab6a6611f8c5e5d18a9c103b041fb50b1b01ee08c2d81edaa67fab"}},{"ruleId":"D2","level":"warning","message":{"text":"reportNumberFromReportCell (cognitive 17): reportNumberFromReportCell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), other 5, boolean chains 1, loops 1, ternaries 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":"hired-share.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9053621455eba15ed589470c352cfbc9f6ff6198e9a477b36a70c775a6b4723"}},{"ruleId":"D2","level":"warning","message":{"text":"assessment-log.printOpen (cognitive 16): assessment-log.printOpen has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 2 (3 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":"assessment-log.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baecef45a6ae489e83c4e06e116a50667e05e589829bcca55736be2a251cab5"}},{"ruleId":"D2","level":"warning","message":{"text":"_engine.mergeProviderPlugins (cognitive 16): _engine.mergeProviderPlugins has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 1 (3 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":"plugins/_engine.mjs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ff25553e42416759a2503ea7549ef324d2dd5c40ed716da17c7b82feb07803"}},{"ruleId":"D2","level":"warning","message":{"text":"theme-style.readLockedSections (cognitive 16): theme-style.readLockedSections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 6 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":"theme-style.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebe1f200fdd03dcb9e80f73c7d60d77193c6132aa409e6d7abc15db7377540e"}},{"ruleId":"D2","level":"warning","message":{"text":"listing-fingerprint.triple (cognitive 16): listing-fingerprint.triple has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listing-fingerprint.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4d0320486ec3a1d176d370f91ed439c3860f2f1d025e80747698f5aa29558f"}},{"ruleId":"D2","level":"warning","message":{"text":"followup-cadence.extractContacts (cognitive 16): followup-cadence.extractContacts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 12, loops 5 (9 pts), ternaries 4 (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":"followup-cadence.mjs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"191ef5af59143eca0ffb9c202f3f3413f96582db0ba16c2d6dd9351216d8b718"}},{"ruleId":"D2","level":"warning","message":{"text":"company-funded.renderReport (cognitive 16): company-funded.renderReport has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), boolean chains 4, loops 3 (4 pts), if/else 1 (2 pts) (nesting depth added 6). Of this number, 13 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":"company-funded.mjs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cb0ff51e0f76eab83ee4192be2b8e46b4f1667e6eb3f75d4f606f02ef439bb"}},{"ruleId":"D2","level":"warning","message":{"text":"company-funded.printHuman (cognitive 16): company-funded.printHuman has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, ternaries 2 (5 pts), loops 2 (3 pts), if/else 2 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c109c926982be87f37099dd82b0bf92b364b6d56d3b76258379a916a8cce73"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-check.main (cognitive 16): coverage-check.main has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4, ternaries 3 (4 pts), loops 1 (nesting depth added 1). 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, 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":"coverage-check.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"075a92080f1873973da6595738537342209c611fd49af80c3e97e67ec1a25eef"}},{"ruleId":"D2","level":"warning","message":{"text":"join.formatLocation (cognitive 16): join.formatLocation has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 2, if/else 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":"providers/join.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af74fadf433c533a943c9056b5a7e09ee99b83a4381aefe2102e7c2ab4e3ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"latex-content.extractSkillValues (cognitive 16): latex-content.extractSkillValues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/latex-content.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fb680b50cd92b66c3bb2f86aa8613becd0005266e10bb07beeaa982cf329bd"}},{"ruleId":"D2","level":"warning","message":{"text":"github-evidence.collectCommits (cognitive 16): github-evidence.collectCommits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 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":"github-evidence.mjs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7ba57c104b0aa6ddd711a5f329077434f007ad88f8153393d56054c6a7237c"}},{"ruleId":"D2","level":"warning","message":{"text":"github-evidence.findPreviousScan (cognitive 16): github-evidence.findPreviousScan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 3, error handling 2 (3 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f81b2d0ddadfd51ec3511b5fe257c57c249896c93041c434d83cc8a6536e54"}},{"ruleId":"D2","level":"warning","message":{"text":"intake.extractAll (cognitive 16): intake.extractAll has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 5 (6 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 299). 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":"intake.mjs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0745fc6911432281d46181c919900761e02e42015bae776ca7624dca27656c"}},{"ruleId":"D2","level":"warning","message":{"text":"api.plausibleMatch (cognitive 16): api.plausibleMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (tokens, isPrefix). 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c99cbd42b85ac4b697052dea6958b38639b6b87253bc13139f328a41dc58420"}},{"ruleId":"D2","level":"warning","message":{"text":"precheck-duplicate.findDuplicateCandidates (cognitive 16): precheck-duplicate.findDuplicateCandidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"precheck-duplicate.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69cf5a4c2a011d86a9edcab5c30669c02764dc60a238e3d2db365fecb739fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"amazon.formatLocation (cognitive 16): amazon.formatLocation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a644c07f049f96b7256ca2792d68c057a37e1e2c453f83afb0a2c38fc047d307"}},{"ruleId":"D2","level":"warning","message":{"text":"cryptocurrencyjobs.parseCryptocurrencyJobsRss (cognitive 16): cryptocurrencyjobs.parseCryptocurrencyJobsRss has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 2 (4 pts), boolean chains 3, 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":"providers/cryptocurrencyjobs.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a1a87861abf927822f7556759937d748d74dc94b51c456237a730cab7d0880"}},{"ruleId":"D2","level":"warning","message":{"text":"deutschebahn.parseHits (cognitive 16): deutschebahn.parseHits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/deutschebahn.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd1321dfc5a12d04ebe6039a8d36b6d8fac9af24dcbb52be233be6298fa5073"}},{"ruleId":"D2","level":"warning","message":{"text":"jobstreet.parseJobstreetItem (cognitive 16): jobstreet.parseJobstreetItem has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobstreet.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b31821f387ac31cdd38249e502222fb8d3e21ca60f188baaa27d10b0eebe608"}},{"ruleId":"D2","level":"warning","message":{"text":"schoolspring.parseSchoolSpringPage (cognitive 16): schoolspring.parseSchoolSpringPage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, 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":"providers/schoolspring.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcdb78331d76fef1cc8649c0f95cd5ae893e030f205f59208da5019f71fa7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"taleo.parseColumns (cognitive 16): taleo.parseColumns has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad15b25c9dc69890cd27f55894269edd5c4906ca3268ab968ce1d9eaec782533"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-portals.validateParser (cognitive 16): validate-portals.validateParser has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d4dbbaa1f2a87490c0f8d4571f4b4b739ba17a311fb7719a158c4145c1fa48"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 16): route.GET has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), error handling 1, ternaries 1 (nesting depth added 1). 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 item inside it that branches (toOffer). 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":"web/src/app/api/whats-new/route.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"76148a4681540453ac86347994c2b3264dbe17e02656af00f1001e806a22527d"}},{"ruleId":"D2","level":"warning","message":{"text":"search-insights.SearchInsights (cognitive 16): search-insights.SearchInsights has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 3 (5 pts) (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 6 belong to 5 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":"web/src/components/analytics/search-insights.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7b60354ff37cf4bdbd92f1ed8bf245a318c26eb0d312e6a4743e9e7ae7dcd2"}},{"ruleId":"D2","level":"warning","message":{"text":"submit-guard.isSubmitControl (cognitive 16): submit-guard.isSubmitControl has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 5. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/submit-guard.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a115f0daceae272ad7c9797d71a36faaec731f695160f1d6ca965dbe29cdbe6"}},{"ruleId":"D2","level":"warning","message":{"text":"assistant-chat-store.saveChat (cognitive 16): assistant-chat-store.saveChat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, error handling 2 (nesting depth added 1). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/assistant-chat-store.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"637f6eb8df9bbac61f4c80e5fd92663a583d136aaf1a3f3e4598d2eb161ccedd"}},{"ruleId":"D2","level":"warning","message":{"text":"portals-config.loadPortalsDocument (cognitive 16): portals-config.loadPortalsDocument has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), error handling 3 (4 pts), if/else 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/portals-config.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef31c72d6589101ff6743e721c4b3e742aae876f9a73c328186739d5df6c274"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-patch.profilePatchError (cognitive 16): profile-patch.profilePatchError has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), loops 2 (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":"web/src/lib/profile-patch.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e20907b322c508aad7ec40a233a39b112e1e6abcf28909acb2973d8a89c30b9"}},{"ruleId":"D2","level":"warning","message":{"text":"data.markdownLinkDestination (cognitive 16): data.markdownLinkDestination has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"dashboard/internal/data/career.go"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"6643efe3a6907db793eeae912de3627f1565eb99cbb5c171921cd87cb067e1dd"}},{"ruleId":"D2","level":"warning","message":{"text":"screens.findInlineMatch (cognitive 16): screens.findInlineMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 613, 642, 627). 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":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48ad3677ca995a6bb2667773cd6d7398d8aab087fb438037efa727e29f2c4e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressModel.renderFunnel (cognitive 16): ProgressModel.renderFunnel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddd7a7b6aafabe6297e37464fbfb13e8d5767879af5af7084ca069ae8043555"}},{"ruleId":"D2","level":"warning","message":{"text":"StatsModel.renderPay (cognitive 16): StatsModel.renderPay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/stats.go"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f8b487e412a8a12b06dabac1eab0fef8573ad1ed1e2a90e05c405784630462"}},{"ruleId":"D2","level":"warning","message":{"text":"parseArgs (cognitive 16): parseArgs has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (6 pts), if/else 5, boolean chains 4, other 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 3 belong to 7 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7996094f8a930e10c9a0c5fc8105b0ff5f99e161682918f0b704e3f89babbc1"}},{"ruleId":"D2","level":"warning","message":{"text":"main::updatePortals (cognitive 16): main::updatePortals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 2 (4 pts), boolean chains 3, error handling 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":"discover-ats.mjs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76681c432c1ef5ee83cda718721445ebad3b41fc78954cf69db0f92ec7b6dba"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeListing (cognitive 16): normalizeListing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 1 (2 pts), other 2, ternaries 1 (2 pts), boolean chains 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":"browser-extract.mjs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a09ff8339462b8651c1862397ce67e3d324ab543e460d2f2aa9db7a51c6a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 16): main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 3 (4 pts), boolean chains 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fce34e4e773a22f9aa0a9e01c4064b91f70d408934a100404f6da68a14a0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveExperienceFilter (cognitive 16): resolveExperienceFilter has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5, ternaries 3, other 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":"jd-years.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d96e41e6305d972daa1d81cf9e2902d2783eb3e7e2e0bda15e9f877a0a0320"}},{"ruleId":"D2","level":"warning","message":{"text":"occupiedTrackerNumbersFromLedgers (cognitive 16): occupiedTrackerNumbersFromLedgers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (7 pts), other 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":"reserve-report-num.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f8da3aec6f3756e79cd29f07b1f11b63eac03448541cab6856cc3c1e7f6d31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: merge-tracker.mergeTracker: FunctionTooLong \u2014 mergeTracker runs 835 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 735 over it, 8.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cd4862831ab9202459ebd8facf69322f705b18aa97c74d8ee76d74ba2e241b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./update-system.mjs: FileTooLong \u2014 2452 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 1952 over it, 4.90\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":"update-system.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d0fca0cda4c2f0dd20128a9ef50536485b63189479169a64fb94e93a319522"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./scan.mjs: FileTooLong \u2014 2377 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 1877 over it, 4.75\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":"scan.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a40f0df0c1fec81e53c2586638dbe1e676b420486831556915ecaed1294f5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Catalog: TooManyFields \u2014 136 stored fields beside 6 methods. The bar is 30 stored fields; this is 106 over it, 4.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/i18n/catalog.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2c5a538e1ad6665f183f931ac04e71b6774e0e620590d67507d9230ad0821a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scan-ats-full.main: FunctionTooLong \u2014 main runs 430 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 330 over it, 4.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc064be53b797105e9a3a918b21364384db01e620ce1393469b966270252383d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: explore-provider.ExploreProvider: FunctionTooLong \u2014 ExploreProvider runs 413 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 313 over it, 4.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":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"099714d474694a900881ac25b5c929fbe365b688d3f2d613cb33e0d78bd9ac51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: company-history.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 394 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 294 over it, 3.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26552127815cfe2b442300d415c1832366c6de0f1117dd7cc6bd3c14721a38a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: check-jd-archive.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 386 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 286 over it, 3.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53127cd8665ba589062143f0444178304f36d78aaec6b8671a5765ac87b2ae7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pipeline-view.PipelineView: FunctionTooLong \u2014 PipelineView runs 335 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 235 over it, 3.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/pipeline-view.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"915a51e0aa01572a719e19b9f060a49bb2632afd07039fe9f0688679ad80978c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PipelineModel: ClassTooLong \u2014 1285 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods, 58 blocks, lines 287-2466. The bar is 400 significant lines; this is 885 over it, 3.21\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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"92770b3b5744d26fcc16a481285dd5d10f8ff6199c70eae9e7a853ce27c0deea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.POST: FunctionTooLong \u2014 POST runs 317 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 217 over it, 3.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9178e3468366b683fcf7eb4573150f27800e6dea54355a43200fdb0729d648"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/pipeline.go: FileTooLong \u2014 1543 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: PipelineModel (58 blocks, 287-2466). The bar is 500 significant lines; this is 1043 over it, 3.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25613425a760b2b3fc0016115771f7c7eb187804e5bdf417544b93ce0c5498d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: apply-provider.ApplyProvider: FunctionTooLong \u2014 ApplyProvider runs 285 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 185 over it, 2.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3984276ba2374fcba28d02699ba17c6d3ed3fbc66eb7400000824a574113d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./verify-cv-facts.mjs: FileTooLong \u2014 1412 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 912 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42373b1e7cf1c9797da657d4f8888ceeb91a6f7303f4c67c48e0bb16df349eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze-patterns.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 282 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5651c220e5fdf3af25d076e4a7726aa869b49d4755a0be7098b743b02de2721"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: build-cv-html.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 279 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd79c76256c83cf4966c5e2a3c1109412d3f7a76cf973e87a53f35289c3f6bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scheduled-jobs-view.ScheduledJobsView: FunctionTooLong \u2014 ScheduledJobsView runs 260 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 160 over it, 2.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b36677c2d5aaeb31d7c92855169940feb658fdc4e151ba194cc24a54efde9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verify-cv-structure.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-structure.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11e5d20707bc51010464394ce210fe137c2a8b6c2717067d878621c3357fc28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: today-dashboard.TodayDashboard: FunctionTooLong \u2014 TodayDashboard runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c538a7a32ddbe8a7da3d3089562bbccf28064ae01952d36baa6d66473c29dcf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: funnel-velocity.selfTest: FunctionTooLong \u2014 selfTest runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa09399e3dda5c29c563b9563a99f1555dc860541f80f336ad9265e9c41efa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cv-ingest.CvIngest: FunctionTooLong \u2014 CvIngest runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5976982a3f7fdc374cfd9441e082019d7fc7e01ec7f54f54abf0c1a3e96a4d1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: config-form.ConfigForm: FunctionTooLong \u2014 ConfigForm runs 241 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 141 over it, 2.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":"web/src/components/config-form.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"97692a3c9fb06aa4be4ca253c3700ee48af851a28256404f6dc21ba633a20351"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.POST: FunctionTooLong \u2014 POST runs 239 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a441b26c9b802530512c6dc3ae7df07c93641589e1deb7a984a0048214ebe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./analyze-patterns.mjs: FileTooLong \u2014 1181 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 681 over it, 2.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ef549122fcc396c12030e954a87acab08ecb6c7bc6afb5eb9ec2be1c67b697"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./generate-pdf.mjs: FileTooLong \u2014 1165 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 665 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4c0a4226c55aba42791b9c6b5ea3d53fb2856d2f69d8db31a43535e7a03ea6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cv-title-check.runSelfTest: FunctionTooLong \u2014 runSelfTest 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":"cv-title-check.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"92094ebf0ca9838dfc6a2db447c6d39f51b7aa27bdfb99dd4f6a63a47c3f5757"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./salary-gap.mjs: FileTooLong \u2014 1032 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 532 over it, 2.06\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":"salary-gap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c2373efe5b5830e49610acd4fd147e8a3f37999d37446a2c6ff566757110b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: report-view.ReportView: FunctionTooLong \u2014 ReportView runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/report-view.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"de12c80c4e64052c70ee26df21e8d75f9c25a8c9bde0c0c154f6a84532977cac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./scan-ats-full.mjs: FileTooLong \u2014 1014 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 514 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b0c7f832be04985be346d9f84e9e615c3333520894e8aaf9802b80e72830a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: followups-view.FollowupsView: FunctionTooLong \u2014 FollowupsView runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a536519382c813ea54036186e229fa99e444d1234c27211a00fac23bbfa2a455"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./build-cv-html.mjs: FileTooLong \u2014 990 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 490 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a056e347075f2dbf1106a60f78dabb748b9b302700ef9d04df57df1f007b45e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PipelineModel: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"927dc2bc64d6a583cf51e2ee33750e65b8e8ee8067f61369ae5b90077012c56b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./merge-tracker.mjs: FileTooLong \u2014 940 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 89% of them inside a single declaration: mergeTracker (334-2392). The bar is 500 significant lines; this is 440 over it, 1.88\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":"merge-tracker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fbfa400f75d96ae86b304b794acfe4ad33f80d7434699a3629cd634d16fce4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: validate-portals.validatePortalsConfig: FunctionTooLong \u2014 validatePortalsConfig runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c49bc31fcc00a433e7e4b916b9d49c826390bb61560c7ffd85101035ab09eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: explorer-view.ExplorerView: FunctionTooLong \u2014 ExplorerView runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explorer-view.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f2d68f5eeda1388c28b6d432c9f4b0b49546349e8e21a3e045067f1e0c35ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./doctor.mjs: FileTooLong \u2014 920 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 420 over it, 1.84\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":"doctor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"670e7a7b0252e26fb7d9807b9a983f05a4341b9af6408febedd6893782886538"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: weekly-digest.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa021bda4c1d6532f44b641de24a5ffb11241fa57d0615a6ed8e3a6819e6f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/assistant-console.tsx: FileTooLong \u2014 902 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 402 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b72e26b6336c9237d84cf9a922b2db08448aeb195a476207808d24b0eecf6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./company-history.mjs: FileTooLong \u2014 892 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 392 over it, 1.78\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":"company-history.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7e2a686a9c09dc6d9225564654f6a47610b928c94849baa59a256ffdf860ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze-patterns.analyze: FunctionTooLong \u2014 analyze runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e5c75c0befb737177526a84ad9b04e8f5f7c285e07b5a0d31d8d8144e234e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: job-card.JobCard: FunctionTooLong \u2014 JobCard runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/job-card.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfe8411a87ae91e2285e74351a76dc9857049370b7ab65d8e0449c811353a96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: data.ComputeStatsMetrics: FunctionTooLong \u2014 ComputeStatsMetrics runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/stats.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ffe47b55d094357fa4dc23fa70f9b4170fd3a1eaa904a822974b04d7ef0bad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liveness-browser.checkUrlLiveness: FunctionTooLong \u2014 checkUrlLiveness runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"736574f5d2dcd6455fbe8e1f775c700d26119d5d52ca531e257c3d129cd2fa61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: detect-reposts.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"detect-reposts.mjs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa69f042bde5df51bccaf8ba6f15208d0204fc772b966bf3885296b12dc861f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PipelineModel.handleKey: MethodTooLong \u2014 handleKey runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2d23a28f265790f249fe8a0fd502f55fd8a510b97e71bc2e5c3d64808dbc2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: check-table-freshness.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7789122d31311832a06e2c6d3f56580691b914bbe23209eb9ac66f566611d2f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./company-funded.mjs: FileTooLong \u2014 773 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 273 over it, 1.55\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":"company-funded.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a648e5cf7db9dc00fb8ccf50f520ba5ffd15dfebe74bde0ea24505a898d862d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sync-pdf-flags.syncTrackerPdfFlags: FunctionTooLong \u2014 syncTrackerPdfFlags runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync-pdf-flags.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddfd7125eb4547da8835e81b652709db47a47bb207a611131c63c9e96c18316"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/career.go: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 252 over it, 1.50\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":"dashboard/internal/data/career.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"442b4d3f938bb79a83aaeae61ada4e3144f97bbd2cc8c90634557986b50859a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: edit-job-modal.EditJobModal: FunctionTooLong \u2014 EditJobModal runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"21127dbef615efc907ee087a6b54b6b1dc74409076e3584ff7861857aa60e14e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./check-jd-archive.mjs: FileTooLong \u2014 734 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 234 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd955bf78b8af1aa51fc31b0e34da4c3f07178890b508a594d25477ccdc7abf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./tracker.mjs: FileTooLong \u2014 729 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 229 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":"tracker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c57abfa29df1487600c12642e07a54b52126f2b189054a54b8b8787f8fa86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: aggregate-tokens.main: FunctionTooLong \u2014 main 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":"batch/aggregate-tokens.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ba67f6bf439e49a4f76c628906759e21b2e3367bf716153d1abff88b3b2a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cadence-settings.CadenceSettings: FunctionTooLong \u2014 CadenceSettings runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffee98303b0ed9cb47a2f7705eab9c8dc024e893f3a2c820df32728ac632e916"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./verify-ats.mjs: FileTooLong \u2014 718 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 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7863eaac7941a058695211c30d7086a620cf93d62d0c419b7992441ba2ed632"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: job-store.JobsProvider: FunctionTooLong \u2014 JobsProvider runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0723428f799db1d48bc11f852e70cfaacfbb8f6ca45a3bc8c049406a39fa115c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: check-liveness.main: FunctionTooLong \u2014 main 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":"check-liveness.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284e5a7271a562494174bc0f1da024d56bcdd1f9680627bceda62f7cd235b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: filter-builder.FilterBuilder: FunctionTooLong \u2014 FilterBuilder runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/filter-builder.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"46772b29a148c8ee57d0b9f44039237bc6e6f2fae0cf23a25b9af2e01d5696bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mobile-nav.MobileNav: FunctionTooLong \u2014 MobileNav runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/mobile-nav.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe89c0850ddd0ceca52c0baeec1ea0fda22a51977cb599d1666d3add3a106ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: i18n/catalog.go: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 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":"dashboard/internal/i18n/catalog.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a270a6f2f9ffec95f6d4ae7a715072b4b530306a0c4e5805cd4953485bd707b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.POST: FunctionTooLong \u2014 POST runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fb749d04084b0027116b0823dd9947ccaa9aa584987c475118580412cb8f83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: create-job-modal.CreateJobModal: FunctionTooLong \u2014 CreateJobModal runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cfb46d56630039588977e7fff39e46dfbbc98a39f6bf16b5714c3ccbcdb6e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./jd-skill-gap.mjs: FileTooLong \u2014 668 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 168 over it, 1.34\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":"jd-skill-gap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4d5b9e91e7a0e5531a084b51c504a64d54211d9aa87bdc53cd8df05d06d34c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.POST: FunctionTooLong \u2014 POST 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":"web/src/app/api/assistant/route.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e107b955fe181f1fe42271c37844006952005a91dd5432dc3967390fd9f1408"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: log-dialog.LogDialog: FunctionTooLong \u2014 LogDialog 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":"web/src/components/followups/log-dialog.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f124734bbda2e5902acbc223a396c457dac99fe12f335048617ace17ebac74e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./discover-ats.mjs: FileTooLong \u2014 644 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 144 over it, 1.29\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":"discover-ats.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"282ae4ce625a7255fb799cc914c2992098371d2d3b088e7f6f5136a8b9a26671"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: appModel.Update: MethodTooLong \u2014 Update runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.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":"dashboard/main.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f06843f58ef053b1cdf792bea9232d56b3ac0e286653aa530058fd9db8ead"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/viewer.go: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: ViewerModel (23 blocks, 35-986). The bar is 500 significant lines; this is 137 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1e903703be5620c2e897dacd0dfc993dbe3d1352e9fb43baed8f64a23973de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./openrouter-runner.mjs: FileTooLong \u2014 632 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 132 over it, 1.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":"openrouter-runner.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15843af3618140ae4ba8f9cf449531008967a5cc1dd7dd64723bd4fcee4ec01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tracker-sync-check.runSelfTest: FunctionTooLong \u2014 runSelfTest 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":"tracker-sync-check.mjs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc652b0c114e23652cedd53a47549dc21a2feeb718fe5072962c096beaf4cc15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: apply-checklist.ApplyChecklist: FunctionTooLong \u2014 ApplyChecklist 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":"web/src/components/apply-checklist.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea72d6c2600fc63b8df2d2b70015624b96ffb5c6cfaa960ca193c88a746e9c10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: github-evidence.buildEvidence: FunctionTooLong \u2014 buildEvidence runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.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":"github-evidence.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"410c2b6395f6ecdbcd6fdb6e45fae138da19fe239cae403791a3bd940f30b77c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: openrouter-runner.callOpenRouter: FunctionTooLong \u2014 callOpenRouter runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.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":"openrouter-runner.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cc3ceefd024b5f85746377c0ccc8602f53c15b16d38f5d58f2907d0f9c4830"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./funnel-velocity.mjs: FileTooLong \u2014 577 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 77 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8fd7c3119d6736c04e65fab9e0e8cddc9c31c39d2cf47f9a14c57cee09e649"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: next-date-dialog.NextDateDialog: FunctionTooLong \u2014 NextDateDialog 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":"web/src/components/followups/next-date-dialog.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8607fe1ff0d6ba8274f582c41995b4b9e04dda5a5f88537778b1bf3280bd22d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: status-select.StatusEditor: FunctionTooLong \u2014 StatusEditor 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":"web/src/components/status-select.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e895fc89c45c9fbf604d960849684ca84ddcf8c1126477eaa0d0e68718839ce7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: extract.extractForm: FunctionTooLong \u2014 extractForm 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":"web/src/lib/apply/extract.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"087226faa69d3e6edb41da54bbcd98d3ee3ff1d3d05a340c3964e70db39c781d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PipelineModel: TooManyFields \u2014 34 stored fields beside 59 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"55457f539df0b59aa6aba44686d4d7cec8ecb2a8b0df864ccfd65b39d2648f06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: followups-view.FollowupRow: FunctionTooLong \u2014 FollowupRow 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":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"496a03a0988401604a58a6053585e5fcc32cc627d02442ef65670e1d6399125c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rejection-latency.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rejection-latency.mjs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d4b6346bfeddee96b9ecb6bd13730d6feae83189341e811717276a77cc9a5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./github-evidence.mjs: FileTooLong \u2014 559 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 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4ef469c6786e0faff53c6f0fb7798b72c583652e59c2a925cedc53917c2c1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./verify-portals.mjs: FileTooLong \u2014 549 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 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0debcfd38e0da8f9a9a4119a4d31849eb1cf887deced7bcb840543eec9c1c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: upskill.runSelfTest: FunctionTooLong \u2014 runSelfTest 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":"upskill.mjs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe48ea0879c79410ce6c368e8603aaad81f66457373b10c99cb9daecff4d7e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: discovery-card.DiscoveryCard: FunctionTooLong \u2014 DiscoveryCard 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":"web/src/components/explore/discovery-card.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bd0c0667b4011f08531d02900cc84195520922481e811544148b83881f524d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: data.ComputeProgressMetrics: FunctionTooLong \u2014 ComputeProgressMetrics runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"002205a0ef7189b136d0d83ff7d90b9b165bc4977b62e18a8299e2e8ad54ffbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: contact-extract.main: FunctionTooLong \u2014 main runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contact-extract.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f264671e8ee76eadd6e7f96bad25b93f8faebde9de52a23c00b0de404b84ed"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ViewerModel: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods, 23 blocks, lines 35-986. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cfa47ca11f2d0e30367fea1eccb430ce86f86816bce63926825ffc336fff09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze-patterns.printSummary: FunctionTooLong \u2014 printSummary runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e32222cdb26270c6b0d35b9fa7e7544989c132332f0e5ae6f30fb844bf01c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./browser-extract.mjs: FileTooLong \u2014 528 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 28 over it, 1.06\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":"browser-extract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9094dda9a3bf297fbb430bec802067bfe27aef7f97aa08e9cbed9a1130b1ab0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./invite-match.mjs: FileTooLong \u2014 525 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 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd720bee0bf2a58485b01861d781516b804e1e3b47d71f0eb103606b7551bf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reply-watch.main: FunctionTooLong \u2014 main runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-watch.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e91fef6598577a156e272feca8cb66c599b2e44b3070bc349792635990c015"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.DocumentsPage: FunctionTooLong \u2014 DocumentsPage runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/documents/page.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"191d878e6b0ff8c504a9fa29132f895da925947fe403350651a80a8c5e911f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: claude-usage-scan.createUsageScanner: FunctionTooLong \u2014 createUsageScanner 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":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1cfc264b269304ec5e1103ea0e9fd9855adf33bf5a1e5efe3c433d3d0142bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: employer-source.scanEmployer: FunctionTooLong \u2014 scanEmployer 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":"web/src/lib/core/employer-source.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0098befb8d1277f62eb2aa6a4a544b2641d3fecbd79ad01c3bd9b636923de7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: explore/explore-provider.tsx: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: ExploreProvider (132-670). The bar is 500 significant lines; this is 19 over it, 1.04\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":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7760d50ce1d7e4d3ccc9d3a3a44f884723f6576ed0949053818e8741391afe93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: session.fillSession: FunctionTooLong \u2014 fillSession runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac27b7ba3f0db811d034e79028559a65c00c76dde50f0f12ce421a94a63dd876"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./linkedin-join.mjs: FileTooLong \u2014 512 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 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9996dff39dca4292a4c33a56f9612ac5bc9ba89c92d750b26ceec42f8aacf408"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reply-matcher.classifyReply: FunctionTooLong \u2014 classifyReply 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":"reply-matcher.mjs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b309bf46ef73689ca83e02716b0652b5846ea0ccdc0959d095cdb0be38a35e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rank-pipeline.main: FunctionTooLong \u2014 main runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rank-pipeline.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3298f8903488d5c113d9a2d1e39b339891f29d66618af23134335f90e70fbcca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reply-matcher.matchCandidates: FunctionTooLong \u2014 matchCandidates runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf18ead2e34af2ba2e28eac7e29ca54a75d33bf267c8b9d9555a6a4a119a1c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./followup-cadence.mjs: FileTooLong \u2014 504 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 4 over it, 1.01\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":"followup-cadence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b37db4090ac74599ab7fca685b6a13ad3b92c730ce742fd288676d918925f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): dashboard/internal/data/career.go:526-555 | dashboard/internal/data/career.go:611-641 \u2014 both copies are in the same file, so extract the block 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 \u0060dashboard/internal/data/career.go:526\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d8d7e6767ba1fbd8bd31ab8ab1fd5f87988bd5e2a68c0e356ff077589806c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 2): dashboard/internal/ui/screens/progress.go:94-121 | dashboard/internal/ui/screens/stats.go:249-272 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dashboard/internal/ui/screens/progress.go:94\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":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff2a5d974ee7e4b5bf8e8199747707764417dc48b3ab708aeac81204f03f626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:2200-2226 | dashboard/internal/ui/screens/viewer.go:949-974 \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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdf255f821a626908bc0b823cc3f3b28b9b696d4e1d7c1210cc8f803930d074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): dashboard/internal/data/pdf.go:110-131 | dashboard/internal/data/pdf.go:159-179 \u2014 both copies are in the same file, so extract the block 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 \u0060dashboard/internal/data/pdf.go:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060dashboard/internal/data/pdf.go:132\u0060 calls \u0060isSafeRepoRelativePath\u0060 and \u0060dashboard/internal/data/pdf.go:180\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":"dashboard/internal/data/pdf.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b51887b6c970fe025ebd3b54a68a647811536c85a458478f6e80315f29f119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:538-556 | dashboard/internal/ui/screens/pipeline.go:1019-1038 \u2014 both copies are in the same file, so extract the block 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 \u0060dashboard/internal/ui/screens/pipeline.go:538\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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"089d9e4f5df8d3854dc3f002a22afd7bf6396d3c929ea908257bbb59d3c8c712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:847-862 | dashboard/internal/ui/screens/viewer.go:920-935 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060dashboard/internal/ui/screens/viewer.go:919\u0060 calls \u0060clampScrollOffset\u0060 and \u0060dashboard/internal/ui/screens/pipeline.go:846\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f257ae5d79df1932ceff3f0e5b1ba0885a602b27ae34c6c8ce17d4c01631a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): dashboard/internal/ui/screens/progress.go:186-201 | dashboard/internal/ui/screens/progress.go:259-274 \u2014 both copies are in the same file, so extract the block 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":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c91a752692ed58a9efc6d9eb07fc1ec1818e47a101f5bef871e546dabd4461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): dashboard/internal/data/career.go:383-394 | dashboard/internal/data/career.go:467-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dashboard/internal/data/career.go:383\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060dashboard/internal/data/career.go:378\u0060 calls \u0060Join\u0060, \u0060loadBatchInputURLs\u0060 and \u0060dashboard/internal/data/career.go:464\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":"dashboard/internal/data/career.go"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"497249d7cd3154fc6823b655b1b4959df55c69c4e67f7977f458c2cb56ce8294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): dashboard/internal/data/pdf.go:135-146 | dashboard/internal/data/pdf.go:180-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda6aee8887e7037c157e62ac8b60b8d05046afa02e3037917019504c1fceebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:2131-2141 | dashboard/internal/ui/screens/viewer.go:872-882 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060dashboard/internal/ui/screens/viewer.go:869\u0060 calls \u0060Foreground\u0060, \u0060Render\u0060, \u0060sanitizeFlash\u0060 and \u0060dashboard/internal/ui/screens/pipeline.go:2129\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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fa7df73b2b2bdd40c56b54232efefe3c66bfffbc87f59f7d9ee1b790f5405a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:2279-2288 | dashboard/internal/ui/screens/pipeline.go:2417-2424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6930982e4e5aaec53ff358d6e202589074f3153d9c9022f13933951787c131a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): dashboard/internal/ui/screens/progress.go:397-406 | dashboard/internal/ui/screens/stats.go:678-687 \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":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a6be34a9bb84af6ba5735d94b91f8dbdf308f9d4baa5e0d36900eb28db787b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): dashboard/internal/data/pdf.go:233-241 | dashboard/internal/data/pdf.go:313-321 \u2014 both copies are in the same file, so extract the block 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":"dashboard/internal/data/pdf.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"168d328825a4e53e66ed63e10f0401b16b7377461a3e1842ed22788c169b3a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): dashboard/internal/ui/screens/progress.go:409-417 | dashboard/internal/ui/screens/stats.go:690-698 \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 \u0060dashboard/internal/ui/screens/progress.go:409\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa28e234e095a40d4ec6584ab1fbe379b54971729d1ebfd65345c9a633f67c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): dashboard/internal/ui/screens/pipeline.go:2125-2132 | dashboard/internal/ui/screens/progress.go:395-402 | dashboard/internal/ui/screens/stats.go:676-683 \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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"869e21afce37dd7366808abdecacab8c8ac8b0cb04dc8644aa6a666f375ff4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): dashboard/internal/ui/screens/progress.go:157-163 | dashboard/internal/ui/screens/progress.go:230-236 | dashboard/internal/ui/screens/progress.go:346-352 \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 \u0060dashboard/internal/ui/screens/progress.go:157\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":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab9ade4952db310c1da9d2d1977e30bab83735e6833551b4271a02c59568fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): dashboard/internal/ui/screens/progress.go:124-129 | dashboard/internal/ui/screens/stats.go:275-280 | dashboard/internal/ui/screens/viewer.go:274-279 \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":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4348494657b01c813b3ae53ec8c2de285c7e2bd61df756f943baeea563476d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): dashboard/internal/ui/screens/stats.go:452-456 | dashboard/internal/ui/screens/stats.go:526-530 | dashboard/internal/ui/screens/stats.go:591-595 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/stats.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b688d51e0f53e908fe562aaab5dedd25638eff7f92831679de80c6aaa72cae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): dashboard/internal/data/career.go:475-481 | dashboard/internal/data/career.go:512-518 \u2014 both copies are in the same file, so extract the block 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":"dashboard/internal/data/career.go"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"419252fafcc5c47dc916b015c7df22ddc6372ea1bddcbd42e9937a3f0219c4ee"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: doctor.mjs: 27.6% line coverage (457/1655)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c54c700a84d6bed65be65f61ad3bddcceb01b1536b843ba76d78a4ff5c3e2c3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: jsonc-parse.mjs: 39.7% line coverage (46/116)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jsonc-parse.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58b1077f8ed64e5ed35e0e18d9f75b3be6209b05a463e0a6463ea9bed55b052"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: liveness-browser.mjs: 35.0% line coverage (311/888)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5084b728636e4c70ae821c0798aaa91c4e7991318a37c3f0196a507f5e7426"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: plugins/_engine.mjs: 39.0% line coverage (317/812)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff29ff6017480e232fc874c72faf9ddfb255afffcdae75f94fe1700850d2d437"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: plugins/_lock.mjs: 38.5% line coverage (72/187)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_lock.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b024946d435ea871de23cb8469869daeedc9e134bb1868dee3e7705d118fb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: plugins/_net.mjs: 36.9% line coverage (41/111)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_net.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb63fb4efa3a478b978534f6b82a700ca0936ae47b8a30c4495c1d31373c4806"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: plugins/_registry.mjs: 46.6% line coverage (68/146)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_registry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b300b2db6a331fb7dc1b93b883db16be4b8fa31ab734f9bc0ee6bf4e23a276d3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/app/api/run/route.ts: 22.4% line coverage (148/662)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5869e7cd2efe0cbb15bf52501b115a62d0c48bb93bc1ef8866471e8396ea10"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/analytics/view-model.mjs: 35.3% line coverage (85/241)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics/view-model.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8387c12ac0e7052cafaa85275dcb772c9009ee9b2df6ab070c0e3d2e4dcddd65"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/apply/agent-interpret.ts: 26.8% line coverage (53/198)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e43530e17b2a3f93e71ad94d8ce2588d8c3433fd55def3739036b0308255c56"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/apply/diagnose.ts: 28.7% line coverage (79/275)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d572d8f29613b9436ba5c344749fa01dacc33e24523a7d42af174949dbaa8079"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/apply/extract.ts: 11.5% line coverage (22/191)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/extract.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3da74b3ce848a20d0fdae36d3802be531d4d96451c189e81e2d591bb0fd569"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/apply/greenhouse.ts: 39.1% line coverage (27/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/greenhouse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4233664bd132497d29c3f137348440774a0ee026c55eed7845230e499c11a10"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/apply/session.ts: 26.6% line coverage (158/594)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d713dbebe6cdc848242b800903740fddd5ab1a551f8f17dc92fa0adaaf7f3d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/core/scan.ts: 25.7% line coverage (115/447)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcefdce841db8494ae7a6f590b8c751e70d76b211b575540c1486ff9b351722b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/cv-studio/server.ts: 42.0% line coverage (79/188)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5478d2a6e64e1ebeec51136aac3c88323b9ff7507efc7b4e713116aea421626"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: assertSafeApplyUrl: allows a public host when DNS is public (mocked): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/apply-url-guard.test.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ae036c8282d7b21db2b021dd75c0a92a13e43f39cc410d10c53ad9e77f75c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: a slow posting does not block an independent posting: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/inbox-skip-client.test.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d8950b4b15e8d0e1fb35cc1cc234541f51ed6868bfff6978316989c3fc5ee"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: the lock is released on a throwing path, not just the happy one: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/tracker-lock.test.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df835787786c894beb49ada2e538be7cae8a0c9a840893e542614b0627f6441"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: acquirePipelineLock: an ownerless lock older than the grace floor is still reclaimable (#2304): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pipeline-lock.test.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"51108b9a3caf8844c62137f3719a402c972f6ca811ee994ee2bd4040b91722ca"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: request feedback is transition-only, quiet when closed and user-navigated: This test starts work it did not wait for (\u0060input\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 500))\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":"web/tests/lib/assistant-request-feedback.browser.test.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"db449f46fc694fca2df17de9bc5b0b4ee24f5b8ea72b5f7eac15ffe5b11eb51e"}},{"ruleId":"D10","level":"warning","message":{"text":"Races the wall clock: JD frontmatter round-trips through js-yaml with awkward values: This test reads \u0060new Date()\u0060 and compares it against the value the code under test computed from its own clock read, compared exactly in \u0060assert.equal(parsed.scraped, new Date().toISOString().slice(0, 10))\u0060. Those are two independent clock reads, so the test passes only while no boundary falls between them \u2014 a second ticking over between the code\u0027s read and the test\u0027s, or, for a date, a day that differs between the machine\u0027s local zone and UTC. It passes or fails on the time of day and the build agent\u0027s time zone, and re-running the suite on one machine cannot reveal it. Read the clock once: give the code under test a clock the test controls (a fake time provider, fake timers with a fixed system time) and build the expectation from that same instant, or assert a range rather than an exact value."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/apify-jds-data-root.test.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"20539ad57b1caa5e70312faad0af65c829a5ca4aea3726fbeb86b1788f028032"}},{"ruleId":"D13","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":"e8087bdfd437856fc4d70ad809ac0618f0a5722d97658699718cf81d93f09253"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan.mjs: scan.mjs changed 82 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 316 in scan.main at line 4061. 49 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- scan.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":"scan.mjs"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"150526ad7703e19f26b944680afb4e64b1cefb44d345eb6c47d8d3d648be31cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: update-system.mjs: update-system.mjs changed 195 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in update-system.apply at line 4515. 86 of those changes were fix/bug commits, and the other 109 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- update-system.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":"update-system.mjs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00591262e16981a9da05f6d3b177eac27832879c1fc198411c3aa24fa68586f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: merge-tracker.mjs: merge-tracker.mjs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 369 in merge-tracker.mergeTracker at line 334. 44 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- merge-tracker.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":"merge-tracker.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2f2b587b04f6bad590dbb6320769ead31bffec14b8209e4733ec0830ee4f8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan-ats-full.mjs: scan-ats-full.mjs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 166 in scan-ats-full.main at line 1207. 22 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- scan-ats-full.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":"scan-ats-full.mjs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b95e9c033e7f04d309d2e59e6ef55a7434ba23b9d763293f20837354f4d5af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/assistant-console.tsx: web/src/components/assistant-console.tsx changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 243 in assistant-console.AssistantConsole at line 143. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/assistant-console.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2924fb1337ac593f13fd6c631454dbb48932b883e621d68d85f3f0767be1c9c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: analyze-patterns.mjs: analyze-patterns.mjs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in analyze-patterns.runSelfTest at line 439. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- analyze-patterns.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":"analyze-patterns.mjs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"102e501f9270a984bb26b278c5a4391861e44e35fb5607baa1dd7ce81414f000"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/run/route.ts: web/src/app/api/run/route.ts changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in route.POST at line 34. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/run/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a511a9f39e233b5a18f69c2df384bc7aae062ea3574f3236862e86ffd281d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: build-cv-html.mjs: build-cv-html.mjs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in build-cv-html.runSelfTest at line 1151. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- build-cv-html.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":"build-cv-html.mjs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52e880caa198739161d032b7e1f6ea621d36c280baa925327585506b6443523"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: generate-pdf.mjs: generate-pdf.mjs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in generate-pdf.generatePDF at line 1675. 30 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- generate-pdf.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":"generate-pdf.mjs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861e9da690b589170a7dbf3c86f25486bcb9214051c776cfce1aca683bb3f2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: validate-portals.mjs: validate-portals.mjs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in validate-portals.validatePortalsConfig at line 190. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- validate-portals.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":"validate-portals.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d7c23dd1b6fe0d5eb2979e7584064903e6250951a981da2b82b4a530d08847"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/data/career.go: dashboard/internal/data/career.go changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in data.NormalizeStatus at line 684. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/data/career.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"64988feb57f9535e1614706ec3e48fbd8b2968a44ebbc7a4b743197cf2ce4d08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: doctor.mjs: doctor.mjs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in doctor.onboardingState at line 1546. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- doctor.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":"doctor.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d68b6b4d146b27d85c7ca70d06e7ba7feb5cca871566508a1eaaf1ee5c49aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/pipeline-view.tsx: web/src/components/pipeline-view.tsx changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in pipeline-view.PipelineView at line 31. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/pipeline-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/pipeline-view.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e75560fd3d7c63fcf0f3b8f1a814dcb89b5910d56107d5e772f6d75dbe3408a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: liveness-browser.mjs: liveness-browser.mjs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in liveness-browser.checkUrlLiveness at line 469. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- liveness-browser.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":"liveness-browser.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed967467f57942ae83c06d39ef22df488aa121422f656a95ef3387af375f8a72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: salary-gap.mjs: salary-gap.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in salary-gap.selfTest at line 757. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- salary-gap.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":"salary-gap.mjs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e771624cf0cdd47cb164c9c1a9770d8e833586fe3db51bbe4b853f93fa3ed4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/ui/screens/pipeline.go: dashboard/internal/ui/screens/pipeline.go changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in PipelineModel.handleKey at line 564. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/ui/screens/pipeline.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a282c323d3297b26a5c9b187e9fb86b8d87153503b09b6f05a6bf45b57b3682"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/explore-provider.tsx: web/src/components/explore/explore-provider.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in explore-provider.ExploreProvider at line 132. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/explore/explore-provider.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"98929704f43ec26e6dc96cccd35466d1462c51d88f6bbb46c726b6f2491c993c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-cv-facts.mjs: verify-cv-facts.mjs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in verify-cv-facts.runCli at line 3062. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- verify-cv-facts.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":"verify-cv-facts.mjs"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5478efdbc85fe1b4ac8a61c2c1633cf5dfb018cee977df4f6cf859dda21a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: stats.mjs: stats.mjs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in stats.computePortalRecommendations at line 401. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- stats.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":"stats.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd76415ff5e02f9ef4684c8c1d9069194305d75752026638d5f71cf4f37d6ca4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/home/today-dashboard.tsx: web/src/components/home/today-dashboard.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in today-dashboard.TodayDashboard at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/home/today-dashboard.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8040417dc44834fa6f5a8b685e20014737d62d3266db9eec2e376f5d72d14611"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: check-liveness.mjs: check-liveness.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in check-liveness.main at line 159. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- check-liveness.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":"check-liveness.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc3a82aab0c8e0a9bd02c8e601910d014559b1dbaefc8b1f32421efdb31d1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/report-view.tsx: web/src/components/report-view.tsx changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in report-view.ReportView at line 48. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/report-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/report-view.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"817b4e740db922be81f80e98743538d806104d233f398866f38ce08718345bb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/inbox/inbox-triage.tsx: web/src/components/inbox/inbox-triage.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in inbox-triage.InboxTriage at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/inbox/inbox-triage.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8116432bc892c6dafc17681f19e64d537d77ea25a9a08703244ff7a9460088e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: followup-cadence.mjs: followup-cadence.mjs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in followup-cadence.analyzeFromContent at line 871. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- followup-cadence.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":"followup-cadence.mjs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a5791b2bc1d5277bbdccee1142cb6df803f4aece45f4ad4e7676d3b2760c41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/_http.mjs: providers/_http.mjs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _http.proxyFor at line 65. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/_http.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":"providers/_http.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f07f370f3d6ff63b4d6e0c4e701aac6e83421b812dffb8c0379761885545b26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: openrouter-runner.mjs: openrouter-runner.mjs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in openrouter-runner.callOpenRouter at line 254. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- openrouter-runner.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":"openrouter-runner.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a60e569b8d750958755b3e2a70a5616476b9a5ed8b29d3096c852ee718673c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: liveness-api.mjs: liveness-api.mjs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in liveness-api.checkLivenessViaApi at line 1052. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- liveness-api.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":"liveness-api.mjs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"de34cfa7f15036530bd19b1e1cf1666948ec561ffeb88f667a08af2a61d77920"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/explorer-view.tsx: web/src/components/explore/explorer-view.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in explorer-view.ExplorerView at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/explore/explorer-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explorer-view.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"789e512c209a072954b42faf95ba4470c51ba8a0eabe08fa825f6529d8fe287b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: upskill.mjs: upskill.mjs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in upskill.runSelfTest at line 584. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- upskill.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":"upskill.mjs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"3113a11ac6431cc20f1335abdb61fc89179a47333953186a087b1025a3451237"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: discover-ats.mjs: discover-ats.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in discover-ats.resolveCompany at line 682. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- discover-ats.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":"discover-ats.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6446a0a3a042552c3d6666b0c3c13188965be03ecd43a7b2534eb2ab42bc451"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/assistant/route.ts: web/src/app/api/assistant/route.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in route.POST at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/assistant/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/assistant/route.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6100daece077e6f318de39a260a6ffb58d6a90b7d1dd8c8781f4b433e1e5a5ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/explore/ai/route.ts: web/src/app/api/explore/ai/route.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in route.POST at line 48. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/explore/ai/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cbd8806974e95b2e93759198af54a23877c694d206879dceebd14facc13a18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: reply-watch.mjs: reply-watch.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in reply-watch.main at line 276. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- reply-watch.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":"reply-watch.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cbc365a6a7f27aa5017329370329d4dee02fb15573e36db322972e1d72ee91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sync-pdf-flags.mjs: sync-pdf-flags.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in sync-pdf-flags.syncTrackerPdfFlags at line 56. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- sync-pdf-flags.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":"sync-pdf-flags.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef565e864a625e769ab9ba98cdbab7f41b75ad3467535dca8d1b769ea3bfda2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: upgrade-tests.mjs: upgrade-tests.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in upgrade-tests.runLeg at line 188. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- upgrade-tests.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":"upgrade-tests.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7ceb8d12ab1a2166fd1e35cea9b96aa7438743498114f58c2aa611651e5f60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/career-ops.ts: web/src/lib/career-ops.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in career-ops.readLanguageConfig at line 613. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/career-ops.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b3de4eb06f728cc524f5192bca096a3319ec379c37ae7aa06d9a4e8930928e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browser-extract.mjs: browser-extract.mjs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in browser-extract.readDom at line 965. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- browser-extract.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":"browser-extract.mjs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc23fdddc3a44f631ef0e283985bab6cbe639d0c83ed9f78d2ff36127a0d5842"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rank-pipeline.mjs: rank-pipeline.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in rank-pipeline.main at line 361. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- rank-pipeline.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":"rank-pipeline.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7150ea1d79f988183c2b2f17de9fe4263c62a1d8f8fd1f7dd9c998c18f2cbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/workday.mjs: providers/workday.mjs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in workday.chooseSplitFacet at line 279. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/workday.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":"providers/workday.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"211e67d6b235ec4ddde381f252040d40062ac3e29a5614eb882d05827461a85b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: funnel-velocity.mjs: funnel-velocity.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in funnel-velocity.renderSummary at line 460. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- funnel-velocity.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":"funnel-velocity.mjs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"270fb9c21445f106279a01cb4d6d0e5d4ecec7dc3c4b3bbead287790026ff484"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins.mjs: plugins.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in plugins.cmdRun at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- plugins.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":"plugins.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"176f8776842247506f9418fb1dcf58e2617694a26fe7b561b861e04d963b7f6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: followup-seed.mjs: followup-seed.mjs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in followup-seed.seedFollowup at line 474. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- followup-seed.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":"followup-seed.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd8dd6b95b6fd3aa730259edd87f589b4f91d0bbed58e64a0f1adda16a0a9c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: company-history.mjs: company-history.mjs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in company-history.computeResponsiveness at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- company-history.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":"company-history.mjs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"07920402ce24a32d3530936043595caafa5d0db42db14c8abb48d49ad43f9238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tracker.mjs: tracker.mjs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in tracker.query at line 869. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- tracker.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":"tracker.mjs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2ca1c60beebdccc9b8049dd94c4a2d9ac8d4882485ff9d0acee626824b4a15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rejection-latency.mjs: rejection-latency.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rejection-latency.computeRejectionLatency at line 310. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- rejection-latency.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":"rejection-latency.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"be415bad606c851df0a9c984892a136990cfa423eb9461988617ae875cd20a25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/main.go: dashboard/main.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in appModel.Update at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/main.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/main.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df6bb9a2a46bd3628ae64bc439a20d2229958de9fd270f40ede434706899c94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/apply/apply-provider.tsx: web/src/components/apply/apply-provider.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in apply-provider.ApplyProvider at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/apply/apply-provider.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b2a3d9e6a24e221f10b72d2bee8f8f60913c195065ed0ea3d6a236e901396"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/followups/followups-view.tsx: web/src/components/followups/followups-view.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in followups-view.FollowupsView at line 86. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/followups/followups-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e43cc9c636a425b33e60e82387ddc5c142b92a28930ba8b2d255dd514758ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: reconcile-pipeline.mjs: reconcile-pipeline.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in reconcile-pipeline.reconcile at line 197. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- reconcile-pipeline.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":"reconcile-pipeline.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d60c5c68896b06c022c64cc9b234126cb804fb887cedb6a4c40b7263d678d9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: detect-reposts.mjs: detect-reposts.mjs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in detect-reposts.detectReposts at line 312. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- detect-reposts.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":"detect-reposts.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc09d9bdb31197f2edadaa4b12c16c7972e52659cbd94428fd86ee0a50e6fbb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jd-skill-gap.mjs: jd-skill-gap.mjs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in jd-skill-gap.scanJd at line 301. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- jd-skill-gap.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":"jd-skill-gap.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f917c770557f403df6a545fe2ba069253e6b534436204de5aeccbf3e69758680"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-portals.mjs: verify-portals.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in verify-portals.main at line 1139. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- verify-portals.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":"verify-portals.mjs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07cc37cf2c78a9301dbeab16c304c4f8a89259f6182fa15c3fc7cfa7075af36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/analytics-metrics.mjs: web/src/lib/analytics-metrics.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in analytics-metrics.canonicalizeArchetype at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/analytics-metrics.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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b8bbb1bb09a6a3b201a91aafa1d0e630674200248cb5e42ef1722f2a06a99e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: github-evidence.mjs: github-evidence.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in github-evidence.buildEvidence at line 225. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- github-evidence.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":"github-evidence.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369719825ccb58b68a2ba374a355295c1d3481419c67ea3dd33df5f8856d67d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan-hn.mjs: scan-hn.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in scan-hn.main at line 117. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- scan-hn.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":"scan-hn.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1649977822b9a2d8884f3130e17e440649a0d0516650eca9dcb75bc45530b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/config-form.tsx: web/src/components/config-form.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in config-form.ConfigForm at line 38. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/config-form.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b27a39699a85d02416174208022ba81dd64e3d5895bacceeec69e4eeaca9a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: invite-match.mjs: invite-match.mjs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in invite-match.matchInvite at line 761. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- invite-match.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":"invite-match.mjs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98077588675a71a478fed8d412d2c193b03383dd0e9883d04eea9126d3dbec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan-interamt.mjs: scan-interamt.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in scan-interamt.main at line 275. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- scan-interamt.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":"scan-interamt.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd6c6744cae4532192d67e833089614036a3daf412844c353ebd50122366c90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: generate-cover-letter.mjs: generate-cover-letter.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in generate-cover-letter.main at line 420. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- generate-cover-letter.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":"generate-cover-letter.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1bfb162c5af4af1caaa9e3fcb9f6ac2667c1909168f1bba8ba7d0a61ff1f7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/jobs/job-store.tsx: web/src/components/jobs/job-store.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in job-store.JobsProvider at line 64. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/jobs/job-store.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a239ebb477afb826a34fc97f7c3aef5a8aec4ce89d33ceb492783585f9503bbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: reply-matcher.mjs: reply-matcher.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in reply-matcher.matchCandidates at line 468. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- reply-matcher.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":"reply-matcher.mjs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"5974ab6a1fee4fd331a734cbda15ff3b3c09e0ffcd7e7098af6b848f2f0fe6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: audit-portals.mjs: audit-portals.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in audit-portals.main at line 379. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- audit-portals.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":"audit-portals.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"668397e2b88ab1d4656d4f03bcef180199d1701b8fd24e870f9019dcb0a82ce5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/core/scan.ts: web/src/lib/core/scan.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in scan.runScanner 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/core/scan.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"69634b8555fedad2016eb04d618c4960df9a83cd5e8a3500dc66b214f5181084"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/apply/prefill/route.ts: web/src/app/api/apply/prefill/route.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in route.POST 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/apply/prefill/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cab73ad4e0f2caa69256d5d357feee0f3502e65460115e9583a2d3038432d8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: build-cv-latex.mjs: build-cv-latex.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in build-cv-latex.runSelfTest at line 288. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- build-cv-latex.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":"build-cv-latex.mjs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13bb6e3a875a9c39cdde894ffbd50faf551b5c1f7346d696e7fe06eaebce1b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cv-templates.mjs: cv-templates.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in cv-templates.loadAtsRules at line 268. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- cv-templates.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":"cv-templates.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e21235868d55fdc7256d71264c5605df59570c62970936cb5f8ebd5757c4a27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: weekly-digest.mjs: weekly-digest.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in weekly-digest.runSelfTest at line 393. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- weekly-digest.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":"weekly-digest.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96c9b53eda35c21d9c70c0d499ffa9744524b548aee7a0a16d7ed80bed829ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/ashby.mjs: providers/ashby.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ashby.formatLocation at line 353. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/ashby.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":"providers/ashby.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"07575e3f7e1a92b3969a0a02df912926ca48ddb91e0bb48909f1bc7476de9103"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-ats.mjs: verify-ats.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in verify-ats.auditAts at line 484. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- verify-ats.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":"verify-ats.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ca3e2ea11cd7877286adc79bd4c93e33d82807ca00efb93294f5d29b8af011"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/apply/session.ts: web/src/lib/apply/session.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in session.openSession 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/apply/session.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b1df666da12e40a3ee6e02692222464ce57784ee92f52211a375b7107ee997"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: application-answers.mjs: application-answers.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in application-answers.main at line 541. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- application-answers.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":"application-answers.mjs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"35058f1e9be0ad800fa5dc9085caf24640ed1dd234c0c2455c8e3ed59d2af7bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/cv/ingest/route.ts: web/src/app/api/cv/ingest/route.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in route.POST at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/cv/ingest/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94766c37c740ef39949e34828cff3632083bb8a6f81df5e363b2bfcf1c7f493"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/successfactors.mjs: providers/successfactors.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in successfactors.fetchCsb at line 330. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/successfactors.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":"providers/successfactors.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f968e6a35e23942c9126bea1cd72543f0515606c6da3d0b31ae207006ccbd047"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: archive-posting.mjs: archive-posting.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in archive-posting.parseCliArgs at line 113. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- archive-posting.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":"archive-posting.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84cbe517f14b15c77cd28b7a5448a0fdaa343c862c9e4e1e8cc49e2ccc95bd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: check-jd-archive.mjs: check-jd-archive.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in check-jd-archive.checkJdArchive at line 533. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- check-jd-archive.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":"check-jd-archive.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"59464775ebde1c2d595e1791ac0aa1d16b7c71d12f84d08daeb65556e1ce5c2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/scheduled-jobs-view.tsx: web/src/components/scheduled-jobs-view.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in scheduled-jobs-view.ScheduledJobsView 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/scheduled-jobs-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8932b5534bbe74eb7eff20717a2ccedf5bceb80fbeae13ced274793f81102836"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/apply-view.tsx: web/src/components/apply-view.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in apply-view.ApplyView at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/apply-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f2df1b7f26eacd0ef1f8aaaf897e17b13dc9b35addd320e8083417da343da7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: check-table-freshness.mjs: check-table-freshness.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in check-table-freshness.runSelfTest at line 353. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- check-table-freshness.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":"check-table-freshness.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"12faee5a8a55c7b99dc8fa3405565818dc852bfd354579c42d15a05985513875"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/cv/cv-ingest.tsx: web/src/components/cv/cv-ingest.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in cv-ingest.CvIngest at line 31. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/cv/cv-ingest.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6fbff9dd09e56d05ba0007274927ccef256e600b4e33d93e67f199d7190113"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: company-funded.mjs: company-funded.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in company-funded.fetchHnDiscovery at line 784. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- company-funded.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":"company-funded.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eacf1cbf62b736494708e61cfe2e41ae431df9c972e2c7eed2c87668da59be9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/recruitee.mjs: providers/recruitee.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in recruitee.parseRecruiteeResponse at line 446. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/recruitee.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":"providers/recruitee.mjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0f95da5f3c269566094ae4b26a3882ac865e6c72135f3c459db1d470b293c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: role-matcher.mjs: role-matcher.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in role-matcher.roleFuzzyMatch at line 240. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- role-matcher.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":"role-matcher.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"737a29e48d7cb28a5edc80ce07106970df4ad90eaafbb4464a466a1503170dd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/followups/cadence/route.ts: web/src/app/api/followups/cadence/route.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in route.POST at line 104. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/followups/cadence/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b935842c4fcf0e49a6ee448d6d02cd29d7960633124cfd21ef07e2baa323eb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: reserve-report-num.mjs: reserve-report-num.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in reserve-report-num.runCli at line 426. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- reserve-report-num.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":"reserve-report-num.mjs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9705dfa5441f8f04c333eb172341380245f3478489fafc63803f110b9c74c818"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: normalize-statuses.mjs: normalize-statuses.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in normalize-statuses.normalizeStatus at line 58. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- normalize-statuses.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":"normalize-statuses.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d6f5c4fa5d796df5451d156e1cdbec4eef0666f1f20a10ed2bcaee349b1920"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hired-share.mjs: hired-share.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in hired-share.main at line 325. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- hired-share.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":"hired-share.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa6882d1485ef73e8d85eab7a251c2870b2319fce0409fd1321dbbc67934272"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: url-key.mjs: url-key.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in url-key.normalizeUrl at line 297. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- url-key.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":"url-key.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb7b6b474f3738017424cf2c3aae17a091fe72a0981743ae390e814c0761533"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cli-flags.mjs: lib/cli-flags.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in cli-flags.validateFlags at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- lib/cli-flags.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":"lib/cli-flags.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea9da0c8e206860a9a2edc468d75c85c067722db44ffbc9a7a7fe791e9f0c90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/jobs/worker-card.tsx: web/src/components/jobs/worker-card.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in worker-card.WorkerCard at line 79. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/jobs/worker-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/worker-card.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4adedb19a8c2d4ee3c5a956cb2aed75d9afdec2ab5f7b209bd4bd4018f40e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/data/derive.go: dashboard/internal/data/derive.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in data.deriveNoteFields at line 158. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/data/derive.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/derive.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f5786d0de4e02aafd407c6afd4b71b5e76d3bcf68de1d83bfa273586f2cfc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: keyword-match.mjs: keyword-match.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in keyword-match.extractKeywords at line 336. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- keyword-match.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":"keyword-match.mjs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b185f987ea0227881c2962136a1bfe8803474128c7cfc944196d4a03b163903a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: calibrate.mjs: calibrate.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in calibrate.loadLedgerReached at line 287. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- calibrate.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":"calibrate.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb7f1562aa8b73d904b51453a39414adacc5a3ac115a08ed845ddf6a0fe42d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/data/stats.go: dashboard/internal/data/stats.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in data.ComputeStatsMetrics at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/data/stats.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/stats.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"473f5b3a3f4d10af8eba04cede0b80dd73902ec3441d59e403143cc51e5de890"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scaffolder/bin/cli.mjs: scaffolder/bin/cli.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in cli.main at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- scaffolder/bin/cli.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":"scaffolder/bin/cli.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6259bd7d55d4cf5335c151eeeb68a3d8d7de6d8d78b974f2de2bf76aa5b1db3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cv-sync-check.mjs: cv-sync-check.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in cv-sync-check.main at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- cv-sync-check.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":"cv-sync-check.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f12e1a61681d3501edcd51cbdaa94f73fbc63461a1b76f916ee4659ad769eb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/cv-pdf/route.ts: web/src/app/api/cv-pdf/route.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in route.GET at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/cv-pdf/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv-pdf/route.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"566b10b3073573ac32bac911a1ebcdc9af29eed6b3f761cf2bc74a6c3b2199a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: add-entry.mjs: add-entry.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in add-entry.main at line 309. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- add-entry.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":"add-entry.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d121760c511475e26bdfb1006d2ed16ff93a89de2a716d569e2b2c26584d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/smartrecruiters.mjs: providers/smartrecruiters.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in smartrecruiters.parseSmartRecruitersResponse at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/smartrecruiters.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":"providers/smartrecruiters.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f175d3c83b575d5e968bc5fafca284aec97596aa14c6ac4fdb4ab9a749f3332"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/pythonorg.mjs: providers/pythonorg.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in pythonorg.parsePythonOrgFeed at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/pythonorg.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":"providers/pythonorg.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8949e18f1787f4080ce6f262802bbf3e194c95227a282a6c6bef502a74996d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/report-persist.mjs: web/src/lib/report-persist.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in report-persist.persistEvaluation at line 194. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/report-persist.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":"web/src/lib/report-persist.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ea63a7e597c91d4c1e83bc8a833dd9e02b57153ff104ec210567e6cdb06479"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/status/route.ts: web/src/app/api/status/route.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in route.writeStatus at line 79. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/status/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/status/route.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0487aa3bad63fb1fb0bc1659e20200209e9bd51f64cfca50be368cc547734b44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/home/decision-card.tsx: web/src/components/home/decision-card.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in decision-card.DecisionCard at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/home/decision-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/decision-card.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a1940c13a8ce2aa96bbbbd6adb903c44427d99a83bf34c875f2a33da790d47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/generalist-world.mjs: providers/generalist-world.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in generalist-world.stripNonRendered 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/generalist-world.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":"providers/generalist-world.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee956a0c3dfad7df8fda29f3ac8559bbdeef6c3ec50ebc1ce88635ceee2443b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/filter-builder.tsx: web/src/components/explore/filter-builder.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in filter-builder.FilterBuilder at line 107. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/explore/filter-builder.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/filter-builder.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4c7428bb3113a2fc6f1bdca2317b4472e9f7bb231f00c10099ab01633327e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/results-list.tsx: web/src/components/explore/results-list.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in results-list.ResultsList at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/explore/results-list.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/results-list.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd93566ec912117ace3a6d829bd0fe18de6ec9a2a3b89d4201f596884f59785"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hired-wall-build.mjs: hired-wall-build.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in hired-wall-build.buildSvg at line 152. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- hired-wall-build.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":"hired-wall-build.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ca7effb22b108568920ceb2abd96a07dd9e7dd87309092ab170c3a79d35bc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/discovery-card.tsx: web/src/components/explore/discovery-card.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in discovery-card.DiscoveryCard 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/explore/discovery-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/discovery-card.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc97096366fd302ddd39c5fb6dbbadeebac040226dc1ebc359288a6d607899"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: generate-latex.mjs: generate-latex.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in generate-latex.validateLatexContent at line 104. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- generate-latex.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":"generate-latex.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"489e2945df4cee8da1569126e3001c3fb2bc3a3f0afd8111aea8cef511e1deae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: coverage-check.mjs: coverage-check.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in coverage-check.main at line 276. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- coverage-check.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":"coverage-check.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc26f0d9ac75aa10cb569a8550f8cd613911b77e7f0b0fe42b4e2c92d58071cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: assessment-log.mjs: assessment-log.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in assessment-log.main at line 504. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- assessment-log.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":"assessment-log.mjs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5387070f273e9ed0461d5d45b9600498e306172cdd545f2b2e441008bfd52e9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/analytics/view-model.mjs: web/src/lib/analytics/view-model.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in view-model.statsModel at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/analytics/view-model.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":"web/src/lib/analytics/view-model.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d44314e488a5db8a6f45372ebd9871a8693efe7f1a4f45793081c2e291c441"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/assistant-history.mjs: web/src/lib/assistant-history.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in assistant-history.cleanMessages at line 5. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/assistant-history.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":"web/src/lib/assistant-history.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cbac210e62e7ca39a7cff10a0e91de866437beb752e3cd021aa7c97e4d181d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/export-ats-text.mjs: scripts/export-ats-text.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in export-ats-text.loadProfile at line 217. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- scripts/export-ats-text.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20ca20b6151aca121f15acc153d427828554be2dec5729ac30acef753f779d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/apply/drive.ts: web/src/lib/apply/drive.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in drive.driveSession at line 161. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/apply/drive.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1e3471d2ed6437762678aeda5a7d9ba1d598b30bf04a8a857e43ce99cf2c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/portals-view.tsx: web/src/components/portals-view.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in portals-view.PortalsView at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/portals-view.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/portals-view.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeac0ebcf21c8de71778534e25b1652379946358a94b8a631a34b59063fdb135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/ui/screens/viewer.go: dashboard/internal/ui/screens/viewer.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ViewerModel.Update at line 158. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/ui/screens/viewer.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7363faa44b08bee7e0c79565b29fb151a5b3b0ef4f63c687eac00415f28f969"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-cv-structure.mjs: verify-cv-structure.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in verify-cv-structure.runCli at line 639. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- verify-cv-structure.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":"verify-cv-structure.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"553d8cd0489c9b3607e05470177f28184de965de30b6579369dcf7a9df17f539"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/home/follow-up-card.tsx: web/src/components/home/follow-up-card.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in follow-up-card.FollowUpCard at line 27. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/home/follow-up-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/follow-up-card.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5189d8447a08755f61ba16e1ff74bac2b8b69d83a829d053ef3a01c6d5c93431"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/_dns-cache.mjs: providers/_dns-cache.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _dns-cache.createCachedLookup at line 225. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/_dns-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":"providers/_dns-cache.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab2140577bae553975ab27df3532b38b2541b49d9fc422b50a39a15e56609a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/followups/cadence-settings.tsx: web/src/components/followups/cadence-settings.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cadence-settings.CadenceSettings at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/followups/cadence-settings.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d0873466ae5377ba3fb0031edb9d3d7554922873b200c44ae65df4fd5bcbe9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/beta/beta-banner.tsx: web/src/components/beta/beta-banner.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in beta-banner.BetaBanner 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/beta/beta-banner.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/beta/beta-banner.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae749b31fc9806171f26f440ea15780bef3a5ad9abc5ec6d5349531adc8e0f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/status-select.tsx: web/src/components/status-select.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in status-select.StatusEditor at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/status-select.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/status-select.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a57baf7c6c01f755eb3c43a04ebaccab14ff224151e0f846d351fdb5de30c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/jobstreet.mjs: providers/jobstreet.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in jobstreet.parseJobstreetItem at line 188. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/jobstreet.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":"providers/jobstreet.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7bf40c65fad744ee94adab42e7bf0aeb9823f0b6371056bb7bb8f0f6838fbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: classify-tier.mjs: classify-tier.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in classify-tier.classifyTier at line 30. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- classify-tier.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":"classify-tier.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"583325d67d002f16791e99c0366857826e68630c8348ab48df46df1f17c2e5f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/cv-studio/section-card.tsx: web/src/components/cv-studio/section-card.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in section-card.BulletRow at line 121. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/cv-studio/section-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-studio/section-card.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"271430b34a98b0630a13111d3f54edf1df94e647b4723fd59c61c9c345656d62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/followups/log/route.ts: web/src/app/api/followups/log/route.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in route.POST at line 31. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/followups/log/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce3aaf875015c57de65547e2f2c18746aafc82fa8241baf64bcbde2df7249dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/whats-new/route.ts: web/src/app/api/whats-new/route.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in route.GET at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/whats-new/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/whats-new/route.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a625176b85cd7f3d5484006e8ac0e3fa72619838d8e889717617ea308bdcf285"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/workable.mjs: providers/workable.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in workable.parseWorkableWidget at line 263. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/workable.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":"providers/workable.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b7028f1f166ef1a10f2b6919ab034b8d4a803ce154c53453eb3edc0dbe63f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/mobile-nav.tsx: web/src/components/mobile-nav.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in mobile-nav.MobileNav at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/mobile-nav.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/mobile-nav.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed132b814a8bdc7b8c40304dc676cd078037ae6d8dd3176b85abb885c895f0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/latex-escape.mjs: lib/latex-escape.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in latex-escape.escapeLatex at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- lib/latex-escape.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":"lib/latex-escape.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aadf83b4e378c3abea326e46e7a79a09ccfcb3331e43cd9e785f20a0dacf2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/core/url-key.mjs: web/src/lib/core/url-key.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in url-key.normalizeUrl at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/core/url-key.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":"web/src/lib/core/url-key.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b546cec004757e03baf7764804c399539ac5a41102ebc3635d043cb8c2f16b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/scheduled-scans/job-card.tsx: web/src/components/scheduled-scans/job-card.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in job-card.JobCard at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/scheduled-scans/job-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/job-card.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a70e3a2327325d60f90201f270dd3995647fbb1e90fcfe59804f0e988e30e98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: patch-latex-content.mjs: patch-latex-content.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in patch-latex-content.main 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- patch-latex-content.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":"patch-latex-content.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5668bcd86de9118a10f0489b66dbab848dca9cbb096e6cb477cecbda9a3009f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/apply/drive/route.ts: web/src/app/api/apply/drive/route.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in route.POST at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/apply/drive/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"836d9bf9e990fa347cdb9f58e5f7aadf8c1e7458c4e8cc02ac2339291b3e801e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/inbox/triage-row.tsx: web/src/components/inbox/triage-row.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in triage-row.TriageRow at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/inbox/triage-row.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/triage-row.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"436648a2521e61d4cd555bf3b21d215302125feb62de0b15195d757eba999c9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/tracker/delete/route.ts: web/src/app/api/tracker/delete/route.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in route.POST at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/tracker/delete/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/tracker/delete/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e180577b6032ccde41931d8ab89accf72f4cdfa284e85928f8b97194e76b9baf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/explore/route.ts: web/src/app/api/explore/route.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in route.POST at line 18. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/explore/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/route.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f810f7048a567aaffca95621627be4a5ff48ea9f534758846d467722db402467"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/data/pdf.go: dashboard/internal/data/pdf.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in data.LoadPDFManifest at line 157. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/data/pdf.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b47def328f16e952a2cce0d4d43de4b92b1139f926488a18bf4749dd4fadde"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/data/status_writer.go: dashboard/internal/data/status_writer.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in data.runStatusWriter 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/data/status_writer.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/status_writer.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf887d2905ce2f513bd11550cf4cd0251b08dd7497ab548d9871f618e17ff38b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/pipeline-sankey.mjs: web/src/lib/pipeline-sankey.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in pipeline-sankey.classifyLeaf 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/pipeline-sankey.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":"web/src/lib/pipeline-sankey.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4c09cd6a8e587fc57d3dcdc16245fecc9a94b90707112140e8b8c5e31108d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/posting-url.mjs: web/src/lib/posting-url.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in posting-url.markdownLinkTargets at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/posting-url.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":"web/src/lib/posting-url.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"48357470636baf8db12d58438b49642dcd1e9535a728b2c3ea09685d6727e8f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/portals/verify/route.ts: web/src/app/api/portals/verify/route.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in route.GET at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/portals/verify/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/portals/verify/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"50655a99f5db064a728aa8120791060fe4b8b882eee3efda58626cd9a5412789"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/thehub.mjs: providers/thehub.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in thehub.normalizeHubJob at line 81. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/thehub.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":"providers/thehub.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"937eb9ead4609885eeb0a4b05dc8473275f5c3e2f268df47ae9af8c7c18750a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: onboard-write.mjs: onboard-write.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in onboard-write.buildPortals at line 259. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- onboard-write.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":"onboard-write.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b855746bf5a43f15fd330a30f693da99ce978b4611c0b19f09e2c7a8906f76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/origin-guard.mjs: web/src/lib/origin-guard.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in origin-guard.checkRequest at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/origin-guard.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":"web/src/lib/origin-guard.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbcdad7cc7de28294adca77a2d3b96b208754069a53025a26b03973e2642bce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/local-parser.mjs: providers/local-parser.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in local-parser.normalizeParserJob at line 185. 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-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/local-parser.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":"providers/local-parser.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"945c5f3128cd531857f13cbe6d32549207960347563996b6cbde7e22e6b88460"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test-all.mjs: test-all.mjs changed 225 times in last 90 days and 119 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is test-all.extractRenderHtmlToPdfOptions at line 2798), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(doctor): do not assume claude when other CLIs are on PATH (#6044)\u201D; \u201Cfix(liveness): a short page with no closure evidence is uncertain, not expired (#5999)\u201D; \u201Cfix(dashboard): a \u0022\u2014\u0022 or \u0022N/A\u0022 URL cell is not a posting URL (#5872)\u201D; \u201Cfix(test-all): report a node:test suite killed for time as killed, not exit ? (#5812)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- test-all.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":"test-all.mjs"},"region":{"startLine":2798}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd9b8595e857863a8a73b31dc933ffc2618e3981b4f50aab103d49963f43638"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tracker-utils.mjs: tracker-utils.mjs changed 34 times in last 90 days and 25 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is tracker-utils.findDeadReportLink at line 153), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dedup): promote a status without its bold or date, so the ledger reads it (#5859)\u201D; \u201Cfix(dedup): read a row\u0027s posting URL from its report when it has no URL cell (#5855)\u201D; \u201Cfix(add-entry,fix-slugs): replace cv.md and portals.yml atomically (#5552)\u201D; \u201Cfix(status): run set-status\u0027s hooks for reply-watch and dedup-tracker status changes (#5536) (#5538)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- tracker-utils.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":"tracker-utils.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"832d4d602cb376731361900c3d4fea140bf7da5560b6c9733b4ec1c340f43d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: set-status.mjs: set-status.mjs changed 30 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is set-status.resolveRow at line 452), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(set-status): match a company when only the legal suffix differs (#6043)\u201D; \u201Cfix(set-status): name the tracker path a first evaluation creates (#6045)\u201D; \u201Cfix(status): run set-status\u0027s hooks for reply-watch and dedup-tracker status changes (#5536) (#5538)\u201D; \u201Cfix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- set-status.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":"set-status.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a515525994b29b65102eace5cc8bae64e4243b444009e755e0133bccf80539"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: verify-pipeline.mjs: verify-pipeline.mjs changed 25 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is verify-pipeline.extractRole at line 329), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(verify-pipeline): don\u0027t flag anonymous rows from different agencies as duplicates (#6070)\u201D; \u201Cfix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)\u201D; \u201Cfix: treat comment-only YAML config as empty instead of crashing (#5464)\u201D; \u201Cfix(tracker): resolve report links from a symlinked tracker\u0027s own folder (#5374) (#5375)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- verify-pipeline.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":"verify-pipeline.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed368c79c77a7535baf0858662362eccac781c9474deb7dd216efe5b1bace92e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: dedup-tracker.mjs: dedup-tracker.mjs changed 21 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is dedup-tracker.roleMatch at line 349), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dedup): promote a status without its bold or date, so the ledger reads it (#5859)\u201D; \u201Cfix(dedup): carry a posting URL the kept row lacks over from the removed row (#5881)\u201D; \u201Cfix(dedup): read a row\u0027s posting URL from its report when it has no URL cell (#5855)\u201D; \u201Cfix(status): run set-status\u0027s hooks for reply-watch and dedup-tracker status changes (#5536) (#5538)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dedup-tracker.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":"dedup-tracker.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"35456ece57076c36597faead9069c851a844dcae995da96bbe441bdc6169c14f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: batch-evaluate-gemini.mjs: batch-evaluate-gemini.mjs changed 14 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is batch-evaluate-gemini.processOffer at line 262), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(liveness): --discard-expired closes a row only on closure evidence (#5852)\u201D; \u201Cfix(eval): pass modes/_custom.md to the standalone evaluators (#5754)\u201D; \u201Cfix(eval): archive the verbatim JD in gemini, batch-gemini and openrouter reports (#5671)\u201D; \u201Cfix(batch): drop stray bot comments from Gemini report headers (#5550)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- batch-evaluate-gemini.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":"batch-evaluate-gemini.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f334a01eb0e6a19c252a1e25af333a95cde9f2c0eef9ce5b64a888dfe82d10a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pipeline-lock.mjs: pipeline-lock.mjs changed 14 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is pipeline-lock.acquirePipelineLock at line 59), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(locks): one directory-lock protocol in lib/dir-lock.mjs, used by every core lock (#5389)\u201D; \u201Cfix(pipeline-lock): make OWNERLESS_GRACE_MS env-overridable, fixing flaky test 16 (#4557)\u201D; \u201Cfix(lock): clamp the retry backoff to the per-holder deadline (#4402)\u201D; \u201Cfix(locks): share the waiting half of the protocol with the three lock copies\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- pipeline-lock.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":"pipeline-lock.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"243aef101a9cdc9f1c97f2d0509aaf2e6974a4a1d646c43a87d5b591d4ce1655"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: openai-eval.mjs: openai-eval.mjs changed 15 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is openai-eval.readFile at line 252), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: prefer MiniMax Flash in text evaluation (#5531)\u201D; \u201Cfix(openai-eval): send the session and user-agent headers OpenCode Go asks for (#5825)\u201D; \u201Cfix(eval): pass modes/_custom.md to the standalone evaluators (#5754)\u201D; \u201Cfix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- openai-eval.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":"openai-eval.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1c18db4983587e4975caa27137bec5e4b9f21a3a3f819d3156bb8d724ecc62"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: outcome.mjs: outcome.mjs changed 12 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is outcome.archivedCopyVerified at line 638), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(outcome): key the posting archive by report number and read the URL column (#5882)\u201D; \u201Cfix(outcome): never record an outcome on a row the selector does not name (#5861)\u201D; \u201Cfix(outcome): reject a missing explicitly selected CV artifact (#5273)\u201D; \u201Cfix(outcome): journal a status only after tracker confirmation (#5272)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- outcome.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":"outcome.mjs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1e79d586b01448fe75edd87100bc2a447b9beb4b018eab8ce4d7c0ba724fb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gemini-eval.mjs: gemini-eval.mjs changed 11 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is gemini-eval.validateEvaluationShape at line 302), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(eval): pass modes/_custom.md to the standalone evaluators (#5754)\u201D; \u201Cfix(eval): archive the verbatim JD in gemini, batch-gemini and openrouter reports (#5671)\u201D; \u201Cfix: treat comment-only YAML config as empty instead of crashing (#5464)\u201D; \u201Cfix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- gemini-eval.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":"gemini-eval.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28af8370c5a03441d270f72d99f36c7c009d9fd5e888f56f70015ef2fca4176"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/run-prompts.mjs: web/src/lib/run-prompts.mjs changed 12 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is run-prompts.buildPrompt at line 107), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): name the resolved profile path in agent prompts under CAREER_OPS_PROFILE (#5588)\u201D; \u201Cfix(web): deny Write/Bash when evaluating untrusted JDs (#3629)\u201D; \u201Cfix(web): preserve report identity when generating tailored PDFs (#4104)\u201D; \u201Cfix(web): resolve the CV template from cv.template on dashboard runs (#4035)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/run-prompts.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":"web/src/lib/run-prompts.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bcd9032d16809197e696e0a6db713416e1b6de128b05e40752961ed0a423ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: ollama-eval.mjs: ollama-eval.mjs changed 8 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ollama-eval.readFile at line 181), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(eval): pass modes/_custom.md to the standalone evaluators (#5754)\u201D; \u201Cfix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)\u201D; \u201Cfix(eval): date reports with the local calendar day, not the UTC one (#4227)\u201D; \u201Crefactor(eval): single-source the tracker-addition helpers, and fix the fifth site no copy-scan could find (#3796) (#3906)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- ollama-eval.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":"ollama-eval.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f7e798c504f7d89c54742eb03a48a66f8ad6d35faac6f4f673475891b4fc28"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/actions/registry.ts: web/src/app/actions/registry.ts changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is registry.coerceProfile at line 76), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): show unknown statuses instead of counting them as evaluated (#6129)\u201D; \u201Cfix(web): show when the assistant\u0027s profile or scan-target write fails (#5641)\u201D; \u201Cfix(web): confirm before remember writes to the profile (#5456)\u201D; \u201Cfix(web): preserve failed status confirmations for human retry (#5422)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/actions/registry.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/actions/registry.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e3920de79a8cb2363d27835d35789a88568b9da14b37fb810d7581f613fe30"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/clis.ts: web/src/lib/clis.ts changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is clis.searchDirs at line 79), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): fall back from a stale saved cliId on every AI route, not just Run (#4638)\u201D; \u201Cfix(web): give grok a parser, and make the token fold per-CLI (#2689)\u201D; \u201Cfix(web): find Grok in its default install dirs, not only on PATH\u201D; \u201Cfix(web): keep Codex JSONL \u002B exit code authoritative for web scoring (#2102)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/clis.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/clis.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3603ef047105c6cb0390de0ea46823bd23c1695685cfc1fcd648ebb64ed37c02"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: find.mjs: find.mjs changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is find.findMatches at line 161), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)\u201D; \u201Cfix(tracker): keep the pdf check when a re-eval\u0027s prior pdf is still on disk (#5128)\u201D; \u201Cfix(sync-pdf-flags): set the PDF flag only while the CV PDF is on disk (#4777) (#4565)\u201D; \u201Cfix(generate-pdf): key the PDF manifest on report number and artifact kind (#3959)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- find.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":"find.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"28083515a592c93fb84bc655f3219e300e3fe7f3ebfc954ca9514709e3b35574"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/cli-fencing.mjs: web/src/lib/cli-fencing.mjs changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is cli-fencing.assertCodexArgvUnfenced at line 239), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): normalize Codex config keys and stop the probe hanging on a held pipe\u201D; \u201Cfix(web): tighten Codex fencing validation\u201D; \u201Cfix(web): harden post-merge fencing checks\u201D; \u201Cfix(web): make the fencing probe suite portable, and close two scan gaps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/cli-fencing.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":"web/src/lib/cli-fencing.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a18cb5377d2af4521015889f0d486706dad1afefb50137d728ddb95a5c01e86"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: theme-style.mjs: theme-style.mjs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is theme-style.readLockedSections at line 97), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: treat comment-only YAML config as empty instead of crashing (#5464)\u201D; \u201Cfix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)\u201D; \u201Cfix(templates): make job_break_inside an opt-in style token (#3789)\u201D; \u201Cfix(templates): make the CV template\u0027s second hardcoded color themeable (#3699)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- theme-style.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":"theme-style.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c52bf10792788daa28e1e1f950a9b346a612cc1fa4bd604f82589115b7268c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/cli-fencing-probe.mjs: web/src/lib/cli-fencing-probe.mjs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is cli-fencing-probe.readCliHelp at line 63), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): launch every remaining web child process without a console (#5902)\u201D; \u201Cfix(web): normalize Codex config keys and stop the probe hanging on a held pipe\u201D; \u201Cfix(web): tighten Codex fencing validation\u201D; \u201Cfix(web): harden post-merge fencing checks\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/cli-fencing-probe.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":"web/src/lib/cli-fencing-probe.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdad2f1f750a752654ae0052ef609bef11365d4d1ca7fc436acca3d2f0133f0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: dashboard/internal/i18n/catalog.go: dashboard/internal/i18n/catalog.go changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Catalog.StatusLabel at line 217), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dashboard): no average score in the headers when nothing is scored (#5885)\u201D; \u201Cfix(dashboard): show work modes through the language catalog (#5557)\u201D; \u201Cfix(dashboard): the language key cannot reach Spanish, and strands a Spanish user in English (#4944)\u201D; \u201Cfix(dashboard): DATE column shows the latest status change, not the eval date (#4817)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/i18n/catalog.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/i18n/catalog.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f11834bb72fb6b912a200bbb1cd377e4caf3e64cc469dae8ceffc6f0ed0e98"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/greenhouse.mjs: providers/greenhouse.mjs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is greenhouse.resolveApiUrl at line 39), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): read Greenhouse and Ashby board slugs from the parsed careers_url (#5880)\u201D; \u201Cfix(greenhouse): resolve legacy boards.greenhouse.io careers_url (#4195)\u201D; \u201Cfix(providers): read greenhouse embed slug, support myworkdaysite boards (#4515)\u201D; \u201Cfix(scan): opt-in location-aware company\u002Brole dedupe (#3751)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/greenhouse.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":"providers/greenhouse.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"85226b521c40f2e2c2c67ca7d54a40e465e99d0eecfafbb6565a4e61bd42cd49"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/tracker-table.mjs: web/src/lib/tracker-table.mjs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is tracker-table.loadHeaderAliases at line 63), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): tell an empty tracker apart from a search with no matches (#6054)\u201D; \u201Cfix(web): read a header-mapped tracker with fewer than eight columns (#5635)\u201D; \u201Cfix(web): the web tracker reader drops the Apply Link and Follow-up columns (#3603)\u201D; \u201CFix web status filters for external data roots (#4410)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/tracker-table.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":"web/src/lib/tracker-table.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"117b80afebf11f099ccef1bd27beb5eda99dd5ad3a807fde6306dcb50eda5069"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: discover-new-companies.mjs: discover-new-companies.mjs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is discover-new-companies.candidates at line 220), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): handle --flag=value form in discover-new-companies, company-funded, prepare-application (#5851)\u201D; \u201Cfix(discover-new-companies): skip companies tracked by board (#5539)\u201D; \u201Cfix(discover-new-companies): stop cutting piped output at 64 KiB (#5541)\u201D; \u201Cfix: treat comment-only YAML config as empty instead of crashing (#5464)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- discover-new-companies.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":"discover-new-companies.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c97f43e5fbbffb15ec86b9668efc4200051b2c8323cd8c0769a492a5811711"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: story-provenance-check.mjs: story-provenance-check.mjs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is story-provenance-check.runSelfTest at line 729), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(story-provenance): check story-bank figures by unit and sentence, and keep user-cannot-confirm figures out of negotiation, ATS and interview output (#5355)\u201D; \u201Cfix(cli): --help was discarded, so the script ran instead (#3998)\u201D; \u201Cfix(story-bank): stories an evaluation adds aren\u0027t invisible to npm run star anymore (#4684)\u201D; \u201Cfix(story-provenance): anchor the Provenance marker to the start of its line (#4865)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- story-provenance-check.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":"story-provenance-check.mjs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33b4651c534cc51b42d43eace898afd28fe381fd7f2a6928bf3f2ed64ded22a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/radancy.mjs: providers/radancy.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is radancy.parseLegacyResults at line 217), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(radancy): read a bare location class in the legacy markup (#5824)\u201D; \u201Cfix(radancy): read a sibling job-location element in the legacy markup (#4689)\u201D; \u201Cfix(providers): radancy stops trusting totalResults, cache-busts JSON, retries every fetch (#3839)\u201D; \u201Cfix(providers): route softgarden and radancy through the shared entity decoder (#2487)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/radancy.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":"providers/radancy.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf41c1a3f87e8b8d24489db354b40f9b9069c1bdf57f5b7d5fa2efc823e0967"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: openai-tailor.mjs: openai-tailor.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is openai-tailor.readFile at line 162), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tailor): keep generated CVs distinct per application report (#5439)\u201D; \u201Cfix: treat comment-only YAML config as empty instead of crashing (#5464)\u201D; \u201Cfix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)\u201D; \u201Cfix(deps): make js-yaml imports work on both 4.x and 5.x (#2656)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- openai-tailor.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":"openai-tailor.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee8b8ddf9e727b8e92c5fdb3190702317d71786000e4565f5b8a55782d4f3f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/phenom.mjs: providers/phenom.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is phenom.resolveConfig at line 75), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): tag page-cap and failed-page truncation on eightfold, jibeapply, phenom, rippling, pageup, join (#5327)\u201D; \u201Cfix(providers): a lone surrogate in one id/slug no longer aborts the whole page\u201D; \u201Cfix(providers): decode HTML entities in titles before matching so encoded ampersands stop dropping jobs (#2923)\u201D; \u201Cfix(providers): phenom pagination/retry fixes, drop dead auto-detection (#2669)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/phenom.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":"providers/phenom.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"22af6304e1e54b75561f976a90e8a79a5e806b969c880fdba8e6a44e3563d8c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skill-extract.mjs: skill-extract.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is skill-extract.mentionsFineTuning at line 414), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(jd-skill-gap): keep multi-word skills whole and flag unread Chinese requirements (#5294)\u201D; \u201Cfix(skill-extract): count \u0022fine-tuning\u0022 only where it names the ML skill (#4761)\u201D; \u201Cfix(skill-extract): read the other spellings of AI/ML skills a CV uses (#4755)\u201D; \u201Cfix(upskill): add testing \u002B observability terms to the skill vocabulary (#4343)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- skill-extract.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":"skill-extract.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a619c93d835a3418c8a2c28f1886f3e4611aa6ac6d66144275d20538b21591"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/icims.mjs: providers/icims.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is icims.pickLocation at line 229), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scan-ats-full): a later-page iCIMS failure is not a dead-board miss (#5045)\u201D; \u201Cfix(icims): stop doubling the careers- prefix on iCIMS board hosts\u201D; \u201Cfix(icims): read every jobLocation entry when picking the location (#3728)\u201D; \u201Cfix(providers/icims): fill a missing location from the posting\u0027s JSON-LD\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/icims.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":"providers/icims.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98337b218b47a98f59e675c6ede713cc30614b72db4c23df40d5fd18c0b983d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: prepare-application.mjs: prepare-application.mjs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is prepare-application.detectAts at line 105), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prepare): accept canonical Greenhouse job board hosts (#6025)\u201D; \u201Cfix(prepare-application): accept inline URL arguments (#5850)\u201D; \u201Cfix(cli): handle --flag=value form in discover-new-companies, company-funded, prepare-application (#5851)\u201D; \u201Cfix(prepare): read valid quoted and commented profile YAML (#5276)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- prepare-application.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":"prepare-application.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff1726d962d22c081a9713a421b78603d2ed7202aad761425015e3e3b9c44e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/context-budget.mjs: lib/context-budget.mjs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is context-budget.compressSharedContext at line 188), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: prefer MiniMax Flash in text evaluation (#5531)\u201D; \u201Cfix(eval): pass modes/_custom.md to the standalone evaluators (#5754)\u201D; \u201Cfix(eval): preserve candidate source-of-truth rules during compression (#5033)\u201D; \u201Cfix: use model-aware MiniMax context budgets (#4650)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- lib/context-budget.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":"lib/context-budget.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45e7a3c76e2a164c6fab96543bfbd32cb41b50d706b09e1df67ae8586128df6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/core/pipeline.ts: web/src/lib/core/pipeline.ts changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is pipeline.addOffersToPipeline at line 39), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): launch every remaining web child process without a console (#5902)\u201D; \u201Cfix(web/explore): preserve posting dates when adding to pipeline (#5690)\u201D; \u201Cfix(web): report a crashed pipeline writer instead of added:0 (#5636)\u201D; \u201Cfix(web): stamp pipeline first_seen with the local day, not UTC (#3081)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/core/pipeline.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/pipeline.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0d9d5461e1a89e3cc2cbf9ee5aad2a48525a26782ba19b70c7f4cb49caef94"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/profile/route.ts: web/src/app/api/profile/route.ts changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is route.patchToProfile at line 44), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep profile.yml comments on profile and cadence saves (#5678)\u201D; \u201Cfix(web): read and write the profile CAREER_OPS_PROFILE names (#5096)\u201D; \u201Cfix(web): validate profile updates before writing (#4500)\u201D; \u201Cfix(web): preserve profiles with invalid YAML root shapes (#4108)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/profile/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/profile/route.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc72288092a1e07f1403a00bac3db93e94fead035a45fe6639bbbd5248c797e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/portals/route.ts: web/src/app/api/portals/route.ts changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is route.POST at line 20), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep portals.yml comments when /api/portals saves the role filters (#5646)\u201D; \u201Cfix(web): honor CAREER_OPS_PORTALS on portals page and API (#5360)\u201D; \u201Cfix(web): answer 400, not 500, when a JSON body is not an object (#5188)\u201D; \u201Cfix(web): preserve a malformed portals.yml instead of overwriting it with the example\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/portals/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/portals/route.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a07826e3b5000921997725059ea1cb70243e8f78a2c278707c23f0d108e5b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/apply/cv.ts: web/src/lib/apply/cv.ts changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is cv.resolveTailoredCv at line 16), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): match padded pipeline ids to tracker rows numerically (#5156)\u201D; \u201Cfix(web): pre-fill apply answers from the CV attached to the same form (#4404)\u201D; \u201Cfix(web): resolve the tailored CV for THIS application, not the newest for the company\u201D; \u201Cfix(web): require the cv- prefix so the tailored-CV resolvers stop returning the cover letter (#2156)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/apply/cv.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/cv.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2106cdf356bbcef744051fa640296bb81710886c5762ec214049b862daa217ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: validate-system-paths-coverage.mjs: validate-system-paths-coverage.mjs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is validate-system-paths-coverage.covered at line 116), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(updater): ship user-directory scaffolds safely (#4741)\u201D; \u201Cfix(updater): drop SIGNATURES.md from SYSTEM_PATHS so a new signature stops reading as system drift (#4074)\u201D; \u201Cfix(coverage): exclude the local-paths declaration file so a fork can commit it\u201D; \u201Cfix(update): reconcile .gitignore on apply so new ignore rules reach existing installs (#2857)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- validate-system-paths-coverage.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":"validate-system-paths-coverage.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed53397e49c81830cd954fd10f179d779ebc793edbd38772f6a39a44ae04c26d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/pdf-render.mjs: web/src/lib/pdf-render.mjs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is pdf-render.pdfRunOutcome at line 48), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): launch every remaining web child process without a console (#5902)\u201D; \u201Cfix(web): surface a successful render\u0027s warnings instead of dropping them (#3995)\u201D; \u201Cfix(web): ignore nonfatal CLI stderr on clean run exit (#1974)\u201D; \u201Cfix(web): take Write/Edit away from the dashboard\u0027s pdf mode (#2508)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/pdf-render.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":"web/src/lib/pdf-render.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5844ff3821306a15a193e8afeefdcf6fa5904592fc57d1ea7415d3547db47bb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: portal-health-lock.mjs: portal-health-lock.mjs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is portal-health-lock.acquirePortalHealthLock at line 49), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(locks): one directory-lock protocol in lib/dir-lock.mjs, used by every core lock (#5389)\u201D; \u201Cfix(locks): one recovery judgment, imported by all three copies\u201D; \u201Cfix(locks): share the waiting half of the protocol with the three lock copies\u201D; \u201Cfix(locks): the other two copies of the protocol had the same Windows bug (#3033)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- portal-health-lock.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":"portal-health-lock.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"57267a97c1122297518263cc6c1ff493cd0adf7447fa1e05937d422f85e91809"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: negotiation-roi.mjs: negotiation-roi.mjs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is negotiation-roi.analyze at line 345), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(story-provenance): check story-bank figures by unit and sentence, and keep user-cannot-confirm figures out of negotiation, ATS and interview output (#5355)\u201D; \u201Cfix(cli): --help was discarded, so the script ran instead (#3998)\u201D; \u201Cfix(story-bank): stories an evaluation adds aren\u0027t invisible to npm run star anymore (#4684)\u201D; \u201Cfix(story-bank): three readers, three roots \u2014 and a safety gate split across two (#3985)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- negotiation-roi.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":"negotiation-roi.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"75041039a55121b45382fd2b4506edb1e45995637c728d78d6de1e730f93d923"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: paste-reply.mjs: paste-reply.mjs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is paste-reply.main at line 216), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(paste-reply): serialize concurrent appends so no reply candidate is dropped (#4922)\u201D; \u201Cfix(tracker): resolve tracker paths via resolveTrackerPath(DATA_ROOT) across CLI tools (#4087) (#4088)\u201D; \u201Cfix(data-root): hired-share, reply-watch and paste-reply resolve the configured data root (#4571)\u201D; \u201Cfix(rename-sync): migrate 5 vulnerable call sites to renameSyncWithRetry (#3046)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- paste-reply.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":"paste-reply.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8b6a4f8ed523c479162b3a29942a53d64c43d8d18a892a4dfdb2caf54fccbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/evaluation-mode-parity-helpers.mjs: tests/evaluation-mode-parity-helpers.mjs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is fenceParts at line 92), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(modes): pass posting values to archive and keyword commands as argv, not shell text (#5853) (#5927)\u201D; \u201Cfix(modes): embed the ATS keyword coverage block in six localized evaluation modes (#5923) (#5924)\u201D; \u201Cfix(modes/tr): write English report header labels and unfreeze is-ilani.md (#3828) (#5845)\u201D; \u201Cfix(modes): bring eleven localized evaluation modes to the A-H report structure (#5843) (#5844)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- tests/evaluation-mode-parity-helpers.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":"tests/evaluation-mode-parity-helpers.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aa429812b19bcb5d5d1cf6cf23443b8a3d58f99e9e70ca20b558cd64e765a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/arbeitsagentur.mjs: providers/arbeitsagentur.mjs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is arbeitsagentur.normalizeJob at line 166), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): arbeitsagentur home-office filter, remote marker for 100 % home office, all posting locations (#6006)\u201D; \u201Cfix(arbeitsagentur): make angebotsart configurable so Werkstudent/Praktikum searches return results (#5788)\u201D; \u201Cfix(providers): a lone surrogate in one id/slug no longer aborts the whole page\u201D; \u201Cfix(arbeitsagentur): move to the v6 Jobsuche API (#2494)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/arbeitsagentur.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":"providers/arbeitsagentur.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b35a5a5fb23300c8d3741b2682e9851ded971d62a9376850449a2d8f1c1c55f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: match-star.mjs: match-star.mjs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is match-star.formatAts at line 178), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(story-provenance): check story-bank figures by unit and sentence, and keep user-cannot-confirm figures out of negotiation, ATS and interview output (#5355)\u201D; \u201Cfix(story-bank): stories an evaluation adds aren\u0027t invisible to npm run star anymore (#4684)\u201D; \u201Cfix(story-bank): three readers, three roots \u2014 and a safety gate split across two (#3985)\u201D; \u201Cfix(match-star): score a non-English story bank against a question in its own language (#2848)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- match-star.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":"match-star.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"224224954d4817f37a29ae2ec27703947f35581562de62b5388aee0c50aef412"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/avature.mjs: providers/avature.mjs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is avature.resolveConfig at line 60), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): end csod and avature paging on the rows the source returned (#4885)\u201D; \u201Cfix(avature): read article--jobs cards, titled from the h3 anchor (#4559)\u201D; \u201Cfix(providers): avature preserves facet filters across pages, flags broken parses (#4252)\u201D; \u201Cfix(providers): raise inter-page pacing to 250 ms on the eight providers still at 150 (#3095)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/avature.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":"providers/avature.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4044cc90072eee1adc260af34e8cae8e773b52a948f7176abc979d1d48017bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/tkms.mjs: providers/tkms.mjs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is tkms.parseQuery at line 105), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tkms): re-encode the config locale, hoisted out of the row loop to fail loud\u201D; \u201Cfix(providers): coerce before the try; drop tkms encode of the config locale\u201D; \u201Cfix(providers): a lone surrogate in one id/slug no longer aborts the whole page\u201D; \u201Cfix(providers): decode HTML entities in titles before matching so encoded ampersands stop dropping jobs (#2923)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/tkms.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":"providers/tkms.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ffc731a61482a8fcf5c97c302bd9e2053c24e338d06b0e758b1f7853d7a70e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: batch-tailor.mjs: batch-tailor.mjs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is (anonymous) at line 117), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(batch-tailor): run an npm-installed claude on Windows (#5919)\u201D; \u201Cfix(batch-tailor): propagate failed worker exits (#5438)\u201D; \u201Cfix(paths): resolve user-layer files via the data root in batch-tailor, cv-templates and openrouter-runner (#4570)\u201D; \u201Cfix(batch-tailor): --min-score 4.5 was silently ignored, and the worker\u0027s pdf mode path was cwd-relative (#2961)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- batch-tailor.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":"batch-tailor.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"326531472529fbb51dd3df444443cbc97509b9df2d5f5f823031ccd9568299bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/hackernews.mjs: providers/hackernews.mjs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is hackernews.parseHnComment at line 124), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hackernews): prefer the posting link over the first URL in a comment (#5784)\u201D; \u201Cfix(scan): admit scan-hn, interamt, openrouter and plugin postings through one shared gate (#5481)\u201D; \u201Cfix(providers): decode HTML entities in titles before matching so encoded ampersands stop dropping jobs (#2923)\u201D; \u201Cfix(providers): hackernews thread lookup filters by the whoishiring tag\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/hackernews.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":"providers/hackernews.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb692999d34b1073be7ed6e017e2ae16e5ca2cf1415de06cda9c43202fc19ff2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/core/portals.ts: web/src/lib/core/portals.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is portals.seedExploreFilters at line 67), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): read and write the profile CAREER_OPS_PROFILE names (#5096)\u201D; \u201Cfix(web): block_hard survives the Explore round-trip \u2014 type, URL params, seed and serializer (#3102)\u201D; \u201Cfix(web): read target_roles with the shape it is actually written in (#2750)\u201D; \u201Cfix(deps): make js-yaml imports work on both 4.x and 5.x (#2656)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/core/portals.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/portals.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7483b059aae9ad8c7f59642c293e47280642f4581dbd11654ae221834bfb2cba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/pdf-paths.mjs: web/src/lib/pdf-paths.mjs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is pdf-paths.resolvePdfPaths at line 51), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): read and write the profile CAREER_OPS_PROFILE names (#5096)\u201D; \u201Cfix(web): preserve report identity when generating tailored PDFs (#4104)\u201D; \u201Cfix(deps): make js-yaml imports work on both 4.x and 5.x (#2656)\u201D; \u201Cfix(web): take Write/Edit away from the dashboard\u0027s pdf mode (#2508)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/pdf-paths.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":"web/src/lib/pdf-paths.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f048ec10bcf617d2236d916b831fd281faed51e2cedce51cf7a4c91070bf99"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/spawn-cli.mjs: web/src/lib/spawn-cli.mjs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is spawn-cli.spawnHeadlessCli at line 47), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): never inherit a stale console on Windows, and stop the doctor reporting a failed probe as all set up (#4253)\u201D; \u201Cfix(web): launch npm CLIs on Windows (#2626)\u201D; \u201Cfix(web): reconcile Codex fencing with the inline sandbox from #2361\u201D; \u201Cfix(web): fence agent CLIs at the spawn boundary\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/spawn-cli.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":"web/src/lib/spawn-cli.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6113480f786f50097ac3f13bac71dd6b0916ab8ac84ed2515234c8ed55cac1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/_html-to-text.mjs: providers/_html-to-text.mjs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is _html-to-text.htmlToText at line 51), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(html-to-text): a prose \u0060\u003C\u0060 after decoding is text, not a tag (#5868)\u201D; \u201Cfix(gem): strip markup before decoding entities in job descriptions (#5549)\u201D; \u201Cfix: handle quoted angle brackets while stripping HTML tags\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/_html-to-text.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":"providers/_html-to-text.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dd58e68d1089cd37ab876850cfa3c7ce446fc77735b7604049bfec14e2ffd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/worker-capabilities.mjs: web/src/lib/worker-capabilities.mjs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is worker-capabilities.capabilitiesFor at line 109), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): deny Write/Bash when evaluating untrusted JDs (#3629)\u201D; \u201Cfix(web): reconcile Codex fencing with the inline sandbox from #2361\u201D; \u201Cfix(web): handle the fencing throw and close the MCP bypass\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/worker-capabilities.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":"web/src/lib/worker-capabilities.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58c477ccb1f925f5ccfca80711e7d231714efdd4f8b90e0c9b5e30c9444c7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/pipeline/[id]/page.tsx: web/src/app/pipeline/[id]/page.tsx changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is page.ReportPage at line 10), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): preserve Pipeline filters when returning from a report (#5049)\u201D; \u201Cfix(web): resolve the tailored cover for THIS application, not the company\u0027s newest\u201D; \u201Cfix(web): enable apply from the generated pdf index\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/pipeline/[id]/page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/pipeline/[id]/page.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90ec2bf265ec06be355268a0ae18b09ab712245f13f2082a0be339c6ae21833"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/followups/route.ts: web/src/app/api/followups/route.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is route.GET at line 14), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): show upcoming follow-ups on the follow-ups page (#5129)\u201D; \u201Cfix(web): never inherit a stale console on Windows, and stop the doctor reporting a failed probe as all set up (#4253)\u201D; \u201Cfix(web): only surface follow-ups that are actually due (#2157)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/followups/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/route.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3f86ff4ade4da9d6964d8b2751c4286aec2c9f0b6ba12bb4969681505a4398"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/mjs-files.mjs: lib/mjs-files.mjs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is mjs-files.trackedFiles at line 102), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tests): a killed test run leaves no trap for the next one (#3968)\u201D; \u201Cfix(tests): guard subtree-anchored walkers against nested checkouts (#3792)\u201D; \u201Cfix(tests): skip nested checkouts by marker, not by the name .git (#3681)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- lib/mjs-files.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":"lib/mjs-files.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8412988316a2ed0ec40dccce11efd2547581177e6ab6394ec19a34ba01082d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/lever.mjs: providers/lever.mjs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is lever.resolveLocation at line 61), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers/lever): filter on the full posting text, not the intro (#4932)\u201D; \u201Cfix(providers): give the Lever board feed a 30s timeout, not the 10s default (#4284)\u201D; \u201Cfix(providers/lever): fold categories.allLocations into location\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/lever.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":"providers/lever.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c3cb69475508f80dccf5572eb7f9e99cc4cd7c4fa7e5afc6553d3a0fe9f03b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/generate-pdf-button.tsx: web/src/components/generate-pdf-button.tsx changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is generate-pdf-button.GeneratePdfButton at line 14), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D; \u201Cfix(web): show why a tailored cv was not generated next to the button (#5240)\u201D; \u201Cfix(web): enable apply from the generated pdf index\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/generate-pdf-button.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/generate-pdf-button.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a6ee7ff44d7604cc44e4773341761d53a8ee329d04beb5c8603a72358e1fda"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/jobspresso.mjs: providers/jobspresso.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is jobspresso.cleanUrl at line 53), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): move // @ts-check to line 1 in six providers (#4790)\u201D; \u201Cfix(providers): route seven RSS decoders through the shared safe entity decoder (#2818)\u201D; \u201Cfix(repo): add .gitattributes so Windows checkouts stop producing whole-file diffs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/jobspresso.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":"providers/jobspresso.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"56422e5dc44779fc7d99713d75c17b90a44c9a3c726bdfa3cbaf647931b67c22"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/saved-cli.ts: web/src/lib/saved-cli.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is saved-cli.resolveCliId at line 60), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): refresh config consumers after same-tab saves (#5807)\u201D; \u201Cfix(web): validate the saved cliId against what is installed before a run (#4019)\u201D; \u201Cfix(web): persist the default CLI at any installed count, not only a sole one (#4151)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/saved-cli.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/saved-cli.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9283c118bfd480bfc5b6181116303a76ebadf9d0c5996f725297e20410361766"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/_ip-guard.mjs: providers/_ip-guard.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _ip-guard.isBlockedAddress at line 109), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): say when a blocked host looks like a DNS filter or sandbox (#5810)\u201D; \u201Cfix(scan): support trusted proxy egress for provider requests (#4445)\u201D; \u201Cfix(providers): refuse redirects by default in _http.mjs (#4080)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/_ip-guard.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":"providers/_ip-guard.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c315454334ce07e196ab68367aa679379d35452731e63e50782a73b4fb3c3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/followups/override/route.ts: web/src/app/api/followups/override/route.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is route.DELETE at line 73), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): answer 400, not 500, when a JSON body is not an object (#5188)\u201D; \u201Cfix(web): reject malformed follow-up IDs (#3482)\u201D; \u201Cfix(web): take the core followups lock so web writes cannot race the seeder (#3034)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/followups/override/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/override/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cc6d6eb08a53e7ba9381553a7c9d195161e3388a429ee7211f93d70e6de5a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/_profile-keywords.mjs: providers/_profile-keywords.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _profile-keywords.profileTargetKeywords at line 49), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: treat comment-only YAML config as empty instead of crashing (#5464)\u201D; \u201Cfix(paths): read the profile through one CAREER_OPS_PROFILE-aware helper in the remaining core modules (#5095)\u201D; \u201Cfix(deps): make js-yaml imports work on both 4.x and 5.x (#2656)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/_profile-keywords.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":"providers/_profile-keywords.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc3435ed441124556206261a6178d5f0719be212a02076abb16ce0e02ebf148"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/csod.mjs: providers/csod.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is csod.cleanLocations at line 123), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): end csod and avature paging on the rows the source returned (#4885)\u201D; \u201Cfix(providers): decode HTML entities in titles before matching so encoded ampersands stop dropping jobs (#2923)\u201D; \u201Cfix(csod): replay bootstrap session cookies and repair fetchResponse() (#2769)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/csod.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":"providers/csod.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aef283c052158e1ed35a74c3cefca3d6495d371001f816ce930b54f63ec68e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/deutschebahn.mjs: providers/deutschebahn.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is deutschebahn.resolveConfig at line 58), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): deutschebahn returns 0 postings \u2014 an unrenderable db.jobs posting blanks the first score-sorted page (#4714)\u201D; \u201Cfix(providers): pass redirect:\u0027error\u0027 on deutschebahn requests\u201D; \u201Cfix(providers): retry transient aborts in deutschebahn and manfred\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/deutschebahn.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":"providers/deutschebahn.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"94929c7a4d74a9bc5ea6b9fe1ba6657038bb48bb614203e62d0001362ebbffb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/logo/route.ts: web/src/app/api/logo/route.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is route.GET at line 31), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): do not cache a failed logo lookup as a permanent miss (#5903)\u201D; \u201Cfix(web): the logo resolver deletes accented letters to guess a domain, and caches the miss forever (#3318) (#3319)\u201D; \u201Cfix(web): resolve company logos by name, not one guessed domain (#2942)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/logo/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/logo/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef7e350fe5806aebfd54e1dbcf98d3ac7cb433f7d82a1bbf21d7e92aa393749"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/core/logo-cache-key.mjs: web/src/lib/core/logo-cache-key.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is logo-cache-key.companyCacheKey at line 63), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): do not cache a failed logo lookup as a permanent miss (#5903)\u201D; \u201Cfix(web): the logo resolver deletes accented letters to guess a domain, and caches the miss forever (#3318) (#3319)\u201D; \u201Cfix(web): key company logos with the Unicode-aware normalizer so non-Latin names don\u0027t collide (#3134)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/core/logo-cache-key.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":"web/src/lib/core/logo-cache-key.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb5c9189c1d464c3a0bde0ed523f8de96b61e919cf94a520c0c3e4bb0bc4fcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: validate-profile.mjs: validate-profile.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is validate-profile.validateProfile at line 119), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: treat comment-only YAML config as empty instead of crashing (#5464)\u201D; \u201Cfix(paths): resolve the profile through one CAREER_OPS_PROFILE-aware helper (#5087)\u201D; \u201Cfix(validate-profile): commented-out example sections are not unknown keys (#4705)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- validate-profile.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":"validate-profile.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bd3895b658afec35ad8b347118887e9319ecc6f7ff340c6be9d97719b993fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/claude-invocation.mjs: web/src/lib/claude-invocation.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is claude-invocation.verifyClaudeArgs at line 212), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): deny Write/Bash when evaluating untrusted JDs (#3629)\u201D; \u201Cfix(web): handle the fencing throw and close the MCP bypass\u201D; \u201Cfix(web): fence agent CLIs at the spawn boundary\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/claude-invocation.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":"web/src/lib/claude-invocation.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf5cb2efe36199ca3bd90cd389f6e6113f6b878a0e84c8ae11e729928b1a3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/apply/fill/route.ts: web/src/app/api/apply/fill/route.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is route.POST at line 13), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): answer 400, not 500, when a JSON body is not an object (#5188)\u201D; \u201Cfix(web): pre-fill apply answers from the CV attached to the same form (#4404)\u201D; \u201Cfix(web): resolve the tailored CV for THIS application, not the newest for the company\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/apply/fill/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/fill/route.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3410374c289ae977bec2d6a912310f5dd1493464cdc4224b617dce5fbbfb34"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/apply/session/route.ts: web/src/app/api/apply/session/route.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is route.POST at line 14), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): answer 400, not 500, when a JSON body is not an object (#5188)\u201D; \u201Cfix(web): reject private URLs in Apply session (#3627)\u201D; \u201Cfix(web): fall back from a stale saved cliId on every AI route, not just Run (#4638)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/apply/session/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/session/route.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0651dc747d25454737917a593df0e06a69fcd6e8ef39348e8939c128a2ae31"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/higheredjobs.mjs: providers/higheredjobs.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is higheredjobs.parseHigherEdJobsFeed at line 121), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): move // @ts-check to line 1 in six providers (#4790)\u201D; \u201Cfix(higheredjobs): a walled feed is a named error, not an empty board (#4511)\u201D; \u201Cfix(providers): route seven RSS decoders through the shared safe entity decoder (#2818)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-31..2026-10-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-31 12:49:37 \u002B00:00\u0027 --until=\u00272026-10-29 12:49:37 \u002B00:00\u0027 --full-history --no-merges -- providers/higheredjobs.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":"providers/higheredjobs.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d899a6461a291640bb01958368e5c48bfe1e6dcc0a29457a1c9c8e33537a0075"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: lib/outcome-types.mjs, lib/ascii-fold.mjs, web/src/lib/core/ascii-fold.mjs, lib/outcome-dir.mjs, web/src/lib/core/company-domains.mjs, web/src/lib/whats-new-suppression.mjs, lib/placeholder-cell.mjs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf029e808f8d690ff572cfb17d3fb3fa554374ab544cdefd6674923b00df5176"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: providers/schoolspring.mjs, providers/neogov.mjs, providers/applitrack.mjs, providers/redrover.mjs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b83eeea2a9775a0da4458af88151b9e27a2c7ed088f6af2a6ed0a787d5e9b9ef"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: providers/prevueaps.mjs, providers/eploy.mjs, providers/collage.mjs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6ac47f98d8ed124cdf94109435782cee9ac8faf0f5eb86566846d041b4776a4"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 27 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (50 single-owned of 591 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 591 of the 792 production source files in this repository met that bar). They are anonymized user #4 (4 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (2 file(s)) (\u002B21 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: web/src/lib/apply/cv-match.mjs, web/src/lib/core/cv-template.mjs, web/src/lib/apply/cover.ts, web/src/lib/job-error-hint.mjs, providers/mycareersfuture.mjs, jsonc-parse.mjs, providers/nofluffjobs.mjs, providers/justjoin.mjs (\u002B28 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (158313 LoC, 382 module-visible types across 14 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"6f7e2eafe5dc1e5facb17cb524536f1661f350eedd61f5bc35764d7fc45b0521"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddc49ef52c93f5d89390c80bf8f0444bb97743496eeea781d1b7fcf904a3ea48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565cb0a25235d1502010c8d34a025c6ae5aeb826c7d5e305b97bb45399050c67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d112b6f258e061fd939d09a36e988dba2a88c73b3317b1ed425fd13ee4ef8856"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9517cc4ae56162be6ef5c2593f4757b2854c319ee602e4c89f34f65769f92a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdd80ff4efa055538dc59aafc5e380459b7d05030fbc7ee936f19fa678b3e896"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6c016eaf9ca358ce72b638edb3f0dabd386e6ade35ea0f16ccdc6b78f59194d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbeec5ea8c84aac3e5fb0bda9b3ab7ccdde682813aaeedeb58b3c27564750366"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acfbae85faa68ebe4e02bc53d248bf5ca33b9a5ba2f954f9bcd5c40982461d71"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3da0ac29c51eb4c97825431fba929cb163f1b2ca71dc0bdcca574df447813966"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6cf53afcf282421b36b49abe497a6b87e148d1a97810d2870a115773e62e59"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32e2e07c4a8d7b25c7be8e11e8502ca9bafa86eae120b35ff310d4989b641b8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d623ce18feabe498c289a6bd95a44aa79492ba63c5303aea83f316ceb2b3ada"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c379e702c45b4d0acf2e50224c00242b644f6d649710cdf9134dc6c9e26b6bb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e8bca542949bd6b73ec7011af482bd12077b2f34b1ef366fcdadebc6e56a83d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0163d5af79743dc7843f7bdf2795e2c356d1b8c714e64eb544f3b48d7bb2b78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0519a1055d1f1d571dd76b2c4d33975af0bd44ee7dcba023c8a3e51fb5e121c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ad442bcbfb707cc4dda5ca69a009097602d162ee05cfa8d9cd6455321009790"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f224e8bee1dae594c13a0033794fdd9355abb02ea63952ea60a2b5fdeec7f21"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9e4637f8f9d88fcee0a34d35c62e66b091a314c9d75d3fe2e63eec04fe7a229"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b72971ab1fc1f0635911d510ad7f7e5a802cf4dd635b28d44a19be9c1bfb5bd8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd6c420b3d829974bcc3b549c42afc15fcb53f686609492b52d0aface8b75e7b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"996375866be20ba0e04568742d2c4f5016457eaeb869e7a05f533d0146725a9e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"538b4462a8f944e60a21502f361ca1938d39b9fa1fed0ca1792a30b02d41eef0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7a31241949e07d6fc6f460055a9c961119289560a0bd8354a9c9af18a5edd85"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d51c1f014e07be271fea715c5afc1fb0ea108f0fcda9f037c833e5a316691e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"299e8cdcf39a7964e3a14151109fc327010c385fb0b49dfea11badd82511539c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe10805262b24837ba752d0bdfcc07db57d82f471076c42afcaf7cf402c69dc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1509cef75e2f950fad121c624040187ba4832f472034915daf905134f819cd76"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55a9feee9774121f2f799f78815f48406c361b20f27615a6b6c4aa576c312700"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2c63503510bd646698a535a1cc8bfae212902ffac10e52d0fd5b7357b4d0a78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b679b4d7d976e97b3d1f8dccdff92c01d63131911827b8012dd9ec51b662a28"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b86d01b31e1d7848adb2c82937a66e899ce18e5b34515d14ac815138dc3fb00"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"929889218fe2adba5577454da6e2fffb54a21f38de62c057ea511bf22abbc080"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50427f33166fe47c3af6996fdfb3a6315248dbbed6b28d4a19751d3e22d5f182"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"171d0053bd4af3abc51d2dac6e82ccae94fb79c6fd63bc05de96af12a8f61fe2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5737efc06c6e8974d9eca5116fd6fad508959b148616caec8005de3fc2426593"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e02f8d91de8417f2b7397dad9d9d0097b3c5f9f9705e4c7aab756f912a3a7b7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f0755402f96d549f9e95a0a053b7929c4f7de8d602e693a1b2eaf2122275745"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6333b23d951e0011c3c669b0813549f0a9cce09403cab57f05d536677b8c3fb8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3439437cda306bfeaced11b742b5074ff82a5ddeb80a6069a7f333fe49b77d09"},"taxa":[{"id":"CWE-117","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":"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":"70b4298bb5b2f8179f99d0119032527ef98e933e0dacd670cb84b510403a0f81"},"taxa":[{"id":"CWE-117","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":"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":"b47da069a614d2412e3bab5d75976b4b5fd9045888153801e7a5c252b816dc0f"},"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":"ffa8a41e859bc28849fad9ce45a92458ebf704d5454d3c22446bfd2de7872d57"},"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":"f361f063dc1e4127466d2ae04e10246ed273878522a8d2db43911944bc65e8e3"},"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":"0d78774291b54a9ece0d6e09524351db2e0afff37479cb20fe3bf28381af8e40"},"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":"40f1eb53fe1749f9c81a53ea1a4c5c96a4b9b754e28b94a16e7603d7a7548bac"},"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":"0b85fcb0d345a2db15e19a5dbf9abdeb83ac632ccb63a19b11d842679d2e2935"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b05a299fc55417e940aacf684662a593ba2356602d72ad47e78d7fa322f097f"},"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":"3b045ad49b4cafdf45e061e4f805370e4ebd97d4dec66890862819f1bbdf30ca"},"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":"7c6ff821d564f5ce0217a53ba81d9db11ea6431aea79f262d4399a8358cb3dc9"},"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":"c5bd808ce9dbd5b891dc826b8cc02104caee2cc6a895e5b851707b3600d01eb1"},"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":"d4c92c33fe91fda58513f406cdbb37c978737e068533d0606b19ac90797bdd04"},"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":"3448fa829639bdf3a0e2f7e9e5e7c94aefb826a61dd18b2f11d5b0cd32d3a31d"},"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":"10faa0f5aa218af8afff4d250dad13959594b1b2f62ce633049fe42509588128"},"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":"6d0a444c0c0e8e6a9165779705fee9e58924ed6e1500a7c4f5292d22b5f237ec"},"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":"fe5b41de654c66ce935a568216cd54a6342ef8410d2e65da31f09dddac7b4a24"},"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":"e743cf19918108ac2b818cfebfc831f88d187ef867aaaa2b4784ef11bc008dc8"},"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":"d31d1dcbccbcf3dbdc3b688b83cdd844e488cb8fd95189b07115a7c84c78fe77"},"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":"80fd28ce663d73281be39ff07bf74d655216e310ac80c971282853f6fb97066a"},"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":"51922a3582c14d6272f08ccb056987e2600fb46b99c5f146fc566792db33cfe7"},"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":"a0c1e701916dd5cbc6e7e29d5417acc761c2722038131d7b38c5a1f6d2f19163"},"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":"e6d3ed363e500d42767db493b2c72d858f1d3cece2a938ae9e5dd2a925de0dbc"},"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":"fc98eecd2f8fdac9dae97b5cf323ea6fba400a738394523d38a62a5d277c77d7"},"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":"b20c3ba400c49c2c665298612c77007bdaea6baeecbec192744fd0847066810e"},"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":"12e468a1ca6725dfee071b016770a80753dad7a8a479fc53d933613a4e0ebc3b"},"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":"d034a1269c011a22b02d61b8e63943892662106dc56aceb455ca51afa3141efe"},"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":"a480a30bb5e574563c711600713e2c7255c051ec1e7f7cce52c909e3dbbde86f"},"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":"399b602e1a9645368238b4bbaa5f5d94f51ca4dc0d749b78d2c6d017e9a1b69f"},"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":"321e20f36e930198208b10ff9b6dc62aec866b3097ffb0a64a31a07f78569e18"},"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":"a6888ec61907919b2c74c2e0ffb3b991b12ea345c067901e9885a160ead5d971"},"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":"ed0701881cb776950d354b163d096abc025202906d80240a200e2ab19b943afb"},"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":"e5083341c06d75b0eb62279d5fd6a1a8c7bfd0c7143c5947632fd5e34b44c964"},"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":"4e7415508dd2189e70db40dc9ccdffe47e6d39f82b504417d1efee4134b40e44"},"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":"13f13d93981269ab52d6ac2741bddaa397f95f7f8c07c730f6021b2f21e2e80a"},"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":"ba8a7e403557e918606723f74dc5b3280c5c802feec17d69df3d669bc8acb048"},"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":"33c00ba0a974c58d0e801757655aec3304eab46c9db035f2f0fb081beed3551e"},"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":"9a861f4e2754a0dd8008e767c8068b68463ce238e4ced5ba47070962aaa400bf"},"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":"e3dbf395fad3bda2336dad77164b03dda608daad657f1a11edf9e9b6ea587d3e"},"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":"0ca4c0b8e203cd15f82945f4bdf1fa5c64039e4d6f972fa3b3088f1771aa6a0f"},"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":"9d953eb59253ad4e93695a050051253434d20dc8e78199e991d9d482e44ebfe3"},"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":"1ee5dec4634df562b0b6c5a81626f577f7275037f76659570adc94dc9406ecd4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fd3b96c4daba5f3c27cec0458824d7544dcff8221b92b6628046b5fa9d00c1d4"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68a928d7b22e2a79d9462b8c7402cfe600901f5bbc7205977bd6c55e097551ae"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42eb998e27dcbe4ce00d32ce5dd2bab7b0e8ecdb3845f999346f26704f23b1bb"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d334b9c427ed491cadf9aacb016b090badd3a7529c740e99a3477cc324520aa1"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69984c934c9d51e476b6941e4fce29654042f04adc14e35a7747710351632941"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a31cbab61871b0d7b51324ef2f9b6cc12b7c39d00b6c62d4504fd1b12abd1425"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e62310b6dc0554d6442d3735ecb8766a85753bd54f5e2e35f25c32312076727"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"126d5008d9bd6e7763a3dc66eef99f9015821ccd865972ecc3b645434318868c"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80e8d37a5a7c50a988ee99eb9b4355c329ca764b7d8dbb700f0184328e06c55e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25352354485cf30b2657ec37597d702a5ccf2192eea3a3900c213a9b3ce0976a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a48c7e74ff8ac040028e8d11a478e872beaf1194f6085fa21a8cbe2491402fb7"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2dd53e1fde34fe3be147890676f278f69880f86d8378fafc8115020b6809c73"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ced57f522bd815da3ed815937d7bf0c3977b5018ca9d07f071679d17ac20327"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d033cfbbcd1f85f50e8f0df5b5d7c18883f229d4c12ccabddedfbe28027eef3c"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"177ae788c6991cb98898c784c5c958246d70bc6102254d4ac1cc6d3ac6325a76"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68936adb747272c92d668c1b484b9818f93d6941eb2f156b8707dd7ae461d021"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77fcb414c621cccb171df6b45070b06283fc03ddcd2332956e17a3682d98a05b"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7698600e6df3eb9e8a4e7c156754919cd4094e8a1a825760fcb29fe26b3b9a9"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95416eb08538dbfb5a1ce2d5be89d6662c2e04a7b56c2162b6da672a196ce994"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"74edadfa8bdb4fa44dfff2b9d61f9222dc4bbacca2c9ba9bdb122bfa5f8b9296"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"2100a67dd69ef9db584de608c70cdc1dd6cecac99830df415d635baa816ae98a"},"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":"a7f1a8a1b396f9e438160942a6c01bef3924672661f42c47d45a91c1d8e9544a"},"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":"b25396790502fa4ce7f906cd00f196da8de1339aabcb673243ec70c400c18587"},"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":"f476c831d77e52cd4ea3c735aaca08db7b02e94436974f1baa9028cc2c9f78d6"},"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":"22fc0b1bda1abf68d07a2606b2b955962632f5dadf4e6e9ead33cf1d69885a55"},"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":"6a0821d159b8b635fa07281586c6e78034e17b1bd8578b334c47ee0a1a9a88b0"},"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":"c54cb14bb9099cc92fb040d4f8cf1f8692eb9c1e12378cc1e24102122b697672"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"8b8aa9faf62e1136376120c59d2223388194ec62ef1fe6166c8190ca3a5d4de7"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b06b4a6e1623593de3c6e1f0dffd8c4d9494b80b1c4a05ad426e9c268463166b"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a1633330e061dc32054862ac4112344e0888b16e65500874ceaf734f28df521f"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ddb24a6d49d0e52c2a9987051c0bead682d2af44a3672ac4600f7cc18e444c85"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"e53d167abcf646739b3b362e81acbd3b918f493c1b11407de2c69ef93ea28db4"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"52c7276e99b169ec11aaa8d06b712ac66583d6f35e4f93d1e434289aa58308f7"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"155c41fc0439acc14bdd48a70105f44406ae2d8dd6a025e6d8a5e4a1c2841984"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a239abda1e0ff8276a9db2c114a37930bbbe6e368c5914d78b8a546e9953b58e"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"9d2b3ff7a16ca771be222bbef63020e58e5c08cd5fd3be6e9e438b9ced2bc491"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a8651c6150dc90ea5044651987d3a7e773254608c742cddbae0d585478f3c742"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"dbfcd406ec80fbf6daf9f9da78df0388653f3d3603225ec01bacbb54d5e4920a"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"3b32489a474e9e75299a7b7839a0fab590bbd347648d651078526290c2e9e62c"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"2dba8f53193f44bd00a72e4c6c1aa94b37c4cfe4e7d0aaa4cbd4e60808cd6147"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a1335ac5269bab7c056643de26f5510aeef7a59a42a89fd268d90ed596d40898"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"9f9d866c73bdd4a9aeac4cbb67537e3a012137a264931cf8286b04f465d1c136"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"fb77393445269d87ac43de514874bae0cb721a7b3ca323a30f255a508f3e521d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"c766a614b35e675b90a45a8c9f6b5315005f0f22039ea76c7d029c39fc4bf65c"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"8a5e6a2cec8c62ffe9ddcf8b4280b381bfcb963b83bb01bb67221a87de32d25f"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"14389dd09895de36d81019853bc43e6c9523f5d0cd4b23b4c8e5d048317a93f4"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"c8afff176dd0218d1360288cd3f755f03f70f69b442ab8a1bffa1744e46fba0c"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"5e4c48a95a3f16d58ff4df91b8b449f2301787f778ae8fe9a77e79af7d66a6b6"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"6b1a0b7488f22d9885c02ffb1a41cc61c0a7a26bf7f7c62ac84d17b2e609c738"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"e05e165d91b5ffb43b6777533c607f2eab2ed223c55575e63c8a226dd619dd79"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b8c05f8a43a12346a32d84128ad1c0551056f3f733c4ece9df7d3a97f8d33b8b"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"d1730df905f3b79d82d7af0f240fdfcd5f9f47b3d153151b71b83b0793ec730b"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"05eca0f1aea21dd795205afaceb4dd69126d2fb1b8008e00499fb0c38bc6dbf9"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"710334324ea4b42d4702f8817acd10558a14aba99556098d792ae56a17889955"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"f110fcdf7b11844af6b4f6ff11d6d7713adeab427bcbfb6736a08eec7f6083e8"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"4a73c628273820d285fd70c8984999b901f7afd07603985850d4656868b90ed3"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ce2f29ec06475f31b004f79bf2815bb5ff4b820969c5d77bde371452bc040c25"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b3ffc278597407fd588c21f630f5c29ea1a920bef7052d4402100a25b9b9a79b"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"f31b8c12c905137e63bbd4e640539adb6676464e5f07df215576c47f392e31f5"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"e3026b1a09e92edaf8b12cc39098060aecf7420bcbbe4758689f75d14d7fdb59"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"255724130363ab2da06fdbb062b8d7c9c55bf441abab90d3f68ddc32fd921dfd"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ae14e41683be54c8ccece1cd8000d4acf5a4587d88181a998be578e4d0f944ef"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"d775b5f5fd6fa8ecec9c0422f5eb4ca74e85fdf5e0d77ffc4d3531d575ba6ab9"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ad9ade52c7e1f01a48b0fe898a69adecd7b5bd09f99a54246bcb0dd11066ed97"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"6f3096a3f0a3e279fc10b56ae062fa3b2464d445b53689d66a086843dd3a21c5"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"44e0070dc905d637da02e577a1db788cc962675434b4ec9f91e2ffdb6a464a71"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"705d09c260f7a88badfe459441cc840ceb3f8f357b93b4acb6c56fd6168575d4"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"8ba3f7464aff0fcfe2911669a7b41a811a6899babcb1851c1f79f125b7c614df"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"65f8a6202b1942d7681c35331d6f16a1cbf824905a92e07e70449af866d5049a"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"0ad9abe335f37f272b672398b87153ac0534d10150e0362c16339fd67a4d4dbd"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b26c919d4f63e49f55f00c8768792cc5db879790ce44f497d2153b415dedb662"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"cd5910586ef56a5cebfde69e26d9deb19814133e131e0de5b317619cfac9d34d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"adb642c00ffb37f9c9134efb09592ff6e8233f2356f677293aab9819d23534b1"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ee53656fa0e8d1ff1706bb939010edb0815f1cdc243e005f0c527ac849763f5f"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"e21a76ec73f75463718c8c349b7a21510e76f80ebf6980d86adb737d73a997f4"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"97a297df11266cf13cbd2cc5f0a7ddffb8e5bfe22643e7c80cc52820f123ebf4"},"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":"870cafb0d0debd392e13f4f9fd26f014c108dd7a3f353ccbf70cd91662e884ed"},"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":"74678dbcd9c98af0bf40510c1e537a2041ec77c95dabd938af97c5d0b62c4948"},"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":"f2d2eac115aa0571f4f9ae9cfafd223e8ee01f0863ddad8fa5c94607f635b170"},"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":"28784f1021b11b6d61e6bf73d6fc83463d73c0ed9184df4d426c5fe1df32947d"},"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":"e894cd562d5004329358cd1a1d49d695f5d6c170b119f37ccd40f3996068291b"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d8cb712ce25d83b507ae17e5ed39a7603c11c3b6cfa75419cf9f76c1028a241"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.3.8","advisory":"GO-2026-5970","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6629"],"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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"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":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: route.ts \u2194 run-prompts.mjs: \u0060web/src/app/api/run/route.ts\u0060 and \u0060web/src/lib/run-prompts.mjs\u0060 change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00605cc2b214\u0060 feat(web): choose full or focused job evaluations (#5917); \u0060ec35d1b4\u0060 fix(web): name the resolved profile path in agent prompts under CAREE\u2026; \u006049e14d43\u0060 feat(web): draft a cover letter from the report page (#5258) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f4709961248708dd067ddc3de0d1f221a1577b2b8e66579a7c215baa3380a7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: _types.js \u2194 scan.mjs: \u0060providers/_types.js\u0060 and \u0060scan.mjs\u0060 change together 57% of the time (12 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u006063030d54\u0060 feat(scan-ats-full): sweep join.com from its company sitemap, with a \u2026; \u0060ff092313\u0060 feat(scan): preferred_languages picks the language version of a posti\u2026; \u006066314d3a\u0060 feat(scan): language-aware URL dedup for language versions served at \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"130781f72b34aadffea8868fa7fb0ffc66059904ae05d29b3b85d24fd2223512"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","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":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb10f7f835bc2a77284fc627e3aa5abfa7471af67afc44b12f745c4c7e83060d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/beta/beta-banner.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fa841c62a1b7c7c490986e4b38c3302e7a477b2701c826e13b68130a2c96a6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5963df22eb9dd1c59b46037dcff6fdf3161f8c64e5cab9d4a2ca8e992910b457"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ef011b2e76d1d028d7bb2d643033be3cdd17659d4aa411aaca581c1d46b4a0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07f6d410258cdf926e1a9c53efe7b1a4ab6e159be8e239266b93fa345205f03"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6893c6e9a83168946519ff5b85ec466d3532c8c0b3c4fb8172f0bc7dbc694963"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"18911fe05cb24491dcaca92de85d89acd3d7dddc6d89ce667628577359559071"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-editor.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d448d23ea8b05eb90dd5d801737427ff7cca6826d51e432596eb497d9dc1b1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e368c52e9d11352834b2aa8ce36349a5fd7f1b72aa550dad9a9f4a1625bbce96"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4433193be7b2a9bca08e9cd42b59e1f71cdf17ef86d6bdf2eeec719ba276d77b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/ai-search-box.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"560f67529d0e6d7a4c0381c6f0eacec5da63c7e1230b0995c39046bf81773ee6"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/filter-builder.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed355035f8dac4c451b57c54c25fa9ab985032426f02ab0bcd9cf51e8238cc24"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/results-list.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e464a2225eef95e49e77ba2dff9ecf7523720c8ba1a77e8a8d755a8a7a4cfe6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"008f3f3b0697bf284dd8230ec253bf7f7f12de45cbbb3d5a39c57b897df56dc4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c26afb6d00a557232a0ddc2f6b86657a58743a88fce1961257546534480db26"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/facet-chips.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f3b5069af7ecd63bba5184bb9a12a8425a7907defb3152c45dc39283619c9a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/facet-chips.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d9636f0b3cbca58925bc3e3dfe715b0fc39d03004175657c8eeb46b2e15597"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/pipeline-view.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f508047c697518831f7f9f83f8201aba072722b2abde45c0a8ace2a9fe597cf0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/quick-evaluate.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"973594f707114fbf90a759d9ac28a821a8e038be14f9ce573790c384cc9214fd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3df00b40ecab64e350809a5f17d27a3af5c4b0a2108f8181cd2a38ba6243ee3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f73d8606aafcc63fd517e7d858ce15613cd64afcce4cb1d54960ef312e86d98"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b971d52c7c253651d261d7c60dbd88aa47425ed67ce37c2b5f97bac747130e9e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff562a3401a7040f0c6b1291e3088dbf1730ecd1194458404ed255c3b414deb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f3663401282dddc708a1697c2657fb15cef383a377838af5a6148217327b05"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"039791cbdcb014058d3656295d49ac7552426242632685d3706053de93b05f37"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"642d6619ed9847c70131bbf8a3265acd12d20f1b8fdd03f8ba01f88ae0211ec2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6adaefb7c733a75f379bf6efc439c06b8976bfa6d2393024cad7590ac07adb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"121ff9953643a1b5de2edfd06eedf9b78b201ded35a01328316e6fb982729cb5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc675ab67966de2595f2d01264cdd224bc999d72d9fba4541625d733d4f0013"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8824fa2cc6203b74a231cabee12aaf6f4beb812032f469dc9944919f18af3a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88ff23b15160eb7d1ca31cb7a726d585a0dd3241ba4315078e9fd1ae6a62a88"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c704b2bb708a5e68c786b847af130529691ef86c434804af9b8d22dc81a518c2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb43b54dc0b961ca64a7df77c32c59afcca69242a43f97d60aa1d20b400e3e2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"437b72f8c47796ffbcb89cb769acbc410d71a723e08f0abc8b0d9d2dc2136023"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc7ccd90853998bbb15f521732c50be1228a117031ca3d6e7441adba2ee8b00"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16be3982e3cd7ad74a701e4c28568e78d906c2f7f9aa052cc5bc696ab117aa1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/run-history-drawer.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b73aaef941a543064e1b497c747526cbaef3ed2cacd1a45215f9ea0b64d4f7"}},{"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":"templates/ats/cv-template.ats.html"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"85853621cfbdcebe54703d0288d0e82fa047bf2608d5fd9871e996ca1e2a1a4b"}},{"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":"templates/cover-letter-template.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd592f395f19be4008768bdb3dceecdb45c8de70be53c8c8cc75a0b18eaf127c"}},{"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":"templates/cv-template.compact.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e2b6d37603afbd58ff3fccee38746f941f16ad1ba811e10d36b083758d6eac"}},{"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":"templates/cv-template.executive.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bba2e40a0cffcf026b965e8d7e59ec49136a7272c55a415eb6a0b8be9ff609"}},{"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":"templates/cv-template.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"70517ecacceddae24001ba433e56224161f1af5bed73cd7943ac69565f1429c0"}},{"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":"templates/cv-template.jake.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b00c1744fa3aa66c526872164de641bd1812f37d4bcd930d78741194e0ee16"}},{"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":"templates/cv-template.leadership.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c4cd4a3eca5b2cf105958a7341657241f33f200ac580a02a329767931c8c0f"}},{"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":"templates/cv-template.modern.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2a21740040c84ba29b16382423fee6650fdca74796225262033f9463b8b089"}},{"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":"templates/cv-template.zh-minimal.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d027ea708b5e52c01ef70b0effb346f4dafb94b4a5447ae54c91202daa00602"}},{"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":"templates/resume-template.html"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4198e43ef56a6ad730e6ee78c84f8daf9ab0ac42196d9031196151b8d6c5553e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/documents/page.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2cc6f6b33ab96bc625beee2e728f4532d8a86a0448aebe5106f715feb97f3e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d4fbac5d4ec65b855a29e0a1c0166c5cab57d5d18fc00cc39c743483968e27"}},{"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":"web/src/components/beta/beta-banner.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d08debf4a77b7a4dc866778e5ebb88cd24fe7397e077c4e212e6469d1d25e26"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, 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":"web/src/components/followups/log-dialog.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2c4e8dcae336a511d7741dd836e37f062bfb55cbfce08da60994f5416ba43b"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, 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":"web/src/components/followups/next-date-dialog.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d8cfa5c544f3ceeef3b7cd8f220ebc53580c52172c3346cd243e24dd9371b4"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/mobile-nav.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d945cb3ab5f0afb736f4daa1feea8281acd2b1ecd862e103dd7a9f4a71590b1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"123c137746a60f8ccaca3f4953f55fa071af1a55107e79a02f9cefbaf2c3fda6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-ping\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"432aed3956c35d0f3d31017ebc2caf06052c5cd8229da8b411cca0bcf7a9f8d7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d30845a3acbbeb9f6012af6a18a5f9b72b4a6bf4fd09476aa0e46a882c2601e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-editor.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c154ca0840e94d31e5f09a2656f1761de828031b4292cceb6f7138edb71c0e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-studio/section-card.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e35bf356a4d5227045ea3a3a91845e4a7a3692dbc560f8d14e00b1e3aad76c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-studio/section-card.tsx"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff80cfcb94a118cbad5471ff63e562426ce87e9888ea54427d8b57c2d40f96b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aede1107c7f857d88b8652b992153a7c79c7350c124464824db791b2b61c134"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08956cd2522503a352234144e908b4ff55663067850ffef1481506adabb5a14"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/results-list.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea8bc7794eea94cf4529f4490d948a56fcab039d0699661325841ea378feccb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/facet-chips.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f84e62d31c7d3519b7a161c2c67be3b440f70b32f5e378d8f81b251f2531c1b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/quick-evaluate.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f303f9095456daaf9c92fe8533a9e5f1ca0775c39cdea3b75a627e306a535eb8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a69d253ebfa0d0fd2b95842f36dc2caac67965d600ef62c887fb31aa432ff45"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ca365397621dcf9c552301f3a726431155d1987dea5a260b88ee902123c5cd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e99ababca7602faf61089007e9e1710cfc0373b6d0fb5128e0202bfc97953e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"245940a1f0e9bffd9ea381af531f31abdcec331f47abff067e4577537f065977"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbb803d7c4ac62cceba59e52375a00722006640535b711579f09e098284246b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8c277b4eeb85a7b70243e8bfcb1d7a11cc143b98f5a4464f450335475b9b2c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"497937e11de22ee76c3870b72d8aca774e2d318330d51a528d574383e06e2c84"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.route-bar[data-state=\u0022done\u0022]\u0060 moves (\u0060transition: transform 0.2s ease-out, opacity 0.35s ease-out 0.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":"web/src/app/globals.css"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff547827e0d4b320e32b67010742ab3c94e719c28c2fc9f9197a51572ed4babd"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 154 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/gmail/_helpers.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eef62eddaaeb2894afa38826f11ed985b8da1a83a8311384a0b52775c2d2de7"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022# Experience\n\n## Instructional Designer \u2026\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"story-provenance-check.mjs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"68725571736f98b957c3839df9c87f2606f58b2c1b27aa6e90bad2813928c08f"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022without tripping the low-text image heur\u2026\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1a3fb01dcf3a546d29d9fe6cc3c5b1f249c71a1d921de872eb24c618331ece"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022\u003Cheader\u003E\u003Cdiv\[e-mail redacted] | \u002B1 415 5\u2026\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"748d3aca9ee951813548fdd53db4f1aa32831e42f687726dd87f4d233cc25143"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060main\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"application-answers.mjs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"30830dbbdd434fac05dc69b886accd571fa3604f26a8465f6e6dd701059d5935"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060main\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"application-artifacts.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffe8949adb19d0a20165b7cdc3a70f01cc39dcdd0256124b2520fc013ee676b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060selfTest\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"a291a8d619c9473094d79793f73dfa814ca75cbdfaf9322e76a4813d7ba12095"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a868a88c2c9973924edf122e8eacb9a4e16f26d105c212697033051e2645e07a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060cmdAvailable\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins.mjs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee86794797f2a2a6723d7c37e816b9ef163e3f7df179853a9e4f37d46ce7423"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060cmdAdd\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins.mjs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24b7f5187cd676ebc77cd6a508777de8f3115e8ddeaa14974ff91327e89e838"}},{"ruleId":"IC1","level":"warning","message":{"text":"Markup wires an event to an empty handler: \u0060onOpen\u0060 is wired to an arrow whose body is empty \u2014 the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfd8768b00e9b70c84d3fd5938ef457b4ed6bde363b7704afa868623452a5cb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060runSelfTest\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc31190cc4cdab7586f26357f2db04f6f67fd344d4239e93fc2d7aa6433b209"}},{"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":"warning","message":{"text":"No structured logging: No logging call was found in the 792 JavaScript/TypeScript, Go production file(s) this check read across 4 module(s). Each was searched for its ecosystem\u0027s logging libraries (Go: log, log/slog, zap, zerolog, logrus, klog, hclog, logr; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A Go testing.B suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline_window_test.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"642c1b9c50ee209b3c2b99db15c04e91da8db090426b665c8d1c0dcfc2aebc21"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060extractPipelineEntries\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":"archive-posting.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a637842d50dd4c89a13e0409b87ad2cf7fc754385b08c667f940e347028732ef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060archiveUrl\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":"archive-posting.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ef0e49ef685d08d1277c52643d5e75d3df9fc32e2d902e055cc78ad70a1bce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060processOffer\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":"batch-evaluate-gemini.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffd9649ff663a6a5abbad63fe16068105d49f89bb38ab8f646eb94f8b2ccb9e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060processOffer\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":"batch-evaluate-gemini.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f6efa3293834b5f74fca4303318ce38c89b732e5d3a46676d7446304e391d3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060processOffer\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":"batch-evaluate-gemini.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c18329788c60b58203f66792b4f428c393ca99b1f472510ee3f3f92655a74d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060processOffer\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":"batch-evaluate-gemini.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20cb4a74fac18843bbc0ad63cfecad79f507a2e7aa31108a7e57e0143503b8f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to withPipelineLock\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":"batch-evaluate-gemini.mjs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80d72d5996f500f35c5ecabc745f2ebed415d3adbc219dd31ad04ddf407f47"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060callback to withPipelineLock\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":"batch-evaluate-gemini.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03d1f06a7df0cd580e8cd0b456d692365a3a761a4309ab843f4bb9fdd69f879"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch-evaluate-gemini.mjs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce9b99c1be40ed86ef9304bca20b863209b84fa515abad92a071060cc5eec87"}},{"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":"batch-evaluate-gemini.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8842609fc475b2424c655d03935d6968913612515a72133c3298b6f600a08cb4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\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":"batch-evaluate-gemini.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5bf71a401d9160a70a597fd78956c5262e28cbf348b6bfda5211ee8ba8e87b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5efb6d1a59e29d3caa71e4ce834e79e124f2236257100dbed4e2b460836962"}},{"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":"generate-cover-letter.mjs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0bb76a670cd927082957590a0b75cf9e31953bcc05408a073a7c49c71cf351"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6702f4091a7b50a4f1d755b9e06c14bd6db44ba227a9b019fb89505bc2ffcfb3"}},{"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":"generate-cover-letter.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1145c5d2d320ceb980e15e5bd387b744cde3c51545f991990a59776504bf6e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060updatePDFManifest\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":"generate-pdf.mjs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc437409300c4d93674e6445c538b20938c3b43d87174ec6f989cf60c5b43b3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withPipelineLock\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":"generate-pdf.mjs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5eb682e487c9c60ec40e638df5ee38c946ecb8cd7590be1f56bc68e32b5f671"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to withPipelineLock\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":"generate-pdf.mjs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe200d12dd50aaf1c58434b327c83b4f1058280ac705d3ebf7b7d0ba361690"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runBatchFromManifest\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":"generate-pdf.mjs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49a1db5d8a978d4b8dcf1838c134595dc022ce426d1cf3d942b82808b5ddb2c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060renderInPage\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":"generate-pdf.mjs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e164c0884dc160cf7e094d714438302ebf30b657104192d50aca25a257abcbf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"img-to-pdf.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78ba39827cec8b2da40a26589ab977f1518bf343ded1d63ea695ce554f71ce4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"img-to-pdf.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e0de150e569364968f7339c185529f78281e7810afffae6de98d89d9aee02a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060commitState\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":"intake.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc8ec43a0dcbcbc633d162764c0a13db418d7c6841cd583ffc853c3aaab3eef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bed1168f146279f073efd26c0c02f199b57692ec93492c292b6d535ce84c8b"}},{"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":"intake.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3a2ba686e86dfc97307b2ae4f54b87e68dff9ae80d5a68d5e5bec5ae0f25f9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildTimeoutError\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":"lib/dir-lock.mjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b91e26bad46aa231a9b3840b2d018cd254109628f7aa349f20d8b4d3862a36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060acquireDirLock\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":"lib/dir-lock.mjs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3f7a0644112afef4fedad7c95e5038d4d37402f391a705998b253c1726db7e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060close\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":"lib/pdf-server.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4dcbd4ed2d42abb8d48c43ee7846e31f6b2a202e83b44f24974da997b8698e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060close\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":"lib/pdf-server.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a330bf977b3483122d408045a3c8f7f05dc326144a517bdf7d8cff31ebfa5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060stopSharedPdfServer\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":"lib/pdf-server.mjs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"791c317f65becfc74509efee0fa2fbd8f0edb859e3e19ed101216ccd460b4e34"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060stopSharedPdfServer\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":"lib/pdf-server.mjs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9923381faac67c2b5e75f76f586b66e66e7e0e23d14a07f689cb4cc70b3c28b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060stopSharedPdfServer\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":"lib/pdf-server.mjs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"98da3523e160e93fae92bb941d4750e7c6baf2bcd29e626e221a3492c3c37a9d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to withPipelineLock\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":"openrouter-runner.mjs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"264a2b2d2d33ed8a67bd05cec04b6d86814aebd44038ed41f244150c2e5e3551"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to withPipelineLock\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":"openrouter-runner.mjs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d58450670b9fc19e07e1ece6c5a4e7ed048aa88547524d033ad6d224d61f0b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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":"openrouter-runner.mjs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"5572d2a5dc5c51779de6a1aed5656827e9fd500f2c4b6f355c9e3036e8bced8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060list\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":"openrouter-runner.mjs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"162e48aefe232a529b03478f5330a39a9780ca6083254a44e29621c790bc19dd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060list\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":"openrouter-runner.mjs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b37166b49302ce5ed9cae2371f02df254d549e1eb9846efc974d7f8bba54cb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060cmdApply\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":"openrouter-runner.mjs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8762d1769dc276d4bcfd5037a2125f9f942b814e1bd2652a3d5913c9b234d6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadPluginConfig\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":"plugins/_engine.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"33198ad759e0701d8435a3ab24b7dac8e06ee41f7d86c5cc4c930e548b6ed63f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060loadPluginConfig\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":"plugins/_engine.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6b26f5402f08f6f754e6ddf976cdf272997ff58823b1482a581c04b829ef9b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060mergeProviderPlugins\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":"plugins/_engine.mjs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e722dd48ba66906542ae16c77ebf5a27e09e0e59bb90ffc8861b3faed5aa959c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060indexDigest\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":"plugins/h1b-sponsor/lib/index.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5596afa814d3af418291bd61803ca6b92bcf46afb1a9a700237d1d619156676a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060applyScriptDirGuard\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":"tests/portal-health-guard.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bddf5dbcd9b1d84122c43a9b367344957aa108389f63c05fafbb2d341c054d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060applyScriptDirGuard\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":"tests/portal-health-guard.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a8b51f00b15f403506dae11b3577f733775c555c1ee291205260923cfd2899"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to withPortalHealthLock\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":"tests/portal-health-guard.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"999634909caaf4b9f8832cbd683d07232cff59ecc1d52f609bffcdf7137b5810"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to withPortalHealthLock\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":"tests/portal-health-guard.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97c307fd86b66a627423415ef1cbb27e23aa22f0b34f31646c957347737ae00"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060callback to withPortalHealthLock\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":"tests/portal-health-guard.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27f77be1c415f5ce8b7495bb1f9fdd7fda488b716672ab044d12bd444eea362"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060callback to withPortalHealthLock\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":"tests/portal-health-guard.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f40cd406a9cbdf673ed610b735e178848bc356c8be976933f0df855b5604db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-utils.mjs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd51310d60d29ab81448b3bac21569b81dcfcf0e12ce693346d5f23ea88b72e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060read\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":"tracker-utils.mjs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"2183fc67df05784a3cd8deb8342f79f876dbdb8c05fe8cde7bee5882500ac801"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadProviderIds\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":"validate-portals.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfdc10ef120d3387f61b939ca48f7ab05be29ccaf7c3d8e741cfbae6b03db55"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060loadProviderIds\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":"validate-portals.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f3353dea65f6a4ff8e78ade2d38a104e1392f7a8ce41c53b30f6c99025a593"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060validateFile\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":"validate-portals.mjs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"112da4f39f805399ca22234e8db22fc3c10eb451bc0d2aadf592b44642391462"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060validateFile\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":"validate-portals.mjs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83a1eff578ded05f1514a0c0afffde6fa3338c0da316d8c7bc85a1d396538be"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060runSelfTest\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":"validate-portals.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8c8e67162e7803825737ef2cd843c37a575b12ff41bd96cb95b22d1c242841"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runSelfTest\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":"validate-portals.mjs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"704468b6cf691e47fe54f9c08a5bf878a9af0467a00e4c75ef8c2553d50422b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060runSelfTest\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":"validate-portals.mjs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3392608397a205a4f126a6221cc75b3a3cc6ce6e01876c76545dea21866f56a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060POST\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":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b7d91e790087b0a9445a06b0e97f0dda324043e20b1cba8d7f55290dce7f67"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060log\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":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c390580ab7824160f4c41de5a817cbed8e4892fdf4f1f3fd518613c8909d409b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060start\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":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2df9adac425128123a67ae0a01115834752b690e599f0cf63d9d527ab2c6ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/company-history/route.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014c83da489985241c2de3545aea989dec991d6962c37668cd8e01b4e4580a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060GET\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":"web/src/app/api/cover-pdf/route.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"814913fec883b697ab5f98cb441635ec401ecdbe4dff1992a78060809087273b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060GET\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":"web/src/app/api/cv-pdf/route.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07827eddedf36fb067c718c6525b6d87713a163714898a704c171f1b66025b5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060POST\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":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"033e498041354a962b5c681c3bf742d6cc5b80a8361605143a50a8815560ef43"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060POST\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":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5592809ffef519ffb680fa47e324563f07a3c1e237cb0be2ad106aa525aeedff"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060GET\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":"web/src/app/api/cv/route.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e302583c134d103bac592303a00c49bbfcd249653e7415908970d33da999fa8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/doctor/route.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2255c1aab6ac774fea233b5be400263f5a971c74987ad3ce09da54213cf9af26"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac37a8920713b70aab651c10417a912031f2aee6c04af5452f867232e5498193"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060POST\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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870b6f033f1b441e3be6432a15569b6e1a67e5794a6cf32e78a0ddd6a40415d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060cleanupChildCwd\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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdbed4cb270955202266820497ce63c0a1238707d8adc66a7eb59ad212f18e5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060child.on(\u0022close\u0022)\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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c636ce98c6d3d28a2785e80d2ab8dbd9e1754aff8f6e155f9dbaceedc92a278"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060child.on(\u0022close\u0022)\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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e23bea9f0624cdd01b20bbafb9df50952b0e1e533978c03998a410b9754fd57"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/explore/route.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f57f03181344ef3c8e0f70c630c9f52eb28eafcaf58e56a3a337c7ce850eb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee9374c586b7098041f883a122ae6735f14f65e8e6ef0c8788920ae4337d024"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060GET\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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57a14cd71f35385db301237d40d96d85aca5d35f4a8b146d3ed16c34d5db804"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a98b01c27385b97aa9bce0849b892541834079834a34b65c2dc2df751ab8d79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b14b92f6bc8e2011856329df1024621b57fac84e33366a84c12d5970075dbf8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaa7730941c1c6acede1a9d07d84f10745cf9ca37879aec6d01534e30c70797"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to withFollowupsWrite\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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5f74254ee69af7dc5feabeb3ee6771fa9ebccc50c1c490be5f6e1eab5e17d6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to withFollowupsWrite\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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc10e1bc73b152e4641e936f54945503df70b7b72ff2e2f19df831228027b5d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to withFollowupsWrite\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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f759b59e0fe89b9c3be0bcf642407e2506060521365bffad6bfe126d99027667"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to withFollowupsWrite\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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"734bec0c9ea4b48ffe8b7bd7b2a80b2150b1f99ad3010fd4368bcb10eb26a997"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060callback to withFollowupsWrite\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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f433ce00ee69c54c9dadf0163509c2af5cf605f1160e51cc9fb810fd6451061"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060DELETE\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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"368f6e7cb90cfb53cc13e9fb992362bbde8ae87706e724b9ae210010ae1658df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to withFollowupsWrite\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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56d5912015820e2ab06c0887294169daa800e332ba9aec3f249b6836973d71c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060DELETE\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":"web/src/app/api/followups/override/route.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4451767a445e77dec5358dd3e84455c35ebc41b04566c867454ad1039ed5f3fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/followups/route.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e496c46de56def0d85400584f8cd3d20269647c4cea6c80c71740a2ab6ef41f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/inbox/skip/route.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"86edc967550038325030db83b617e93820799afd9e24fb58c63c374fb455941a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/keyword-match/route.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f49e03c9d12598a3d08112d4f744fa183051419b4f1fae8839a6bdf794f9f9c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/patterns/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d55b344824571138b886b00f9934727c79e1b24bd2c8e42fa7041672153bfd3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/portals/verify/route.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b06aa9905308824db97dadb0ba0f266e71e7185f2155060436360309467cdd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/portals/verify/route.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9492a4c1263b00fc31da8f914a721741a0d603f43b5492a59ab74678900cc815"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/profile/route.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"32503e34b44c1b3593146c1267f161ee1474c321bf63f07566e24531ecfd1f04"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/profile/route.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a15a3b0f4bc4b66f58a25400a1c861512b1b5e7f1bcee3251e26d970642cb43"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/profile/route.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50814cb22aa0ebe29ed5a51255e31dbb14a4e12ae447f9dd0300c46c1e19d69"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/quiet-companies/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3337810be29f59e2555ef878fdaa87c6c74df875ebbfc7975b66055d1e24fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/report/shape/route.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3235d371a0e70373902bc8a8740d02c721131b833d4db849a4095b7ef2eff0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/run/route.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8982e1c53abc7e1d3d4af5687012832ded673895eea60a4644909686d617aa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/run/route.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"282ec229d4cd8baf5f052d76787b7057b3a575b47ee116a1402ef13d04ba6893"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/run/route.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbc6d37baae584b7d9609ee13157d4c4f848f8060b11a1cd4dad0a24d6dc7c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/run/route.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6486d1d0025ac82fcc94117de85f46caaf6875825ce6e9ea692a07ec08b7e66a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060POST\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":"web/src/app/api/run/route.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5fef565f7751cf5ec7664a3c1aac2739d9d47fc382a4a538f9c141462f3c02"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/run/route.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2471c3a36dc309e635c115d0942d5a9e3be6ef4416c4a6a1ba6e9b0d36c8fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060POST\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":"web/src/app/api/runs/save/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bf5f6f4dc5e01b93efaaf36973cd18fbdbc9fa7cd838e1ad788941d9c86909"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060POST\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":"web/src/app/api/runs/save/route.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a397de2b3029ed4d5b5d5188f66a4c8e829517df27f4d25a479232ac03cb4e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/scheduled-jobs/[id]/run/route.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"621345affd5d0135102d624a07ff2d87025f0754c30588d8fb850ff936c3407b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060POST\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":"web/src/app/api/scheduler/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79f81ee4873a02ae50fd49ce0e0e8fc1447d3a30c3ceb93a12faca1005c56f2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/stats/route.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"07319f700a9a5b5dff02f058aa3199dc8a52637f9ed445b4d4ee8bf65495e0f2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060writeStatus\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":"web/src/app/api/status/route.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"addc69e14f81cbfd64b20a53a8df31cb4d35c11bcae235394b00e2c4c76a147b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060GET\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":"web/src/app/api/upskill/route.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"619684cf1bb05cb528f15009c33251fcde1ec1e0bcedacae310eec1fb02bad83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060GET\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":"web/src/app/api/whats-new/route.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3167e0aa522eb0c38e8c839f186c3e7a2e8eae395c6d7fc2b5acc98e29ea3df5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060ApplyPage\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":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d482b69d72c88cd3a5256d5fb6096d9c5e7bd376221a4197f76bdd0d6d09def9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060ApplyPage\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":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3076459e9dff8beb238e0d90e6c3042f88a625eb7ae2e0afc0853ee87c6690a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060resolveTailoredCover\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":"web/src/lib/apply/cover.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3d885f85579d3456d47e04d140ded96f582db5b2daa84140790e88a453e7e2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060resolveTailoredCv\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":"web/src/lib/apply/cv.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"823a804cd95913d0deba347e81a31c1df5b72bbe82d75d54e280ad4df2ccc463"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060pdfPathStatusForReport\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":"web/src/lib/career-ops.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3265263c5f1d3a11e68c6cc7eff732e31443234d76080c4e5fa5e40bc80999"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildTimeoutError\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":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aefd12ade8de61208345e1f7216f6a6a1453728931adab833ad9b7029c8f47"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060acquireDirLock\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":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cf19fa50ea9edbd8da8a7bc61424f64d829a22745fce95bda43e47950a7dd8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060loadCoreLock\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":"web/src/lib/core/followups-lock.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"746c26cd87284754123590bb489c039a1e6cfe207590055624974bc228bedba2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060findTailoredHtml\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc339c3d1be9bd3666e840248343b0562a66ea9f8c09209e820c9722d4eaa82b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadStudio\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a189c3019dd77d07495ad71931c94da654aa504144228b547295e91db30a8882"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadStudio\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"464fd119eea0505262a8a2e8fe97f35d3039c53c98aca54175a267bd9b60c9b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadStudio\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e60529fb5706e162e9742f5992cf2f58a38d49fdff4b797b65633a7e2f8f1af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadStudio\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38595e110ba624619995b6334b2c050359632f0225fb563c09c321fb866449f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060keywordsInText\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8b2ac4c97e201c7dee77cbd7e3dda347c44343e5f608d94d5c63b9706c1992"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060renderEditedPdf\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbc6ea00738d1e3c6e60b5cb87fe1aebefe436453e57a2111e12aa969018db5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060renderEditedPdf\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3939629b5d4cef4170d3f945d7ede0d6d5a4316d9bb21987a84d2a8167a981d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060renderEditedPdf\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":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7968705dc3f621a87659ad32ceb63a0614bef698b4956b64c792921bcec5c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060handleDocumentsRequest\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":"web/src/lib/documents.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adb92ea6c30b0c7b9f39f55ff88a82803c461ebdec6adfefe8334836793ab41"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fstatSync\u0060 in \u0060handleDocumentsRequest\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":"web/src/lib/documents.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff589b507b62e8f19eeaa236f4a88d41204671065dca2e234a722aced7f5527"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleDocumentsRequest\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":"web/src/lib/documents.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01fc62dd85aaec093b5910dc49e9b327eb05aac37f0c093e1ce69bc396e8fb5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060handleDocumentsRequest\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":"web/src/lib/documents.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29d071baaf926e58769e775925276d028b39433e14feb76c567f4eb2cf9acf6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\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":"web/src/lib/inbox-skip.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdd19ba877dec27d9c5c53684e8c47bcee83f906bfe9da356f11b20608db0dd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060persistEvaluation\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":"web/src/lib/report-persist.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8da05526c13449f213210f900897ba8371e255508d846dcc488cfab3f7d745"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060postCoreScript\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":"web/src/lib/run-core-script.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"594cccc934994a0ce94cf411e26731fb6a91d1d186bd66344922909e3cf09496"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schedulerStatus\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":"web/src/lib/scheduler-status.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52966fd51c9772cfaed6354df5f2f61e69b4578605d396a55beed3502a8e95a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060attempt\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":"web/tests/browser-suites.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"490f824dccbb32b28f0f5348d5e78e93a659aba3acb81b54a274887a8e2b7632"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060attempt\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":"web/tests/browser-suites.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d42fcacfd09f48f73a9ee5def23cace06a072f5778a8e2385e092353125c1f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060attempt\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":"web/tests/browser-suites.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"13673dc5bfaf4894c53d4aee8b5c34215caccfe3692506478d4d579d11b7913d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060attempt\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":"web/tests/browser-suites.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47ca54defbe6bfe637c75c4bb261dcd07b9f9082a6827e30755544ac5be415d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060attempt\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":"web/tests/browser-suites.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5047784b66fd248885cd901f9d8035e2f2ff8298c8f6a38db241f6744aba4c10"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060attempt\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":"web/tests/browser-suites.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"472c582f0304f0f004e0403563935c7ff478241737940aa4f2d0bad67376d303"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to find\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":"web/tests/helpers/web-ts-alias-loader.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a31f0dfc50027ef3666e92d102ba2d18540537c927a723342e8943b83d538f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to candidates.find\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":"web/tests/helpers/web-ts-alias-loader.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaddbb3ef4d5d07daaed56489e5bf5b634bbeb88839d95bb2a3be4a4672e3a6"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 232 typed \u00B7 1751 plain JS \u2014 the untyped files are add-entry.mjs, analyze-patterns.mjs, application-answers.mjs, application-artifacts.mjs, apply-scope.mjs, archive-posting.mjs (\u002B1745 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 22 sibling directories (33 clone groups): 33 duplicated blocks under web/src/app/api/ have copies in at least two of the sibling directories apply, assistant, company-history, cv, cv-studio, explore (\u002B16 more sibling(s) not listed) \u2014 28 of them are reported below, and 5 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 33 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 33 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 33 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":"web/src/app/api/assistant/route.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d153e94567224f9788f257c70f929f7d401259a4aa50031061df8e38ee275"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (14 clone groups): 14 duplicated blocks under web/src/ have copies in at least two of the sibling directories app, components, lib \u2014 7 of them are reported below, and 7 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 14 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 14 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 14 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":"web/src/app/api/cover-pdf/route.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea5fee464bd91e114df7f7a1d888df3478119654a2cb20dbdc0b7ea499f1aa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 8 sibling directories (12 clone groups): 12 duplicated blocks under web/src/components/ have copies in at least two of the sibling directories analytics, apply, cv, explore, followups, home (\u002B2 more sibling(s) not listed) \u2014 6 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 12 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 12 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 12 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":"web/src/components/followups/log-dialog.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e19a44f1411e23386d23b85c61eea57e91eaa3ddcadd15839625512f54d07c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 7 sibling directories (10 clone groups): 10 duplicated blocks under the repository root have copies in at least two of the sibling directories batch, lib, plugins, providers, seeds, utils (\u002B1 more sibling(s) not listed) \u2014 7 of them are reported below, and 3 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 10 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 10 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 10 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":"lib/dir-lock.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"411013b69337d58b0665969c32fa5e1a2cfcf916966f36dd62a5d598c84f1ec6"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (271 identical lines \u00D7 2 files): lib/dir-lock.mjs:42 \u00B7 web/src/lib/core/dir-lock.mjs:42 \u2014 these 2 files are line-for-line copies of one another \u2014 271 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7676da122c11b6a111779ebb0f36c63b62d5db611fa9a68259bbcac5332a08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (249 matched lines \u00D7 2 locations): ollama-eval.mjs:41 \u00B7 openai-eval.mjs:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 1834 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":"ollama-eval.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4626f1956de13c424fdd813020c5309aa7417e93a968c1b7d3839be45a4d0bcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (101 matched lines \u00D7 2 locations): providers/jobbankca.mjs:52 \u00B7 providers/platsbanken.mjs:71 \u2014 the two spans are one implementation copied and then locally edited \u2014 610 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":"providers/jobbankca.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f9fad6b46469f65ea36e56ab098efb87a9b43f266d316ea8710ea72fd66596"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (99 matched lines \u00D7 2 locations): web/src/lib/cv-envelope.mjs:31 \u00B7 web/src/lib/report-envelope.mjs:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 693 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":"web/src/lib/cv-envelope.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99e673b156962c87f0f73d986babf45e7c535d965ec53002430b90b6525782c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (95 matched lines \u00D7 2 locations): closing-soon.mjs:332 \u00B7 reeval-candidates.mjs:332 \u2014 the two spans are one implementation copied and then locally edited \u2014 830 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":"closing-soon.mjs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a89de28af8ff1640a499157b73057d451fe586d665ac017e607117149c0a8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (93 matched lines \u00D7 2 locations): providers/computrabajo.mjs:51 \u00B7 providers/magneto.mjs:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 689 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":"providers/computrabajo.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5371047f2ebac49664de19c6c41b8cf5e02e4087698b131dcb3449e256c969"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (83 matched lines \u00D7 2 locations): providers/jobscz.mjs:41 \u00B7 providers/pracecz.mjs:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 715 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":"providers/jobscz.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d0a55c1334260cd722b8823a32101fd2bdbb245c794896d5acb4526543a9ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (80 matched lines \u00D7 2 locations): providers/justjoin.mjs:8 \u00B7 providers/nofluffjobs.mjs:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 589 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":"providers/justjoin.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a779ea576e8e57ab62d5971f88580bd97a550cdaf82395793926813e7eca9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (76 lines \u00D7 2 locations): providers/nodesk.mjs:12 \u00B7 providers/weworkremotely.mjs:12 \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":"providers/nodesk.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27d326d6115721f27b33ada0a3e1bdc3f04ce087a9999a23718dba8516fecf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (74 matched lines \u00D7 2 locations): web/src/components/scheduled-scans/create-job-modal.tsx:16 \u00B7 web/src/components/scheduled-scans/edit-job-modal.tsx:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 493 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":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff7e35b0825eece04f552239f71eb4bc59ef08a6810ffa00209fd0e09a24799"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (72 matched lines \u00D7 2 locations): providers/alibaba.mjs:69 \u00B7 providers/tencent.mjs:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 540 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":"providers/alibaba.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd591ee3c6224a7f7c235e9dd0370e23df0185c7b4d69c51e794d1c065db843"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (67 matched lines \u00D7 2 locations): web/src/app/api/assistant/route.ts:91 \u00B7 web/src/app/api/cv/ingest/route.ts:119 \u2014 the two spans are one implementation copied and then locally edited \u2014 421 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":"web/src/app/api/assistant/route.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a0947781968b431c8cdb3b40e3e7f7275a441838a4c1b1ff84d0dbf2f0ab0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (59 matched lines \u00D7 2 locations): web/src/components/followups/log-dialog.tsx:25 \u00B7 web/src/components/followups/next-date-dialog.tsx:32 \u2014 the two spans are one implementation copied and then locally edited \u2014 364 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":"web/src/components/followups/log-dialog.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a9962ac76110ee7e0f2ab969bee3fbf625c5d4991e72d9f6c31273b6112594"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): providers/beesite.mjs:55 \u00B7 providers/deutschebahn.mjs:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 337 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":"providers/beesite.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"324fba94f97263bafeef65dfd06fe38bf38f701a7c87ba49fd867bc865ddadd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): build-cv-html.mjs:1491 \u00B7 build-cv-latex.mjs:385 \u2014 the two spans are one implementation copied and then locally edited \u2014 414 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":"build-cv-html.mjs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d90a222ffde61d936a538b167bd4892f26ac6c8f647977e3b1d929ad49d826d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): providers/kalibrr.mjs:165 \u00B7 providers/techinasia.mjs:268 \u2014 the two spans are one implementation copied and then locally edited \u2014 387 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":"providers/kalibrr.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"132d6d15b61c377d9d5ef07e5ca415bad30551dd9562f16b88b452799e01e834"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): providers/careerviet.mjs:52 \u00B7 providers/itviec.mjs:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 390 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":"providers/careerviet.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ba8327b9641820a0df4fe5432e696bded9a8b75f972e348f841af13137f5e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 3 locations): providers/careerviet.mjs:252 \u00B7 providers/itviec.mjs:215 \u00B7 providers/senjob.mjs:140 \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":"providers/careerviet.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b968de5e6e0d86c1d467a2d3a572a792e49e771cf4010b23602df5c45ef3f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): providers/dover.mjs:126 \u00B7 providers/rippling.mjs:127 \u2014 the two spans are one implementation copied and then locally edited \u2014 371 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":"providers/dover.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee3dfe1b293abc442e1fdf62d5f9ca9123ac332447e2914c38f49dae744788a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 3 locations): providers/larajobs.mjs:16 \u00B7 providers/nodesk.mjs:12 \u00B7 providers/weworkremotely.mjs:12 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/larajobs.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe19e571ea80d7e9f102191e97094b5304c7cde9ebab6fd766e1552f4f50f905"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): providers/neogov.mjs:29 \u00B7 providers/schoolspring.mjs:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 295 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/neogov.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7909f2923bb8c45792a1333c7e943d6cbf7e2c17b2197d038f8f3524ba26aea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): web/src/components/scheduled-scans/create-job-modal.tsx:106 \u00B7 web/src/components/scheduled-scans/edit-job-modal.tsx:125 \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":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f4c08ab974362e0f5356da3430fad5421f671972caa2ab3d0b09f088725ad2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): providers/hecklerkoch.mjs:24 \u00B7 providers/softgarden.mjs:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 313 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":"providers/hecklerkoch.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad67721dd2304d305815ac8a012c8161d08f29a6720c9d04d9f704a1bd44d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (42 matched lines \u00D7 2 locations): providers/csod.mjs:38 \u00B7 providers/phenom.mjs:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 275 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":"providers/csod.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b3b844535785f73238d1379a167d7f666ab8eaf85bbcfa9bff7cd064ecc094"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (40 matched lines \u00D7 2 locations): gemini-eval.mjs:245 \u00B7 openai-eval.mjs:161 \u2014 the two spans are one implementation copied and then locally edited \u2014 305 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":"gemini-eval.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"88175db717c34e2109d7b46fdfcc4cf9ae28aab688ae4465717eed58cf752886"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): providers/bamboohr.mjs:55 \u00B7 providers/breezy.mjs:16 \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":"providers/bamboohr.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"374f321b6c85f1304ff13b2392e3e75f6090d8bec3e366b19aee2bf96fd86e1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): build-cv-latex.mjs:214 \u00B7 build-cv-latex.mjs:500 \u2014 the two spans are one implementation copied and then locally edited \u2014 339 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":"build-cv-latex.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0247731c982f2935b54066e9770018329ba508dafc2f5033ae1ef6a8ca1ea126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): ics-interview.mjs:439 \u00B7 panelist-roles.mjs:346 \u2014 the two spans are one implementation copied and then locally edited \u2014 313 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":"ics-interview.mjs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede22c0d201f0e2dfa2461aad692e590c2d7397b1c524c7b10c39428b5f03e4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): analyze-patterns.mjs:813 \u00B7 upskill.mjs:717 \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":"analyze-patterns.mjs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b44e84e4092802281e3fb7e3617cc82a51249d2c02c1edb1928c7739ae022f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): company-funded.mjs:231 \u00B7 sync-batch-input.mjs:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 430 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":"company-funded.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"72696f2f8782602f6bc7abed55124d5dc28015ed1a3043a401ad99b106506c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): providers/phenom.mjs:92 \u00B7 providers/tkms.mjs:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 316 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":"providers/phenom.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"986f2b0d84f028aeb7351801e780012dbbc438fc79a81c0add39b6fd5a298540"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): tracker-parse.mjs:499 \u00B7 web/src/lib/posting-url.mjs:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 248 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":"tracker-parse.mjs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ce7b7399c72629bbffca6131a01b711c165762058a82cd2df3105d0adb1cd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): openai-eval.mjs:327 \u00B7 openai-tailor.mjs:233 \u2014 the two spans are one implementation copied and then locally edited \u2014 245 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":"openai-eval.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"067f67c0146865c9d35cf7b8f58ccad3cfef147fde1eeb40e68635c1fba0526b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): web/src/components/page-loading-skeletons.tsx:54 \u00B7 web/src/components/page-loading-skeletons.tsx:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 222 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":"web/src/components/page-loading-skeletons.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d961e092bef4688f9ff440f9455aceefceddf754e13addb7e0c17bd6481420b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): lib/cli-launch.mjs:21 \u00B7 web/src/lib/cli-launch.mjs:21 \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":"lib/cli-launch.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb566a7fc2d8ee5d57a1f9a9191bbb67376eaa0d2d96d42e48cf5cc7877163"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): pipeline-lock.mjs:32 \u00B7 portal-health-lock.mjs:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 219 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":"pipeline-lock.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6eae1c7e6382a3a56e9333c9431f3aa95272a4790092b33b5eb6babf64d801"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): test-all.mjs:15306 \u00B7 test-all.mjs:15363 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":15306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8e9fc4c6547f65ce636423d377c2d7175759803910758e24b866f6276e6b59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): providers/breezy.mjs:52 \u00B7 providers/prevueaps.mjs:143 \u2014 the two spans are one implementation copied and then locally edited \u2014 216 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":"providers/breezy.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7e579213a0e88e1dfbf511c31e81d859dd23bc5f43656b0fad5e5f92c3a713"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): url-key.mjs:262 \u00B7 web/src/lib/core/url-key.mjs:44 \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":"url-key.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"795a2491c643564cdf8bba5bea600ba1e5c1508587ed5daa7a8e3e44fd4ad0be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): web/src/components/app-shell.tsx:42 \u00B7 web/src/components/mobile-nav.tsx:162 \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":"web/src/components/app-shell.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ebe6e14c28d9bec452c9f68110d4abbc6f51ccc52a016c0cd0d2c48d226f41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): browser-extract.mjs:231 \u00B7 browser-extract.mjs:654 \u2014 the two spans are one implementation copied and then locally edited \u2014 287 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":"browser-extract.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae3f9005b468deef2b374e5080c15971100b814a5b98e75f9702a77e6209be3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): tracker-parse.mjs:411 \u00B7 web/src/lib/posting-url.mjs:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 199 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":"tracker-parse.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2d70089a86412a9000cd640a6f607240e30240ce7e53bc6f9016218c98089b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): providers/higheredjobs.mjs:66 \u00B7 providers/weworkremotely.mjs:59 \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":"providers/higheredjobs.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafe456193030ffb674bdf817ebb861ac032477468cebbcf977bfe3c9485c579"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): providers/meituan.mjs:98 \u00B7 providers/tencent.mjs:76 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/meituan.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"393d4f877d0b82b0645469cf5e9ecc011e8b76ae14bf1da1e381ead74e229ab8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): providers/mycareersfuture.mjs:186 \u00B7 providers/vdab.mjs:264 \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":"providers/mycareersfuture.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01d85017ae24b100b5f02e06ee2b116437b5a701a01b9175a25dc470f3a0ab3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): providers/startup-jobs.mjs:124 \u00B7 providers/teamtailor.mjs:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 162 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":"providers/startup-jobs.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ecd2a107013c3d719c44e44bfd9c511b59c84352aa613578de9b65a83ab6d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): providers/thehub.mjs:81 \u00B7 providers/themuse.mjs:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 197 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":"providers/thehub.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c3e631638ae6b7a5b8033c765e9eab63fcd9cab9836deacaeda79dcf526ad0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): scan-dayforce.mjs:694 \u00B7 scan-interamt.mjs:361 \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":"scan-dayforce.mjs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb072e625a378c65eac21def401236ee9d9ceac6116039024e9b89459152a6b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): web/src/app/api/followups/cadence/route.ts:134 \u00B7 web/src/app/api/profile/route.ts:86 \u2014 the two spans are one implementation copied and then locally edited \u2014 190 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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"16add7b671b96655169d07af02d0beadac1df7d2900784a9d5b9acfcce7d6d29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): lib/ascii-fold.mjs:54 \u00B7 web/src/lib/core/ascii-fold.mjs:49 \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":"lib/ascii-fold.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bec6ee84db42f8df427937af0ad44fe6682b35c4b3fe1920e202a4525c28d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): openrouter-runner.mjs:269 \u00B7 openrouter-runner.mjs:328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"29446dcb206ed6c7d1160010e29010c37392f9c6b65295118baa914f01141c9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): build-cv-html.mjs:1424 \u00B7 build-cv-latex.mjs:337 \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":"build-cv-html.mjs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9637a5f2a7c95388ecefa68781754b55f82b83740f11c6773feb35d922f55712"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): providers/_http.mjs:345 \u00B7 providers/_http.mjs:416 \u2014 the two spans are one implementation copied and then locally edited \u2014 135 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":"providers/_http.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df40e8a92ea96f8a1a8b4a5d884f2597d430c89008b1e125eddd74a5bfe4dcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): check-jd-archive.mjs:698 \u00B7 check-table-freshness.mjs:314 \u2014 the two spans are one implementation copied and then locally edited \u2014 216 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":"check-jd-archive.mjs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a231c12970bf878e62eb7bcae396ea3340b321ca44b6aa308108aac17b21d34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): providers/a16z-speedrun-talent.mjs:73 \u00B7 providers/flowxtra.mjs:49 \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":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"51db0210d91ce82e8fe98993ea7edddadfa0831f7e21fa1ec4e053949ea2be89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): providers/alibaba.mjs:107 \u00B7 providers/meituan.mjs:98 \u00B7 providers/tencent.mjs:76 \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":"providers/alibaba.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"129ed534a14643a6bb63e5e0ba1b8c33a088fe7c8313fa7391d6149798ab7664"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): providers/getonbrd.mjs:72 \u00B7 providers/rippling.mjs:81 \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":"providers/getonbrd.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d8a5ad4e4331cee3ae1eefe2b2c608f6c01ddbc52e2cad04a2ea3c0f429175"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): web/src/components/apply/apply-provider.tsx:111 \u00B7 web/src/components/apply/apply-provider.tsx:246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f99b5d46eca0cb25772db10acd30ab447795c591c21545026f96d918a85216"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): providers/arbeitnow.mjs:43 \u00B7 providers/flowxtra.mjs:51 \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":"providers/arbeitnow.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"082c978e5e66589c57f4aa32d0d9a5f348e0e100a5e1fdaaaba8312f1bd067e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): analyze-patterns.mjs:915 \u00B7 upskill.mjs:62 \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":"analyze-patterns.mjs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"102704ba968195ed23708a6dbf0fc2816a3ec359110109b66c5ab97d3992c851"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): keyword-match.mjs:802 \u00B7 test-all.mjs:15999 \u2014 the two spans are one implementation copied and then locally edited \u2014 166 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":"keyword-match.mjs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"22357a4366bfe8af784869497fce6d266a04341abd96341de8fbf208c982e500"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): lib/latex-content.mjs:110 \u00B7 lib/latex-content.mjs:158 \u2014 the two spans are one implementation copied and then locally edited \u2014 160 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":"lib/latex-content.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"249db2f789c09ee8d3d8462a620e814402fc81ff5136661bc92b5605f5c6cd9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): scaffolder/bin/skill-entrypoints.mjs:49 \u00B7 scaffolder/bin/skill-entrypoints.mjs:80 \u2014 the two spans are one implementation copied and then locally edited \u2014 134 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaffolder/bin/skill-entrypoints.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefe0c33d5c79aef3467fd0361df014c96d921895fb83904da91d4be5928506f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): web/src/app/api/quiet-companies/route.ts:19 \u00B7 web/src/app/api/upskill/route.ts:18 \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":"web/src/app/api/quiet-companies/route.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"68073097d72f5f6501de824cf8da3b4ab4edf863598f97aadbceb1334fb2b782"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): generate-pdf.mjs:920 \u00B7 generate-pdf.mjs:1000 \u2014 the two spans are one implementation copied and then locally edited \u2014 155 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":"generate-pdf.mjs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88ed9f2c3f03ed4141beedcd2386c2ff294ba8b4845936c233eff99ce8581d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): providers/4dayweek.mjs:132 \u00B7 providers/arbeitnow.mjs:100 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/4dayweek.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d75bdcd5e647be6ddef5f0d0ba87a91c11e2b3031ef944e97a4238c15ed5ee1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:331 \u00B7 providers/ultipro.mjs:337 \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":"providers/adp-workforcenow.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a6f18213d788dfcf5d798436a0194d64460bece9cd2b45003f070332d042e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): providers/amazon.mjs:87 \u00B7 providers/dassault.mjs:144 \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":"providers/amazon.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9819a805719bb3b235d7d2dcdd795f7801eea3f385ce1af0b7fd985ccad7783"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): providers/csod.mjs:156 \u00B7 providers/rheinmetall.mjs:96 \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":"providers/csod.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf467fc80731bca5ba1c82df3bdab932f91141648d8cf0f29f6d9cf326e6735"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): test-all.mjs:13297 \u00B7 test-all.mjs:13374 \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":"test-all.mjs"},"region":{"startLine":13297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d705d74f2569c6c43dec64b8db0d8ec27571aa28132325353322589176c71ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): verify-cv-facts.mjs:2481 \u00B7 verify-cv-structure.mjs:309 \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":"verify-cv-facts.mjs"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"18875e641aaa7951ae684b0f5fca260bbd98423b19698d69b6d7d50b3969e243"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): providers/redrover.mjs:121 \u00B7 providers/schoolspring.mjs:180 \u2014 the two spans are one implementation copied and then locally edited \u2014 110 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":"providers/redrover.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d621598d3e41dc72aebd240fd389392d454378f21bdd19d5074cd40e1bb69156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): providers/remoteok.mjs:25 \u00B7 providers/workingnomads.mjs:22 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/remoteok.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6f9545a426112f03b6903316360c534c93d852f563bc92749bd224b7e3f900"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): test-all.mjs:19029 \u00B7 test-all.mjs:19142 \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":"test-all.mjs"},"region":{"startLine":19029}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d2e08ca81272a516d893cb5d51bff8f6a0fddf9527fe27fe78a56fb4f56180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): upgrade-tests.mjs:476 \u00B7 upgrade-tests.mjs:564 \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":"upgrade-tests.mjs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b79b697b50bd34e6d03f873617f675dc827ab64017f237e327d9a621ca6216"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): web/src/components/followups/followups-view.tsx:115 \u00B7 web/src/components/pipeline-view.tsx:72 \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":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3ecc9c8e1ec2a12eeedf113157fe9cc41a49b09876acb2b58e1bdc0d91d898"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): build-cv-html.mjs:1017 \u00B7 build-cv-html.mjs:1101 \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":"build-cv-html.mjs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f17bcc7fdca89140636b69daaffa5d41bf4f5be0bd2c88d2d687644e1a29742"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): detect-reposts.mjs:495 \u00B7 tracker-sync-check.mjs:518 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"detect-reposts.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"01036134feaa757eac32121b8c57e71781631e23c757615faad9b6af1f6804c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): generate-pdf.mjs:1384 \u00B7 tracker-utils.mjs:502 \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":"generate-pdf.mjs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c628c16009dd49c273a09e8e2f8d115414c44509b24c8b69031e42c5aa0529"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): intake.mjs:252 \u00B7 lib/walk-tree.mjs:178 \u2014 the two spans are one implementation copied and then locally edited \u2014 141 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":"intake.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"813188acf488b32f20da2b1a14c614d23ea70cd86c9a648accbe774db038e37d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): process-quality.mjs:239 \u00B7 rejection-latency.mjs:465 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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":"process-quality.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef02132709dc456f4589a764d3b9984090054c332c52e85dbe8378982814273a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): providers/a16z-speedrun-talent.mjs:138 \u00B7 providers/gupy.mjs:327 \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":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8684cd24e06620b78bfb103c8f9e905a830b4b06c0a6856c96929a067764a253"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:56 \u00B7 providers/ultipro.mjs:73 \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":"providers/adp-workforcenow.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc1c6d74ab2906c44b265656c99976e814bf444d7f8dc178016a51d48756aee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): providers/manfred.mjs:32 \u00B7 providers/torre.mjs:106 \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":"providers/manfred.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9dde9671771d0ff63722cb13755df0c6ded450826a97c6eeadff4ac6218900"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): scan.mjs:3781 \u00B7 stats.mjs:335 \u2014 the two spans are one implementation copied and then locally edited \u2014 164 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":"scan.mjs"},"region":{"startLine":3781}}}],"partialFingerprints":{"codehealthFindingId/v1":"99005c22ea968e34ea76cb74b2d5d58df93cd0afee2858a631dfedcfc5f52b04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): test-all.mjs:7435 \u00B7 test-all.mjs:7466 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":7435}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac120d20fa00a0aa95241ee50d7ebb8dbf67ee6b768b020bd277da87ef506c40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): merge-tracker.mjs:73 \u00B7 reserve-report-num.mjs:85 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6af0b422d4799e86a215252d8ad9623bb0b437a6e1285419708d2db6bdf632"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): process-quality.mjs:81 \u00B7 tracker-sync-check.mjs:244 \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":"process-quality.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b479c02feb2390c80c64481de0bc738ae9a62dae64bda14d28a720d22b965e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): providers/softgarden.mjs:62 \u00B7 providers/successfactors.mjs:246 \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":"providers/softgarden.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"991c55fe712ee836c457519d35971c72008f5506720542e13c0c1ad1a6273123"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): providers/themuse.mjs:58 \u00B7 providers/workable.mjs:76 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"providers/themuse.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0e9e5c7ad214a8a731efbcbb6bc3b2e0edce34c0b29903ae5a41f144c61415"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): scan.mjs:4274 \u00B7 validate-portals.mjs:289 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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":"scan.mjs"},"region":{"startLine":4274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe4483d01f550cd48ebbf3470dcb3dc4a029a84c0e3afe9268dff04f6e6ccc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): web/src/components/cv/cv-ingest.tsx:80 \u00B7 web/src/components/cv/cv-ingest.tsx:119 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b89683adb87b034b6a05e5f04a47153bfb2690218eea7fc2fa39a418ae2d321"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): application-answers.mjs:561 \u00B7 application-answers.mjs:579 \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":"application-answers.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2933bb0e165ed290bb56190097b4f503bfa08b5c42eadb4958cdbc5e0ab46a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): ats-payload.mjs:731 \u00B7 role-clarity.mjs:392 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 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":"ats-payload.mjs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63dfc1d47b9c19407d484b10931ffe2d36f58e707fc66b6e421fda6a7439285"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): dedup-tracker.mjs:404 \u00B7 fix-report-links.mjs:127 \u00B7 normalize-statuses.mjs:151 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dedup-tracker.mjs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1260bbb4ca916c2901b117ea1c24222024f1c74eb40b5fc153459287aba7673d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): img-to-pdf.mjs:208 \u00B7 negotiation-roi.mjs:674 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"img-to-pdf.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe97bf3279e5bc11832a1554ab4bf4bce3b0d0ab77326f52ede1d330de40cb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): lib/tracker-addition.mjs:119 \u00B7 web/src/lib/report-persist.mjs:152 \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":"lib/tracker-addition.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8073ac8fa4abdda17226685c852d44731e50bcf61408fb046ab9f62f3eb117d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): providers/beesite.mjs:168 \u00B7 providers/csod.mjs:252 \u00B7 providers/tkms.mjs:172 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/beesite.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3063acf4be61d67fa3432f94dd9aa57aa5abdaca2bfb8a27682e848624753f8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): providers/eightfold.mjs:376 \u00B7 providers/oraclecloud.mjs:210 \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":"providers/eightfold.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63a38da2533f4c1ac19a91fa5a32cdb309aac9a1810d0f9f42f2119715f3dcf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): providers/eightfold.mjs:111 \u00B7 providers/kalibrr.mjs:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"providers/eightfold.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffcee635dabf4ba41f51e4bf5d2a6c822d306fee8e370418b6ac4892ca829d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): providers/glints.mjs:70 \u00B7 providers/oraclecloud.mjs:61 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 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":"providers/glints.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd36a9a6592b118e43ebce428cba24d89193b2d23291aec0e8cf164edaf11e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): test-all.mjs:6392 \u00B7 test-all.mjs:6414 \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":"test-all.mjs"},"region":{"startLine":6392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b67a9328067ef61ef8bf3d64cc3533488bd392199d6b0a7bd8f3d23be56c01f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): test-all.mjs:10967 \u00B7 test-all.mjs:13838 \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":"test-all.mjs"},"region":{"startLine":10967}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f0221a915b2f2bbe52292c42e003fa6d6df7425e4b8e6c28bc926d0e222223"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): test-all.mjs:14242 \u00B7 test-all.mjs:14345 \u00B7 test-all.mjs:14424 \u00B7 test-all.mjs:14500 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":14242}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa966cb46df06db9772772b8284baa99336c6125108edfb371253c6843098624"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): web/src/components/assistant-console.tsx:1091 \u00B7 web/src/components/assistant-status-confirmation.tsx:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 124 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"466a343dd2c0ebdc0f5cf2503e5d6bd8eac4a474045583d28ca04448183251d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): analyze-patterns.mjs:368 \u00B7 analyze-patterns.mjs:1613 \u2014 the two spans are one implementation copied and then locally edited \u2014 143 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":"analyze-patterns.mjs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2070335950400d60ac78f014264c713456f224289ca9420c82e9dfc47fcedcb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): company-funded.mjs:204 \u00B7 sync-batch-input.mjs:105 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0b61d4d1b2ce34f715e1f8f78bde090f103f9faff44219c6da1a180c9d520d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): contact-extract.mjs:195 \u00B7 reply-watch.mjs:110 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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":"contact-extract.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f17f35c3cd42e1baa7e5799958e756122d813807585bbd572f3966cbd9aa74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): cv-title-check.mjs:738 \u00B7 scan.mjs:4151 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-title-check.mjs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b6105901b80b61649cc26cd1356ba7fc8e951e6c28f61650514ef593b9630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): find.mjs:189 \u00B7 jd-similarity.mjs:144 \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":"find.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a87879cf96b96fc69f87e14844f501423b27500b75269a9a4989213e69434c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): providers/arbeitnow.mjs:25 \u00B7 providers/kalibrr.mjs:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"providers/arbeitnow.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3ef29854e9ae2ae6313342af746bf73fedff5c7d8e71bbbe68292490214393"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): providers/inrecruiting.mjs:80 \u00B7 providers/paylocity.mjs:68 \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":"providers/inrecruiting.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cc3d7313a34b8da717848eddebe0ada52755d526f75f5c524417eb47cd8c5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): providers/inrecruiting.mjs:251 \u00B7 providers/radancy.mjs:377 \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":"providers/inrecruiting.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dfcbdcf6819317920f25ce1ff11053f642d19dfdb141e50c734f71689123da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): providers/kalibrr.mjs:66 \u00B7 providers/startup-jobs.mjs:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/kalibrr.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea2786dff74fe05880c8ae9d1b45ec601d19dd8c4818b7e647baf83137d9d9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/app/api/assistant/route.ts:46 \u00B7 web/src/app/api/run/route.ts:39 \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":"web/src/app/api/assistant/route.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"637b47dd42ed0c1b0d67fb13be5dda99869f9b81905fa0b049d80bb3eb610600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): browser-extract.mjs:451 \u00B7 browser-extract.mjs:542 \u00B7 browser-extract.mjs:626 \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":"browser-extract.mjs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f975408ae59ca429f13721d1a2e9dbb3605c2cc527343c46007e06baeeeaf34b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): build-cv-html.mjs:604 \u00B7 build-cv-html.mjs:638 \u2014 both copies are in the same file, so extract the block 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":"build-cv-html.mjs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"5465f50fc52452aa230095408f27a102add282feb5e7ccf9b5a0b23db2e23c95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): close-stale.mjs:254 \u00B7 set-status.mjs:754 \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":"close-stale.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"382950de2662d4799dc4fc63c1334b07666351b6358f257adbb7ae66603bf4d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): gemini-eval.mjs:401 \u00B7 ollama-eval.mjs:262 \u00B7 openai-eval.mjs:290 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gemini-eval.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297b05a0d069b959d73ad9d87bb1bb8f12ae7e0584c220b1b68ed724804b257"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): generate-pdf.mjs:1836 \u00B7 img-to-pdf.mjs:225 \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":"generate-pdf.mjs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"e365c61ee8b81d1cc42117f8bf24bfc4fc07b9f0ee92fb77d1d358573039860a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): providers/4dayweek.mjs:48 \u00B7 providers/a16z-speedrun-talent.mjs:40 \u00B7 providers/flowxtra.mjs:26 \u00B7 providers/gupy.mjs:120 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/4dayweek.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a220aedacaba93949154792c53799ca9435a6aaf8adcc711b6377700c5a160b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:136 \u00B7 providers/rippling.mjs:85 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3543dd4a7135fdc745cc4895830b18c91cef1dcdbccc44023915a3f7ed59181d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:425 \u00B7 providers/ultipro.mjs:426 \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":"providers/adp-workforcenow.mjs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92818962f02a1f428e9e9a4d9ae5c81dad6d97e41ba9a377b6c21a48d2cd346"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5 locations): providers/agentic-jobs.mjs:42 \u00B7 providers/manfred.mjs:36 \u00B7 providers/senjob.mjs:69 \u00B7 providers/themuse.mjs:80 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/agentic-jobs.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc09dee78700a659499bc1054160d60379e6b3e388e67f69d239d543647014a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/applitrack.mjs:33 \u00B7 providers/redrover.mjs:49 \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":"providers/applitrack.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f572394f696aadb67af0c65db97892984133667c4d8bff88ae3e3be38586f846"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/comeet.mjs:120 \u00B7 providers/recruitee.mjs:457 \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":"providers/comeet.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba2d31af9e6dda95f0089b6af59cbe1ffb730267d8af025aa52ae99132371f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): providers/deutschebahn.mjs:47 \u00B7 providers/hecklerkoch.mjs:24 \u00B7 providers/radancy.mjs:121 \u00B7 providers/softgarden.mjs:27 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/deutschebahn.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac74b7fee73b30cb608dae0e38b8a3f4eca5bf41210c708a16452ce47bd3def"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): providers/higheredjobs.mjs:18 \u00B7 providers/larajobs.mjs:31 \u00B7 providers/nodesk.mjs:27 \u00B7 providers/weworkremotely.mjs:27 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/higheredjobs.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1276fdfda1887970becdfeb4e948e8b9f5efb59f0b7a739c546c965cc28536e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): providers/higheredjobs.mjs:105 \u00B7 providers/nodesk.mjs:95 \u00B7 providers/teamtailor.mjs:139 \u00B7 providers/weworkremotely.mjs:92 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/higheredjobs.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bb3ab9cd99ccac6a20910470ecd89cccf5a26801134493ffba8695182f81b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): providers/landingjobs.mjs:21 \u00B7 providers/larajobs.mjs:20 \u00B7 providers/nodesk.mjs:16 \u00B7 providers/weworkremotely.mjs:16 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/landingjobs.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"601b4c5171d5b4a5773dea2f0bdcc6750a88cb5318e6dfff024b7fe9fb634874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/smartrecruiters.mjs:67 \u00B7 providers/workable.mjs:104 \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":"providers/smartrecruiters.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa7ee430ac49da31b7b468f75a459e23744bd2352d2023fc86efe185c9e6f97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/techinasia.mjs:98 \u00B7 providers/wttj.mjs:58 \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":"providers/techinasia.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b2a32909b131dc0147bd7b09a1bb1ade6e39b93a2bcf3beedce41d91505952"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): test-all.mjs:1151 \u00B7 test-all.mjs:1201 \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":"test-all.mjs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fede09669d0ce36780624d58a80f178241984485ae7150a38d11246c8ce243a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): test-all.mjs:4503 \u00B7 test-all.mjs:19038 \u00B7 test-all.mjs:19155 \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":"test-all.mjs"},"region":{"startLine":4503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f72d1011e97fff9cf247e2a6a9895f7e210c76e08d67fd0ab8d49bdff470401"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): test-all.mjs:7232 \u00B7 test-all.mjs:7454 \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":"test-all.mjs"},"region":{"startLine":7232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c303c7dbe6681e544bd06d9dc2a126224e797674666b78b260902d8ebb52c07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): test-all.mjs:13521 \u00B7 test-all.mjs:13546 \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":"test-all.mjs"},"region":{"startLine":13521}}}],"partialFingerprints":{"codehealthFindingId/v1":"987bd23f61c05f4ddc8f27c8a7720c651f5cb190f77370c1c92d9c1e0fcbcab5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): test-all.mjs:14113 \u00B7 test-all.mjs:14132 \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":"test-all.mjs"},"region":{"startLine":14113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17d1ea62bafab849a196e9a65f22e3c75d6cc476a4fdd82bfa109f0941b2aa9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): update-system.mjs:1201 \u00B7 update-system.mjs:1235 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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":"update-system.mjs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f297e3e3e7661cdf0ace1e8dc7a678aebeda545a843b5048cbb5eb56a4582ab5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): web/src/app/api/cover-pdf/route.ts:36 \u00B7 web/src/lib/documents.ts:209 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cover-pdf/route.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"01185acf3e7923ede22239b5ca1a7a9693da09d21a49e44ee9b10f2f80fe3d4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): web/src/app/api/followups/log/route.ts:29 \u00B7 web/src/app/api/tracker/delete/route.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a59894cefef8d58e34cbe85e67cf1d8e671ca192c42cdeac99675c866ddecde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/components/explore/explore-mode-toggle.tsx:21 \u00B7 web/src/components/explore/explore-mode-toggle.tsx:36 \u2014 both copies are in the same file, so extract the block 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":"web/src/components/explore/explore-mode-toggle.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f69b53e70b1221604a5212737db35c5c5a17d2963f59e97a1a3310ecdf6c6df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/components/explore/first-score-view.tsx:77 \u00B7 web/src/components/mobile-nav.tsx:64 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/first-score-view.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da4f32bc364e9f2699ed018bdeee07a368ee329ac7edd1289fbed0fcb89474b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/lib/apply/agent-interpret.ts:102 \u00B7 web/src/lib/apply/drive.ts:114 \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":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d5bf5b4961ceb46505a83099a7afb9933ce9de00cc4d5a0661421896a3d7f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): web/src/lib/apply/session.ts:256 \u00B7 web/src/lib/apply/session.ts:369 \u2014 the two spans are one implementation copied and then locally edited \u2014 114 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":"web/src/lib/apply/session.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b8a97ab2ee48984f600aea3d5474cbb2c099b2af32b61c106e64186b6691fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/lib/run-cli-support.mjs:234 \u00B7 web/src/lib/run-cli-support.mjs:300 \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":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"543afc34b01f60bc17f953433190907913f52dd152ba79ddab63cebf418c9647"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): analyze-patterns.mjs:889 \u00B7 invite-match.mjs:739 \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":"analyze-patterns.mjs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"c101b8f3e16092d9baeca40a1b44c2e4a417995dcc07b958ef9bcf644862cef5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): analyze-patterns.mjs:1783 \u00B7 followup-cadence.mjs:1042 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ad91faf0102fd0e994f245366b9b4db3f0c34d0c62061e4e9b4a507f3d253d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): cv-title-check.mjs:328 \u00B7 jd-skill-gap.mjs:616 \u00B7 story-provenance-check.mjs:729 \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":"cv-title-check.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d5b61b2b88720f292dfd03e75f524b7da701139b7886c5378340dfa04a95a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): keyword-match.mjs:758 \u00B7 keyword-match.mjs:885 \u2014 both copies are in the same file, so extract the block 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":"keyword-match.mjs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"345a4bf80aaa2bc067f9b18fece7019c63d8963b024f47883ab474877137c867"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:363 \u00B7 providers/ultipro.mjs:370 \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":"providers/adp-workforcenow.mjs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a2f7e5954ae743d3de7b017d26fdf09dfbb13f4de40353027c082b3943bb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/ashby.mjs:160 \u00B7 providers/greenhouse.mjs:25 \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":"providers/ashby.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea829ff1620a16355df927088515bfc649256d3fb36a0ce664c50ccc122573"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/flowxtra.mjs:127 \u00B7 providers/yourator.mjs:188 \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":"providers/flowxtra.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f017e685b51a3f9b7c11859e0520803378cb4e2d56715b035ae858e480766e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): providers/himalayas.mjs:38 \u00B7 providers/nodesk.mjs:72 \u00B7 providers/weworkremotely.mjs:71 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/himalayas.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"96af8982676b12a9f3c3481aa2553d6b18845739416a207aa8078118ac84a188"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/homerun.mjs:150 \u00B7 providers/jobbankca.mjs:110 \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":"providers/homerun.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"730e706904c8f4cd60f70fd175dd8f7889a4112e040b85e35281c87500723396"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): providers/jobspresso.mjs:53 \u00B7 providers/nodesk.mjs:72 \u00B7 providers/weworkremotely.mjs:71 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobspresso.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daed86b0f278c7ca148258f6700a7a70e016d4ddc28567c5cffa6d63631438c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/oraclecloud.mjs:92 \u00B7 providers/smartrecruiters.mjs:81 \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":"providers/oraclecloud.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8594f4732adb3727929b3ce0a3adf0811eabcc45b8052372302f3a5691dff35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/remotli.mjs:228 \u00B7 providers/workable.mjs:100 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/remotli.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6686d7163626c4f1a6243f0bd76d2e19b0d2930d2b9d523fdcecbc941766503a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/export-ats-text.mjs:298 \u00B7 scripts/export-ats-text.mjs:326 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d14853f7774e6a01da984139e535dc257725111f5e55a175ec886a2032eb70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): sync-pdf-flags.mjs:92 \u00B7 sync-pdf-flags.mjs: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":"sync-pdf-flags.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3276db372be204c7af8a1dd57b17bf2b850bf3f951f33922cc5425cbc5a58c56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): test-all.mjs:6228 \u00B7 test-all.mjs:6256 \u00B7 test-all.mjs:6270 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":6228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4933cd90b78180fe859911a08b4a3f787e0b5f7d0320dda09abcc4ff37ec729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): test-all.mjs:10641 \u00B7 test-all.mjs:10658 \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":"test-all.mjs"},"region":{"startLine":10641}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec6e2bcb2d1074985710c6a62d25f1a426df1e3a87e8530fdb756fe6268cbb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): update-system.mjs:5680 \u00B7 update-system.mjs:5723 \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":"update-system.mjs"},"region":{"startLine":5680}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ae13192a36e28ad95ecf940c99e8d557448f53a02a12c2e1bf69d2a090f2ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): web/src/app/api/company-history/route.ts:31 \u00B7 web/src/app/api/quiet-companies/route.ts:26 \u00B7 web/src/app/api/upskill/route.ts:25 \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":"web/src/app/api/company-history/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e5a968eb9a26e59ee8b065763e260a331c111592ef0b42fcf1075d0390569d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): web/src/components/assistant-console.tsx:280 \u00B7 web/src/components/inbox/inbox-triage.tsx:72 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f8bffabc33d59837563c9b145c1cb27422b39dcc64f703abefb3955c94bc75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): web/src/components/company-evidence.tsx:34 \u00B7 web/src/components/keyword-coverage.tsx:45 \u00B7 web/src/components/skill-gaps.tsx:55 \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":"web/src/components/company-evidence.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd6a5e62fd877fedfdf4909df3870b12e1188e7f371e8ff6c1e066bd985ea72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/components/keyword-coverage.tsx:115 \u00B7 web/src/components/skill-gaps.tsx:171 \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":"web/src/components/keyword-coverage.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7044aa2dc17d7b48d5581cffdcae21ec7d7083f7f5888346f909bf6fa569fbfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): archive-posting.mjs:312 \u00B7 liveness-browser.mjs:352 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"archive-posting.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d7fd7edd1b244d2c579e3f5e3821cfc43441926a1e0e48a2803e713ef8454b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): batch/aggregate-tokens.mjs:169 \u00B7 batch/aggregate-tokens.mjs:220 \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":"batch/aggregate-tokens.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e4d63d453f0d7c027143a00b798660d37509c45d0edce542eb0a5d185996ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): build-cv-latex.mjs:163 \u00B7 patch-latex-content.mjs:27 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-latex.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd7719b2a4258a49613b75920a725d39934a6363000b3aa1ecb695c17b59737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): check-table-freshness.mjs:346 \u00B7 discover-ats.mjs:926 \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":"check-table-freshness.mjs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"2800e8c3a6151060ae32b77c434b383fb457511c6ffe96e20c65d299381c22fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): close-stale.mjs:393 \u00B7 closing-soon.mjs:523 \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":"close-stale.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5a6d757d752782093aaf7380b4f1b1917ee5a3724d9f0cb466f41824df0611"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): followup-seed.mjs:720 \u00B7 followup-seed.mjs:737 \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":"followup-seed.mjs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe97b63d813ac4b93828ac712c592ce5009f05ac58ca05b1d04c2fab5f157886"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): funnel-velocity.mjs:566 \u00B7 funnel-velocity.mjs:589 \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":"funnel-velocity.mjs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a8d39b07b9dfc160fedb1e83f85c8f073196ff8504e763997554adb2469c3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): gemini-eval.mjs:500 \u00B7 ollama-eval.mjs:415 \u00B7 openai-eval.mjs:452 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gemini-eval.mjs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1daabdd23fa8dc308c57ec59317a3c5ce3626b0bd2f85a0e568d80235e2411"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): gemini-eval.mjs:544 \u00B7 ollama-eval.mjs:447 \u00B7 openai-eval.mjs:484 \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":"gemini-eval.mjs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c93f2be0aeffd2f91efa72551d37c36fc272f450630ce62627c379474cc39a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): gemini-eval.mjs:634 \u00B7 ollama-eval.mjs:527 \u00B7 openai-eval.mjs:564 \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":"gemini-eval.mjs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"591008d635cf26e618eea3fa4229f930f6920dcf982f82dd8d38c168a093fed7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): liveness-api.mjs:225 \u00B7 liveness-api.mjs:305 \u00B7 liveness-api.mjs:335 \u00B7 liveness-api.mjs:466 \u00B7 \u002B2 more site(s) not listed \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-api.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba112a8257cde67468a4d352d94cc250c643faea73fbfde17c1cc54a634ac952"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): persist-evaluation-report.mjs:164 \u00B7 plugins/h1b-sponsor/token.mjs:169 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"persist-evaluation-report.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63f23fddd59770956687242373d28a01413d2a773bfe9d9b0b05671b96579f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:397 \u00B7 providers/ultipro.mjs:399 \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":"providers/adp-workforcenow.mjs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdcee47bf64cc9d45c662742dba0230a56c3feb5c1dfb9475447e7b2d2c8b8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/csod.mjs:108 \u00B7 providers/peoplesoft.mjs:412 \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":"providers/csod.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c27cab2445489b7fd5f20d72afdfdaa784115e3b01da875d716b875366d3cbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/dassault.mjs:168 \u00B7 providers/successfactors.mjs:423 \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":"providers/dassault.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9f361f409f268955e4d818b34dbce7a6d1923007b0d7cf245f5601f51a4ee7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/echojobs.mjs:75 \u00B7 providers/eightfold.mjs:310 \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":"providers/echojobs.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad71572edf855209b81a4ba932bf3fc74b299a49b066bdf565cb1ed97da0eac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): providers/homerun.mjs:98 \u00B7 providers/paylocity.mjs:175 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"providers/homerun.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1839c3d28d89f6368d67ebe0a0f3ba5cf732b9f53b022273216252f0ff11d08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/jobbankca.mjs:83 \u00B7 providers/ultipro.mjs:126 \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":"providers/jobbankca.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"88137762ad703e01d5adaa7ecc1eb397256fc47d35f7a03eed83fc9c7aa61718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): providers/jobspresso.mjs:32 \u00B7 providers/larajobs.mjs:42 \u00B7 providers/nodesk.mjs:38 \u00B7 providers/weworkremotely.mjs:38 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobspresso.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e59655c0c6934ae949a65c806f2e1b0a1ccee10b1d9cad544a7008909c1bf54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): providers/jobvite.mjs:84 \u00B7 providers/lever.mjs:10 \u00B7 providers/torre.mjs:106 \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":"providers/jobvite.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f2fc6d4576fc39546a3641d676306e64e7b98f8ead248050d08fc616c15f1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): providers/mycareersfuture.mjs:94 \u00B7 providers/pythonorg.mjs:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"providers/mycareersfuture.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37e5c2d9867faf11dfc63661abc1ece67ef21fea9a8c46e2000660513adfb76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/pinpoint.mjs:55 \u00B7 providers/recruitee.mjs:65 \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":"providers/pinpoint.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5710a0417665ffc46530c717e7f247056dee292536211d64aa914ff2bb58ad98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/radancy.mjs:517 \u00B7 providers/rheinmetall.mjs:140 \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":"providers/radancy.mjs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89cdd9163509d29fbe64c24fc73d00b736cdb4d4de59a8a39097d764130d44f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): role-clarity.mjs:211 \u00B7 role-clarity.mjs:242 \u2014 the two spans are one implementation copied and then locally edited \u2014 107 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":"role-clarity.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a904414b607fdb07ecd2ec5463c95d881f01ac0aa3efe578987f062816b06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scan-ats-full.mjs:1167 \u00B7 scan.mjs:3883 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21b27650510b8160e43b28bddfab947181b2b9e3f55d9cd85d60a514dfb19a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): story-provenance-check.mjs:826 \u00B7 story-provenance-check.mjs:886 \u00B7 story-provenance-check.mjs:923 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"story-provenance-check.mjs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"23144133900971d8e791ca45a543d9e51298d70a5a7426edd3e3e5a3e0df2d63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): test-all.mjs:4246 \u00B7 test-all.mjs:4292 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":4246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b27452a37c6743faafa343bdde541824548a1b4aeb1e6e1daa4646db337c638"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): test-all.mjs:11846 \u00B7 test-all.mjs:11915 \u00B7 test-all.mjs:12086 \u00B7 test-all.mjs:12275 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":11846}}}],"partialFingerprints":{"codehealthFindingId/v1":"f054dd4c2d7e6c883fe44b7363b0b2eb04b5e6f76d6aa1d9654f857e66c9e937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9 locations): test-all.mjs:12325 \u00B7 test-all.mjs:12395 \u00B7 test-all.mjs:12507 \u00B7 test-all.mjs:12584 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":12325}}}],"partialFingerprints":{"codehealthFindingId/v1":"326e89769d06c8c25403746d36a282e679c6deb73ca8ea7bbbac5a0527d78d55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): test-all.mjs:13983 \u00B7 test-all.mjs:14004 \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":"test-all.mjs"},"region":{"startLine":13983}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f16cbd01bda7d46b351e0eaa12b85452cfd6731846f1754038b03058001cb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): verify-cv-facts.mjs:3111 \u00B7 verify-cv-structure.mjs:725 \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":"verify-cv-facts.mjs"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b49d6a3445463b5e2414d4d498bcb733aa6c839ac7aed507e3bee949299ef4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/app/api/patterns/route.ts:33 \u00B7 web/src/app/api/stats/route.ts:31 \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":"web/src/app/api/patterns/route.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7742e0ef160e20c96f6ec487c9ae1d1c99b68bbf2a61ee6e73d9d25866c118"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/apply-checklist.tsx:87 \u00B7 web/src/components/apply-checklist.tsx:101 \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":"web/src/components/apply-checklist.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d8d28cef1dcc43c0bc0035fab2c727c43472d2a25bf8a49dc7a5ed0f345856"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/apply/apply-provider.tsx:170 \u00B7 web/src/components/apply/apply-provider.tsx:406 \u2014 both copies are in the same file, so extract the block 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":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57966bf675e7872bdb7ac044a08d84ad579ac167c3950d2bab8c2d12a4bc336"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/followups/followups-view.tsx:219 \u00B7 web/src/components/pipeline-view.tsx:185 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac5faada366bc658243db28e2b64ed43b5dc9af1a34e47864204c035c0fb31e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/followups/log-dialog.tsx:44 \u00B7 web/src/components/home/follow-up-card.tsx:34 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/log-dialog.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae4649081f72580f6f9ef2b21a9475056f97b908d6cec314b656ac1f98845f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): web/src/lib/apply/fill-stream.mjs:50 \u00B7 web/src/lib/job-stream.mjs:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/fill-stream.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e651d158bc3174a88827e90ba78e1781c7cc90f2a0a9bdf3a33bd8ba91430ed9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/lib/core/scan.ts:262 \u00B7 web/src/lib/core/scan.ts:300 \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":"web/src/lib/core/scan.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36ed121314f648ccd98a3fef47c039fd7dc7ec229bcbbb2bcd1c4e92c19ae25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): analyze-patterns.mjs:1992 \u00B7 followup-cadence.mjs:1131 \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":"analyze-patterns.mjs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcee8e4682bc95325316deff4fde4f7df2782d349760a16a2a4151d0fb26668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ats-vendor.mjs:32 \u00B7 providers/clearcompany.mjs:53 \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":"ats-vendor.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bab99fa427a3464d0582865dbb417b8ddb4a201605d05a2d024d9bcd3bf1e9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): batch-evaluate-gemini.mjs:328 \u00B7 ollama-eval.mjs:453 \u00B7 openai-eval.mjs:490 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch-evaluate-gemini.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7389061474ad0f43512d666b378848f4847547d85aeff03422024dd3366df4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): batch/aggregate-tokens.mjs:174 \u00B7 batch/aggregate-tokens.mjs:225 \u00B7 utils/token-tracker.mjs:158 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/aggregate-tokens.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca01d4f11b2c9dc3a309f03bf8259cf04704f454b036b57e4942ef7990ebdc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): browser-extract.mjs:361 \u00B7 browser-extract.mjs:446 \u00B7 browser-extract.mjs:537 \u00B7 browser-extract.mjs:621 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1f861fb92906df6df302c4197aea8170bd958478cf8438e598b768e30c0f5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): build-cv-html.mjs:488 \u00B7 build-cv-html.mjs:557 \u00B7 build-cv-html.mjs:596 \u00B7 build-cv-html.mjs:626 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5ca614d1a9a1acced438f09e19f62a156c302c5a55dbdb9b2a80c7e849cbbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): build-cv-html.mjs:589 \u00B7 build-cv-html.mjs:621 \u00B7 build-cv-html.mjs:655 \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":"build-cv-html.mjs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"54280e4f16d08efe7cae825a27c712fc9d1c4865add2c99037e5278175582222"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): build-cv-html.mjs:1107 \u00B7 patch-latex-content.mjs:34 \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":"build-cv-html.mjs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1026b9ca8d5f4c025e2198142ff3ca7141c1df61ef792dad03b2e59bb2614a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): build-cv-latex.mjs:71 \u00B7 build-cv-latex.mjs:88 \u00B7 build-cv-latex.mjs:113 \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":"build-cv-latex.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"040e99950569a1d4b9980f6198e54e7dabb5178f83c2ecab5f4582ec4b73ae30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): check-jd-archive.mjs:741 \u00B7 tracker-sync-check.mjs:554 \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":"check-jd-archive.mjs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbd9a7a6f8acd87a9ae7d3d414f96a759dd9561c73e074da673e50589ce81bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): check-jd-archive.mjs:1239 \u00B7 seed-fixture.mjs:104 \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":"check-jd-archive.mjs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8470e5e1ae9ff5f72d99375f2e698d3047c9317fe3b6ca868a48f8162b2e684c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): extract-latex-content.mjs:38 \u00B7 generate-pdf.mjs:1953 \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":"extract-latex-content.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fe2ed55b888bcb930ce0db88182a14ca70a62892c74dc2a9712a16456637de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): fix-slugs.mjs:406 \u00B7 verify-portals.mjs:1228 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fix-slugs.mjs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04174cce837197b3fe6b8745a226937675984e6f78128f28e9152e7ac1dd0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): followup-cadence.mjs:482 \u00B7 followup-seed.mjs:231 \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":"followup-cadence.mjs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f6e6da7997cd1a4afae88e57b91613cae2c3532ba8e90f05da4bf04eb24170"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): followup-seed.mjs:517 \u00B7 followup-seed.mjs:589 \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":"followup-seed.mjs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4da0dca7b89a188ee0b564f06a3556ab0df14f95f808161fd8f2ba46791a8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): followup-seed.mjs:258 \u00B7 tracker-utils.mjs:584 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 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":"followup-seed.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"603b325867d6accf826b1876385f07aba77dfa5ca129f027ad7c78b639d742b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): funnel-velocity.mjs:376 \u00B7 invite-match.mjs:742 \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":"funnel-velocity.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50cf6be7871c0a0c7e5dac4fd75969237ff7c8754e2ced420c953bc7d1b25c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): generate-pdf.mjs:1831 \u00B7 intake.mjs:489 \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":"generate-pdf.mjs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"0573bfa2996b01796741b9d5051b769640980639313dcfbcc9ca0c1004f1b61f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/golden-budget-analysis.mjs:27 \u00B7 ollama-eval.mjs:167 \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":"lib/golden-budget-analysis.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea776471f3985ae97f7836c96525fcf6c4c0c6e7a73f787fb553c10c3a5cc4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): negotiation-roi.mjs:706 \u00B7 negotiation-roi.mjs:718 \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":"negotiation-roi.mjs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d66f8f29b870ce88f772990b7c6350a986905e689cf410fe980b830b6f22a16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ollama-eval.mjs:335 \u00B7 openai-tailor.mjs:281 \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":"ollama-eval.mjs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a158bd0b6b3b02c19e078fef441ebe337ca680fac58f86f9422bb1d1bf9213"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): providers/amazon.mjs:87 \u00B7 providers/avature.mjs:181 \u00B7 providers/dassault.mjs:144 \u00B7 providers/garena.mjs:111 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff96c5c960756282403ef19a8200240e0d2bcacffc128c013ad9d63e3b90544"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/ashby.mjs:252 \u00B7 providers/ultipro.mjs:301 \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":"providers/ashby.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db025c245b671e24a1c9f54a8859bccad9fb776e1afa3e8af1463082ce7ad18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): providers/avature.mjs:60 \u00B7 providers/beesite.mjs:55 \u00B7 providers/deutschebahn.mjs:58 \u00B7 providers/hecklerkoch.mjs:32 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 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":"providers/avature.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6c7c86e8aec003687a9beb3dac1edb8b79f7aebb80d90ef72f54718ce3fbfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/collage.mjs:51 \u00B7 providers/himalayas.mjs:29 \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":"providers/collage.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4009d0f3ff9c31fe4c7994ae4d9c1d5dc102b6bb51313c9ec9d930909945ee2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/collage.mjs:14 \u00B7 providers/kalibrr.mjs:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/collage.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31c3105b4565a1e46a746660c69653c580327535575f4b86460a853be5dc6f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/consider.mjs:42 \u00B7 providers/getro.mjs:57 \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":"providers/consider.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2fcf67f80c055b3c6ce89b058afc29523c7e7bb4b87cffb94c53c9902efc2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): providers/consider.mjs:42 \u00B7 providers/getro.mjs:57 \u00B7 providers/joinup.mjs:22 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/consider.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cca265b09dfed3bedce1045c5a28b1c19e725e6820f0445f119cce48dd3e69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): providers/dover.mjs:55 \u00B7 providers/notion.mjs:75 \u00B7 providers/recruitee.mjs:29 \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":"providers/dover.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8620503f82df388b152aab1bae6fdd063d64deb80256240040c1907c4e415ab6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/eightfold.mjs:152 \u00B7 providers/ultipro.mjs:110 \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":"providers/eightfold.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be911f84e1e69a78e64e0ded958458aba8e7a704b33ffeede4848b64d716916"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/feishu-jobs.mjs:87 \u00B7 providers/meituan.mjs:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"providers/feishu-jobs.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c5560e2c1976faeb987840735fc4fb87c4ee2a56a6d0352ed42954c4905a90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): providers/gem.mjs:132 \u00B7 providers/gem.mjs:147 \u00B7 providers/jobvite.mjs:127 \u00B7 providers/pinpoint.mjs:39 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gem.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1444941018caf39037424b7ca18aed266fef40da61d904e60449a88899682"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/greenhouse.mjs:191 \u00B7 providers/greenhouse.mjs:206 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d191161c5965deff7697be634a7f7f2e7771c0b778e7a7365454a3f5d5ca857f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/homerun.mjs:73 \u00B7 providers/teamtailor.mjs:56 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/homerun.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f50f8fb47d41316a17106ddbcd1bb98ece28ae244c4dff7a9208505c41f6e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/homerun.mjs:74 \u00B7 providers/wp-job-manager.mjs:69 \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":"providers/homerun.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a315afa2ac95890eb96ef00b9377ad3ec04752a54845ab614dbd3bc94053ec9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/kalibrr.mjs:128 \u00B7 providers/yourator.mjs:140 \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":"providers/kalibrr.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"66307ad9d9527efe122971dbb27a63fbc4044082c07c6df5cd3f7faa8fdcfe98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): providers/personio.mjs:99 \u00B7 providers/pinpoint.mjs:40 \u00B7 providers/recruitee.mjs:30 \u00B7 providers/remotli.mjs:252 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727649f39af246a56a97060de69e3b3205055ff41c4475b3be3dfc613a41b8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/personio.mjs:117 \u00B7 providers/recruitee.mjs:51 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a99c37f7bb0cd66aaaf095a03082aa20b82c0d1bc7b761ed612edc2d685a35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/personio.mjs:368 \u00B7 providers/pracecz.mjs:87 \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":"providers/personio.mjs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0247aaa73b9e35691b482613c04ebf94a76d43252ec416bbd9dfb96bc093c5ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/phenom.mjs:153 \u00B7 providers/radancy.mjs:307 \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":"providers/phenom.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ad420f6fbdc97ae78c21a6bbabacfd8645588d4a8ba0012fcb0e54ef95cc7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/teamtailor.mjs:58 \u00B7 providers/zoho-recruit.mjs:72 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"providers/teamtailor.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7968544dcda0a16b1a7ffa5d3a4c914f3080deace3653df82f5068c7443ae32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): reconcile-pipeline.mjs:75 \u00B7 sync-batch-input.mjs:323 \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":"reconcile-pipeline.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"066cb1d9b2732c08af2104e0bc4a57d616c9108a70dbce5af3a13993bb7df48d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): test-all.mjs:3691 \u00B7 test-all.mjs:3812 \u00B7 test-all.mjs:3906 \u00B7 test-all.mjs:4757 \u00B7 \u002B3 more site(s) not listed \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":3691}}}],"partialFingerprints":{"codehealthFindingId/v1":"501844559d5c6e108c3a0ad5ff38dfa172add2edc81d7decc378f3e997bcdc6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): test-all.mjs:4027 \u00B7 test-all.mjs:4277 \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":"test-all.mjs"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33256bb260c3522d572e3dc24d6a47a63e0376ff58b534bb075c2d7dca13499"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): test-all.mjs:8694 \u00B7 test-all.mjs:8733 \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":"test-all.mjs"},"region":{"startLine":8694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddce8e96890699aff03f79d54f618dfccdf8196616a98866e4d7f7ad00b8160"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): test-all.mjs:13261 \u00B7 test-all.mjs:13333 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":13261}}}],"partialFingerprints":{"codehealthFindingId/v1":"425beb835e055636a5aeb5d6e4c927134d553d58472b876428ce91b4cf0a7ce7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): update-system.mjs:5511 \u00B7 update-system.mjs:5537 \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":"update-system.mjs"},"region":{"startLine":5511}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05e14154a2cb20056ea3b1ed72cacfceaafa359be7543d15133f17209b77121"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): verify-cv-facts.mjs:1386 \u00B7 verify-cv-facts.mjs:2331 \u2014 both copies are in the same file, so extract the block 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":"verify-cv-facts.mjs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"013a2db97c3efd9cc7b187263efa73f1b6a6543d6d6d3d2ad5a8caf63807a6a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): web/src/app/api/explore/route.ts:9 \u00B7 web/src/app/api/tracker/delete/route.ts:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"web/src/app/api/explore/route.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8cf998fa6772709dd73a560ac5ed29d68c129f4a540557fd735cb2c96f14fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): web/src/app/api/followups/cadence/route.ts:112 \u00B7 web/src/app/api/followups/log/route.ts:46 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"39160446e18499038703daa377839241b6552c12bc5623796a721a97b5116efc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): web/src/app/api/followups/cadence/route.ts:44 \u00B7 web/src/app/api/followups/route.ts:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2279eee3d8513951318a1a20292ac37dc5336641f553cfa6989eb95ee76b51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/app/pipeline/[id]/apply/page.tsx:22 \u00B7 web/src/app/pipeline/[id]/page.tsx:10 \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":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"99327cac190df611260815a934053236126670dabf8bdd6a1680cb189f89a21c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): web/src/components/home/first-run-home.tsx:14 \u00B7 web/src/components/home/today-dashboard.tsx:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/first-run-home.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634882edae353e9cc233909f8de7e6b33ceba8c1850cd28676f7df04c950c1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): analyze-patterns.mjs:321 \u00B7 upskill.mjs:267 \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":"analyze-patterns.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72433957a776af628a23b2eedcccf23fbec9567dd77db875be3b4b773c9de5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): analyze-patterns.mjs:1313 \u00B7 analyze-patterns.mjs:1328 \u2014 both copies are in the same file, so extract the block 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":"analyze-patterns.mjs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce8fe931cf988df907a58bcb0d3a4f27ef268e5338eb55a1e78157736ec319"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): application-answers.mjs:17 \u00B7 i18n-drift.mjs:32 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"application-answers.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"650fb65b8f5b0abf33a89de65c5c5bcf9e14406f52959b332cf3131e2fc6af34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): assessment-log.mjs:375 \u00B7 contact-lookup.mjs:102 \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":"assessment-log.mjs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"901677eec6763b8955b829b169c0f5846fcd6281ed466aa1af6a2e63958e936e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): batch-evaluate-gemini.mjs:42 \u00B7 ollama-eval.mjs:56 \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":"batch-evaluate-gemini.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a67db22ffe0b992b6c433e28e25e145a197e94fd9d0cd8675f0a9414aafdbe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): browser-extract.mjs:192 \u00B7 providers/workable.mjs:222 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90f6fffe21200b6f1c4d72e79a230e74b7ff1d196fd29efc12386928df34ba4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): build-cv-html.mjs:578 \u00B7 build-cv-html.mjs:608 \u00B7 build-cv-html.mjs:642 \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":"build-cv-html.mjs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"901da55149031c0b2c95929008a098000db63e73bb8c6d64870a307f56169667"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): build-cv-html.mjs:1057 \u00B7 build-cv-latex.mjs:143 \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":"build-cv-html.mjs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7c60c62f2a61254d557ef7056b1297d5150c4cc8b4583e4735545dc3c95e94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): build-cv-html.mjs:1465 \u00B7 build-cv-latex.mjs:365 \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":"build-cv-html.mjs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15cfebe2940931c4b942b189b63fad88aaecb4e7827e312b691454dc93f07a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): company-history.mjs:988 \u00B7 weekly-digest.mjs:388 \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":"company-history.mjs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d87ea46b3f88604f3926be1806f0dd047da65acbca17f88408fccbb64f6463"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): cv-title-check.mjs:738 \u00B7 intake.mjs:489 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"cv-title-check.mjs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b01333b0fc25441f5241b16d38692c3f8cdfe40daffaa938c0becff95b1563d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): hired-share.mjs:102 \u00B7 intake.mjs:184 \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":"hired-share.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e90c36b44f8c53dda65c32161ab293414e84ee17f47a27410ccf0661075620b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): jd-skill-gap.mjs:1230 \u00B7 story-provenance-check.mjs:971 \u00B7 tracker-sync-check.mjs:768 \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":"jd-skill-gap.mjs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"435e64a2b329b61711a968b35203bcee95bac532772950e304a4c80d844d43f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): jd-skill-gap.mjs:1277 \u00B7 story-provenance-check.mjs:1022 \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":"jd-skill-gap.mjs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"354e282891840321577db95fa2b71da72ee688ab4bb704ad15ffa16e42037453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): liveness-api.mjs:106 \u00B7 liveness-api.mjs:181 \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":"liveness-api.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965bb7ee036a80403d1e4edb721a2e687c1006125cf78255e7eb66dbb60c25d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mark-pdf-ready.mjs:98 \u00B7 set-status.mjs:521 \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":"mark-pdf-ready.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd0be177c1181bdbe5ae838a909c24c1234956e34f18b3cc6ceab04243b8758"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): merge-tracker.mjs:1241 \u00B7 merge-tracker.mjs:1275 \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":"merge-tracker.mjs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"53041844dfbb8881a03569934261b24a7263dba51b160c48c3d4137007aa91e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): merge-tracker.mjs:1692 \u00B7 merge-tracker.mjs:1706 \u2014 both copies are in the same file, so extract the block 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":"merge-tracker.mjs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"af70803cd65359d6ea645162b1e4e1b983c464fea560a670c50de6bd4a7ad4ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): plugins.mjs:116 \u00B7 scan-hn.mjs:47 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f733fe6cf490e763b353a51d0491a9b0f5c88a75ca70a1dd74f2d2644012fdcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): plugins/_lock.mjs:168 \u00B7 update-system.mjs:861 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_lock.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d342924813148fa3ebb8fba5a7bf11009187e0d56a97822251ca3f3c1402d61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): plugins/h1b-sponsor/install-h1b-index.mjs:166 \u00B7 plugins/h1b-sponsor/lib/api.mjs:206 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"066093cc10091d67bb48f6ea5d45d198dc778659e15b7e011dce8baa262f195d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/4dayweek.mjs:28 \u00B7 providers/generalist-world.mjs:305 \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":"providers/4dayweek.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"05086ade76990c68b678936b37dc233eb2e5c264296316f82923036fcc18b64d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): providers/_wp-job-feed.mjs:16 \u00B7 providers/higheredjobs.mjs:62 \u00B7 providers/jobbankca.mjs:98 \u00B7 providers/pythonorg.mjs:45 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_wp-job-feed.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fae6fa34590e108bea17dd327101fe6ca9c57672b6304af671f9cb959c9ad7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): providers/a16z-speedrun-talent.mjs:51 \u00B7 providers/dover.mjs:82 \u00B7 providers/flowxtra.mjs:37 \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":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6d91716da99b411321a7567dd9bf748d2517d3aff45c9d447284503680ff75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 21 locations): providers/ashby.mjs:160 \u00B7 providers/bamboohr.mjs:58 \u00B7 providers/breezy.mjs:19 \u00B7 providers/gem.mjs:118 \u00B7 \u002B17 more site(s) not listed \u2014 the 21 copies are spread across 21 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":"providers/ashby.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c84d36f9946d622eef1a8f34a0602c6f16e88056b0cdea5e4452249dc176843"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/beesite.mjs:86 \u00B7 providers/csod.mjs:101 \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":"providers/beesite.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f021b9fd94eb7784a30ef742d9d651e2320a2a1a852ae89b6286af36c03901c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): providers/builtin.mjs:164 \u00B7 providers/hiringroom.mjs:25 \u00B7 providers/pythonorg.mjs:21 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bfcbc274f74614867a4307e4c39655e28bcb3bcb093f791d2c63184f3c947f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): providers/comeet.mjs:78 \u00B7 providers/lever.mjs:101 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/comeet.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1deefbef85be7849c0b699b23df1fc370e8bf3eae241e9cf8a613b81699083e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): providers/gem.mjs:148 \u00B7 providers/personio.mjs:99 \u00B7 providers/pinpoint.mjs:40 \u00B7 providers/remotli.mjs:252 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gem.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cd4801a27f3001c94a18c8dda5713df63626cdfd609b180bf9a3361abc073b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): providers/getonbrd.mjs:126 \u00B7 providers/landingjobs.mjs:89 \u00B7 providers/rippling.mjs:142 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/getonbrd.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96155c3c3f09aecc23ec9e749f102bac121b0d7ee8a4b4963b71bd00dcdbb65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/icims.mjs:138 \u00B7 providers/rippling.mjs:166 \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":"providers/icims.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4bf9ac7f3659b59938a0792e85a6b4cbb57c0d1e27031b363b84091bbdc558"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): providers/jibeapply.mjs:17 \u00B7 providers/neogov.mjs:31 \u00B7 providers/schoolspring.mjs:22 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jibeapply.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a879585b4994296920a59e5ce383ffcb47e03e912f64df8be0e60d96ace5576"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/join.mjs:137 \u00B7 providers/paylocity.mjs:101 \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":"providers/join.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6f0bcd9aca149bdcf1ed75f401e33a32917cb2ade066501368b8b72f4c3bbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/lever.mjs:63 \u00B7 providers/remotli.mjs:144 \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":"providers/lever.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"129ddc872649b057d292ed14e9f24e6c36f954e6723a9f2ad93654b2fa8c2837"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/paylocity.mjs:80 \u00B7 providers/redrover.mjs:50 \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":"providers/paylocity.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af44e728a267be74fed8d96b74f778bbba24322ab85dde25a2a2c690aa31d17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): providers/peoplesoft.mjs:230 \u00B7 providers/techinasia.mjs:98 \u00B7 providers/wttj.mjs:58 \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":"providers/peoplesoft.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d92bc1f380f3a52fa63ccb1eca05865854ec68fbbb0c896aa9b897909fdfa32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): providers/personio.mjs:383 \u00B7 providers/startup-jobs.mjs:137 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbc996ce5209b03e561e94668a9c092ef22b4cc75f168960ee2992de253c4dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): providers/personio.mjs:383 \u00B7 providers/teamtailor.mjs:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c4f429f2340007d11385f4f2def4533a7f55f10f9e9cb59e144b1326ed7d08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scan-dayforce.mjs:427 \u00B7 scan-dayforce.mjs:445 \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":"scan-dayforce.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc6fe3ed9022992cdbdd1969aed3fae7db897e342a07839cba8316b1743d8d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/export-ats-text.mjs:71 \u00B7 scripts/export-ats-text.mjs:91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1351d4e388ffc52df6ddf275cb6ca7bf1d7f8a6d1479c899c0e0f861aafc24f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): test-all.mjs:1867 \u00B7 test-all.mjs:1877 \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":"test-all.mjs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdacfd1773a9c5f1c2eb537c2db30eda820f4d805ef9d39ea6d7d8b1c88559d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): test-all.mjs:7422 \u00B7 test-all.mjs:7449 \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":"test-all.mjs"},"region":{"startLine":7422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93a264e648de7216bfc7da4451fc3b58add2c289dcf71b357bd05b8a2d47e2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): test-all.mjs:13188 \u00B7 test-all.mjs:13207 \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":"test-all.mjs"},"region":{"startLine":13188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39ce91005c1e218e4d0d4d6c06863059d15983f8d1bb6f344df8536c44257e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): test-all.mjs:14339 \u00B7 test-all.mjs:14418 \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":"test-all.mjs"},"region":{"startLine":14339}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b926f8feb3c4f65e7e67fd623cbe38d1c19c1062a8945a93964930533611e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): update-system.mjs:4773 \u00B7 update-system.mjs:4895 \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":"update-system.mjs"},"region":{"startLine":4773}}}],"partialFingerprints":{"codehealthFindingId/v1":"756a9e2247e5200cb7449f817420086beb59854ba992b5e787b95877ff061292"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): url-key.mjs:326 \u00B7 web/src/lib/core/url-key.mjs:99 \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":"url-key.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6c4533af636c39a4180dbf2369a6dee8bd16ef2ded570af5fa1c5ed87d38b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): validate-system-paths-coverage.mjs:142 \u00B7 validate-untrusted-content-coverage.mjs:148 \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":"validate-system-paths-coverage.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeb50016302ccf69f9259a02454e342dfb8ed1eb4d814b0ae613153daf86037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): verify-ats.mjs:1103 \u00B7 verify-ats.mjs:1170 \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":"verify-ats.mjs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f1499aac156df9626248fda16ff7c99165a44f810df1d280e87fc9ef7be416"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): web/src/app/api/cv/route.ts:14 \u00B7 web/src/app/api/personalization/route.ts:38 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/route.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e89729aac88f916a15bea08a19a9bc1ab30eb0ec5e1303275ec75337faeac7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): web/src/app/api/explore/ai/route.ts:24 \u00B7 web/src/app/api/tracker/delete/route.ts:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1dfd251a3596722f695fbaed573313b15c05ca0c3078499ca1696e0d7c1d14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/app/api/followups/log/route.ts:98 \u00B7 web/src/app/api/followups/override/route.ts:66 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab514a040f5eaeaa992e6f636a33cf165df44735a6e15527e08e4eb00e8d121f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): web/src/app/api/memory/route.ts:2 \u00B7 web/src/app/api/tracker/delete/route.ts:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"web/src/app/api/memory/route.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f497ccb2ec9649c35215874aecb822d78086405de53b74b4e1b76a7701add377"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/app/api/run/route.ts:560 \u00B7 web/src/app/api/run/route.ts:597 \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":"web/src/app/api/run/route.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b260b7b5bdebe0c11eb0a9679b073b88d8f0fd1d4eae03380d01e3c98a4f3819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): web/src/app/api/tracker/delete/route.ts:66 \u00B7 web/src/lib/apply/agent-interpret.ts:105 \u00B7 web/src/lib/apply/drive.ts:117 \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":"web/src/app/api/tracker/delete/route.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb635816626f0627baffff700c2c187f3a26ea3cab2a26731ce27d4365a6c62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/components/explore/explorer-view.tsx:341 \u00B7 web/src/components/explore/explorer-view.tsx:399 \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":"web/src/components/explore/explorer-view.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e10edcd7bf0d79d1284520b0397e153b75dd1e814b1279b746af354f08dffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): web/src/lib/assistant-file-write.mjs:13 \u00B7 web/src/lib/assistant-status-write.mjs:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/assistant-file-write.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63e17c608f4f3baa18ec411f7dd42630f78ae01fd04b9f9510ac54f4d5409e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): analyze-patterns.mjs:797 \u00B7 upskill.mjs:706 \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":"analyze-patterns.mjs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6479a8b30af678d39c1c4aa975e5b5c5974f18bb2a0114a02e733ccf11bb328"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): analyze-patterns.mjs:1974 \u00B7 analyze-patterns.mjs:1983 \u2014 both copies are in the same file, so extract the block 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":"analyze-patterns.mjs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"822fb6f5eff792536381b047d0f51888029cf33052d93e1826d76baea1791ec9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): apply-scope.mjs:117 \u00B7 seed-fixture.mjs:108 \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":"apply-scope.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89ce0f398597722e6d6f2893159ae551e4c566803f5e2a2c991b8fe2765f109"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): archive-posting.mjs:134 \u00B7 archive-posting.mjs:147 \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":"archive-posting.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae33a5ab638cf6ca8792c038dd628e7fadb628ff02b47f6690b147b554e1d61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browser-extract.mjs:519 \u00B7 browser-extract.mjs:617 \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":"browser-extract.mjs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"284d02ee9326775f62b4f378858d9328639fa20d91e840bea810a349c5b9101c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): build-cv-html.mjs:1121 \u00B7 build-cv-latex.mjs:180 \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":"build-cv-html.mjs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f9d5f32c9dcec8b70b557c040b5346ee0a11f7be5beff319b4330af27d8980"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): build-cv-html.mjs:1252 \u00B7 build-cv-html.mjs:1268 \u2014 both copies are in the same file, so extract the block 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":"build-cv-html.mjs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0904b7bd2d097bd60b4d2d0ce49e75e59747fec84ca03536820efe92ee26b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): build-cv-latex.mjs:259 \u00B7 generate-latex.mjs:182 \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":"build-cv-latex.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"740c4bbd2fa6d64e2bd5def82f3a74d72ad899817f1a668156b3d71ffa549303"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): check-jd-archive.mjs:478 \u00B7 salary-gap.mjs:1468 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc671f205a00e3a07d77a5017502301de8093a9b41019d31b98eb429233f468"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): check-jd-archive.mjs:1242 \u00B7 validate-profile.mjs:214 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a167cbeb52322f48e080f37c86292f919a8b6c15dbc5c6442a515aa075d024"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): check-jd-archive.mjs:743 \u00B7 discover-ats.mjs:930 \u00B7 invite-match.mjs:1171 \u00B7 rank-pipeline.mjs:503 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d076af4ec8daeda6ba5b2491cf34bc55c3dfb2000c5db0705bcfaf442f3f08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): company-history.mjs:734 \u00B7 followup-cadence.mjs:681 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"company-history.mjs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"9601e05a75b9c88a6e9641f497568087b97f9ddc195528fad154ad5db2b28a97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): contact-extract.mjs:196 \u00B7 tracker-sync-check.mjs:235 \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":"contact-extract.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4f8e2172b22a4d43b3dac4cabbe1ec8a29e044f595e1818f7d4f875a3e027b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): contacts.mjs:409 \u00B7 salary-gap.mjs:1599 \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":"contacts.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd674b4629f5c68731720aea147114c8e0a2eee94c59715467ceeb813428b7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): cv-experience-order.mjs:61 \u00B7 generate-pdf.mjs:751 \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":"cv-experience-order.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b18ce9f7ab7e8e58483d6499a884dde133792f636ac64950dcda4f1e1faa7d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): debrief-sync.mjs:316 \u00B7 persist-evaluation-report.mjs:170 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debrief-sync.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e3381fb34dda6f56767ac4974313d53cd2b37e4541b3cf3887a65265e79d9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): dedup-tracker.mjs:577 \u00B7 dedup-tracker.mjs:617 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"dedup-tracker.mjs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37c67a363468a8a261a7e466b005255a549eb52a48d3c41613d421f4aa3ea61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): discover-ats.mjs:1108 \u00B7 find.mjs:189 \u00B7 jd-similarity.mjs:144 \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":"discover-ats.mjs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4d6867fdcd4a15986326e010c07ffb4c999cbfe5175b2fcfb92e58a4320df2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): doctor.mjs:1451 \u00B7 doctor.mjs: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":"doctor.mjs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb080a84da37e982faa8e85c6bc262cfa6bf4e58a76c799da9cafb936b36617d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): followup-cadence.mjs:78 \u00B7 rejection-latency.mjs:206 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b505cf7e5ef57467e4aa59dfb1d614f1c1f9df2e767e73f197ff585aea810a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): followup-seed.mjs:571 \u00B7 followup-seed.mjs:602 \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":"followup-seed.mjs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f55a41493a6785f561725619bbe9bab6dbbdb46d2b7369384e8df76768da883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): gemini-eval.mjs:234 \u00B7 ollama-eval.mjs:126 \u00B7 openai-eval.mjs:142 \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":"gemini-eval.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"551b14d58b064992b1e27c9b964bdf683efadd823aace21f6769ae66f18962d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): invite-match.mjs:1198 \u00B7 rejection-latency.mjs:677 \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":"invite-match.mjs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3fb664387d95339a4d57e4c25a1cc41bdecd6eb06d6b5bfbe51182f6a561e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): liveness-api.mjs:489 \u00B7 liveness-api.mjs:518 \u2014 both copies are in the same file, so extract the block 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":"liveness-api.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"221e4aa36b9d627713a322ee46114c64dca24eb3c52b0ff752330931d02992dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): negotiation-roi.mjs:750 \u00B7 salary-gap.mjs:1761 \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":"negotiation-roi.mjs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86cdd2d1651bd3a445b9dd5814006ea3c6db03c896f00cb2c83865cee90fd56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): outcome.mjs:386 \u00B7 outcome.mjs:676 \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":"outcome.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b06c0fcb3d79a1b811525740bd2b72a8004f5c0fb2d1fa075f02b271d950cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): persist-evaluation-report.mjs:84 \u00B7 web/src/lib/report-persist.mjs:263 \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":"persist-evaluation-report.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"38544ac4cab39a949472b9a4354f051d7c08874d0607676ce6265a6816e459dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): plugins/h1b-sponsor/lib/api.mjs:436 \u00B7 plugins/h1b-sponsor/lib/index.mjs:347 \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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18c4869a19b2f885d7bc9d84fc5f906e313986515f87a5ecb3a21970de045ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/a16z-speedrun-talent.mjs:172 \u00B7 providers/arbeitnow.mjs:116 \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":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e708cbb2cf66d5c495ea7f725948cb39d68bc4c34fe956673d020f1b01729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/avature.mjs:197 \u00B7 providers/smartrecruiters.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":"providers/avature.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"31426e5f80893675a1930cb96796ecdf635212a7e4603cb76af316bd830cc367"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): providers/avature.mjs:228 \u00B7 providers/inrecruiting.mjs:251 \u00B7 providers/radancy.mjs:377 \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":"providers/avature.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b035e0b3d913341ca685530c1ef18e152c19bae83ff9eccc36748aa800f0530"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): providers/clearcompany.mjs:194 \u00B7 providers/telegram-channel.mjs:401 \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":"providers/clearcompany.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89830661c964eee484b10eb9c1512a1bbd52b5bbe1f623b6f064be5db7a1eaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): providers/collage.mjs:98 \u00B7 providers/comeet.mjs:84 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"providers/collage.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9638ab822ba2df9a3f8093e4bb0b9d90f7d7d7670f2aa46b994faf569b9ef3ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/csod.mjs:85 \u00B7 providers/peoplesoft.mjs:259 \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":"providers/csod.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2b8d06427473bfa6b04002192da84995730220a5bff2d66676ba0d57366b37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): providers/eploy.mjs:48 \u00B7 providers/wp-job-manager.mjs:71 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"providers/eploy.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31759efb1e5527a824f8d347430d1850da7ae0b856825ef72ece993bac803ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): providers/pageup.mjs:59 \u00B7 providers/peoplesoft.mjs:179 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"providers/pageup.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"636d33dc4395b841f52cbe9b5e6beb7ab92bfb30b5f89bd1d66298b6d87ae7b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/pinpoint.mjs:131 \u00B7 providers/rippling.mjs:134 \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":"providers/pinpoint.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b87a87270a14c89a16dfe9311ab11f22496eb8ef09eb3ab9e3a07c29a03215"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/platsbanken.mjs:142 \u00B7 providers/zoho-recruit.mjs:54 \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":"providers/platsbanken.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7d6f9dc2e464d5d1b9a549f9c27dac3972b95fe07867bee9b8b93ce890b791"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/platsbanken.mjs:205 \u00B7 providers/recruitee.mjs:447 \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":"providers/platsbanken.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9ea07a73cdaba28aaaecee52861b0943e0beeda659875d0ee5083f43448ecf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/radancy.mjs:324 \u00B7 providers/rheinmetall.mjs:115 \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":"providers/radancy.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed0bd48db266abd9d9f1549ab6d90ed2b3d80f1ba4081918cf570da1ba93edf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): reserve-report-num.mjs:303 \u00B7 reserve-report-num.mjs:367 \u00B7 reserve-report-num.mjs:390 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd00ecd2cd1a4142f18be032de122197b01d66e21a0e07b57c99f6602f1d5b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): scan-ats-full.mjs:858 \u00B7 web/src/lib/core/scan.ts:105 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d624250d58e41f4cf70e9ea3c3467fd30d1937ad9761af8cfd5609ca43a134fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scan.mjs:4842 \u00B7 scan.mjs:4886 \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":"scan.mjs"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af0f5168627354d6a541210765526cc7387d3191b3de292b5821853a43cfd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): story-provenance-check.mjs:193 \u00B7 story-provenance-check.mjs:208 \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":"story-provenance-check.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a66601a0da7e073de594d820152bff398acedd41b734df87435dc8401fe256"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): sync-batch-input.mjs:84 \u00B7 sync-batch-input.mjs:96 \u2014 both copies are in the same file, so extract the block 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":"sync-batch-input.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3e51eeb9892a1f8d571d879a87d8052b0b39208ccc7ae5842a01d0f986ffdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:6418 \u00B7 test-all.mjs:6534 \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":"test-all.mjs"},"region":{"startLine":6418}}}],"partialFingerprints":{"codehealthFindingId/v1":"810c3df17e5a801542ea38c84e9aef89f7d041938edd38b2b3414ab7d6894a2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:7316 \u00B7 test-all.mjs:7427 \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":"test-all.mjs"},"region":{"startLine":7316}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac2dbe6442df4b2d39429a7cdb7724317b22548a41481e8b8b36fbfdf91d4c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:8208 \u00B7 test-all.mjs:8261 \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":"test-all.mjs"},"region":{"startLine":8208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0fc1c1148c827d91068b2934aaf1f1cdaf068f61c641da2846d1dbe80ed25c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:14101 \u00B7 test-all.mjs:14120 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":14101}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a0ce6cdfbe62a486783271908e2503bae95e00420d48e715c414ad07122106"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:14357 \u00B7 test-all.mjs:14513 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":14357}}}],"partialFingerprints":{"codehealthFindingId/v1":"655fe8d569b270657d3ffb530e62ae8e389e33fc66f5324151bd31e0406a0794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): test-all.mjs:14549 \u00B7 test-all.mjs:14564 \u00B7 test-all.mjs:14579 \u00B7 test-all.mjs:14594 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":14549}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d2df7dc41db2115959ea38b3ae60e1814fe6732f2034697c9f1218bdb4f8f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:14985 \u00B7 test-all.mjs:15036 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":14985}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d250b7a225473d948495bb120d3df29a45ce276d8ed3dc4728d1183599670d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): test-all.mjs:17009 \u00B7 test-all.mjs:17073 \u00B7 test-all.mjs:17483 \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":"test-all.mjs"},"region":{"startLine":17009}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5a94b8f53ff0ac8606975e7b281b15a23f9f8ada7afda7a67033daa344e0dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:18346 \u00B7 test-all.mjs:19371 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":18346}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e6d7af9e6e9b607c393b509c1751c819b4a74acd7724e67cf06343529e7f13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): updater-migration-tests.mjs:344 \u00B7 updater-migration-tests.mjs:773 \u2014 both copies are in the same file, so extract the block 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":"updater-migration-tests.mjs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5c499b189ca479297a984b6a77978e49e6e8fb8558e03f42ca0cef3bd3a533"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): upgrade-tests.mjs:439 \u00B7 upgrade-tests.mjs:534 \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":"upgrade-tests.mjs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ca23ec5c4abe0d02097ae8b6088bbb8834a0f4f7fe1c82c47033191f5c9c59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): upgrade-tests.mjs:528 \u00B7 upgrade-tests.mjs:617 \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":"upgrade-tests.mjs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"65565967bb1ed104acad49278af09c4279726f7e55acbdae9e0919ba774a7b7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/app/actions/registry.ts:156 \u00B7 web/src/app/actions/registry.ts:292 \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":"web/src/app/actions/registry.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0784445ce91d426cb3c4079f35276b63ed93ec1ee68f3c3b462a8ed8900fd987"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/app/api/apply/fill/route.ts:17 \u00B7 web/src/app/api/apply/prefill/route.ts:26 \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":"web/src/app/api/apply/fill/route.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad1d9bbaa7ef55c89c48fdc9d19cebe9ceb0fac046746315676d5e044c7fb53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/app/api/cv-pdf/route.ts:91 \u00B7 web/src/lib/apply/cover.ts:46 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv-pdf/route.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b69492006f8193d0c9d76a3d63451225db9d2b1cebf8cdee785a4c8ee2b3cfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/src/app/api/inbox/skip/route.ts:27 \u00B7 web/src/app/api/tracker/delete/route.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/inbox/skip/route.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"253375e42b6cd385c22167bf3067e60c2b55300bdd82c8efbf46c62e3f103e3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/src/app/api/memory/route.ts:15 \u00B7 web/src/app/api/runs/save/route.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"web/src/app/api/memory/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"937d2dc405628bd50ca64495172e00e80c1cc684211d2ac62f95f7765f99777b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/src/app/api/profile/route.ts:66 \u00B7 web/src/app/api/status/route.ts:59 \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":"web/src/app/api/profile/route.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0910fc57a079dc68928a9b3462ac8421e7addbf15ef15e19277137e517c7112e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/app/pipeline/compare/page.tsx:72 \u00B7 web/src/app/pipeline/compare/page.tsx:80 \u2014 both copies are in the same file, so extract the block 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":"web/src/app/pipeline/compare/page.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9dd70449473c883022ef6d9dee85410a298703929a9a441301eb287a519b78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/apply-checklist.tsx:254 \u00B7 web/src/components/followups/cadence-settings.tsx:93 \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":"web/src/components/apply-checklist.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee045d9bc14e71599b7656b1881f64082f7111d5805f4b28ee729c38e1817bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/apply-checklist.tsx:259 \u00B7 web/src/components/mark-pdf-ready-button.tsx:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-checklist.tsx"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b585d23627d59f0ed2d8252740f0ca230ddd215e956dfaa25bc4d448925b9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/explore/explore-provider.tsx:329 \u00B7 web/src/components/explore/explore-provider.tsx:566 \u2014 both copies are in the same file, so extract the block 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":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51e87b38f19cf87fd319401e68bd61e9b92b33002bc8bc38c2c24a6c568cae6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/followups/cadence-settings.tsx:72 \u00B7 web/src/lib/scheduled-job-client.mjs:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2741b67b05c5809dd0de8164f4561ecccccdd995ba5a7e0a9b56f62f280edece"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/src/lib/apply/planner.ts:114 \u00B7 web/src/lib/cv-studio/rewrite-run.ts:35 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/planner.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8e4fefe8e3ebac7ac1b00e53ecdc65c84998461625ccfdf46eb3ad7f8809c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/lib/explore-ai.ts:87 \u00B7 web/src/lib/explore-ai.ts:140 \u2014 both copies are in the same file, so extract the block 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":"web/src/lib/explore-ai.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd785e86019ec4388a06127a77d248ef11b5d139a419d96c6e9ed740c51cbcfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/lib/extract-json-object.mjs:48 \u00B7 web/src/lib/extract-json-object.mjs:115 \u2014 both copies are in the same file, so extract the block 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":"web/src/lib/extract-json-object.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e873e74d3432a456b43423d3119d7193b1e3b7cffb890d3991a0b42fce130bf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/lib/origin-guard.mjs:91 \u00B7 web/src/lib/origin-guard.mjs:106 \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":"web/src/lib/origin-guard.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca87f2d212a9cd8f121de1c4a5407faf374ef64386ff2751c838ebb9a94a5819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/lib/scheduled-job-client.mjs:14 \u00B7 web/src/lib/scheduled-job-client.mjs:25 \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":"web/src/lib/scheduled-job-client.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfff21bba68885d51d904925a1314fabd95f44eec8c32ce94badbfa1ed581df2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): application-answers.mjs:78 \u00B7 application-answers.mjs:93 \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":"application-answers.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"79468e60f45acaeaa42b50644689d96efdcc3592622362416858abf0161b7b50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): application-answers.mjs:261 \u00B7 application-answers.mjs:277 \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":"application-answers.mjs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"407ba7a69f675f3da2ede93467d4aff2584fafd5e6b5074a6d5224e2b67b6012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): build-cv-html.mjs:443 \u00B7 build-cv-html.mjs:490 \u00B7 build-cv-html.mjs:559 \u00B7 build-cv-html.mjs:598 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fbf66328782c74c1d1100faf7049c3b9192a7fc1ad730effa5b20e081bc44f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): build-cv-latex.mjs:49 \u00B7 build-cv-latex.mjs:73 \u00B7 build-cv-latex.mjs:90 \u00B7 build-cv-latex.mjs:115 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-latex.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"031b2de9baa6f785a5fe642e879ed365103ac32b4154d4aafcfa0f7b3eae764a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): classify-tier.mjs:195 \u00B7 plugin-install.mjs:175 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"classify-tier.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb38323fc46a39af27e416f9abe2fd4cb9614e49204371e42fa2fc4a4a7ff94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): close-stale.mjs:202 \u00B7 set-status.mjs:544 \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":"close-stale.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a454b4ee4d7a52ec0f962cc0275eead0af2bf5d8167b5db2e7c439b2ae31b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): close-stale.mjs:379 \u00B7 reeval-candidates.mjs:440 \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":"close-stale.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3c45195db7ba7fbe86176e061cef7c5604cdb50cfc183c73f1303cc5c5708e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): contact-lookup.mjs:105 \u00B7 contacts.mjs:286 \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":"contact-lookup.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1e626f0394e3aee956eb49fc9f2b349e722f3087d68ce3c0549113f77cb8b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): detect-reposts.mjs:792 \u00B7 process-quality.mjs:362 \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":"detect-reposts.mjs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9ef61ef6cdbbd00c2b0d087b40c9f4caaed561dda60b04b57ed1bf66c5755b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): discard-analytics.mjs:148 \u00B7 sync-batch-input.mjs:301 \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":"discard-analytics.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6dbfa3a7d068040b5bebf9ac0b3e0da1fe8f12895b6775bb6b255de78904f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): discover-ats.mjs:1132 \u00B7 scan-ats-full.mjs:476 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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":"discover-ats.mjs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"166475806b20c543905dcf0b224499ab54961cb2b186e68d9f2c710d4b3e22a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): eval-golden.mjs:32 \u00B7 seed-fixture.mjs:111 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"eval-golden.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc165dd928ad59aee8777b2ab63dbdf5561d30994f3c501c50b6928773099912"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): followup-cadence.mjs:569 \u00B7 followup-cadence.mjs:610 \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":"followup-cadence.mjs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee823f72beb67a0308fbdea89e93e506183c0ea1b3995035870e18b6fd223dae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): followup-cadence.mjs:505 \u00B7 stats.mjs:469 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c49cf809615e0860ec0a627582a0c4a4de8ccaf976a854f6de0d1be5d026ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): followup-seed.mjs:390 \u00B7 followup-seed.mjs:520 \u00B7 followup-seed.mjs:592 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-seed.mjs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f34eb62cf83b5587e557c14bd13507268100bbfb961826601525f3c134b8f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): followup-seed.mjs:455 \u00B7 followup-seed.mjs:470 \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":"followup-seed.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"98433ec2606b7064c6457c42e64279b3d23228f043dd1d59a3dbffa5a94e8226"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): followup-seed.mjs:486 \u00B7 followup-seed.mjs:553 \u2014 both copies are in the same file, so extract the block 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":"followup-seed.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1c47307cbdab26c7438b453941cb3924d7e8ebb178a6f3a5a21c4a4536eb7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): invite-match.mjs:103 \u00B7 invite-match.mjs:118 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4403234b8f258a06405cbc02d271a7e3a70ea332248d8a924dfcd8c959ddf921"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): merge-tracker.mjs:1670 \u00B7 verify-pipeline.mjs:119 \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":"merge-tracker.mjs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6f12baa94d485122570181fa7b541b10bf80eeeb6cd595951e024c902a5a6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ollama-eval.mjs:360 \u00B7 ollama-eval.mjs:377 \u2014 both copies are in the same file, so extract the block 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":"ollama-eval.mjs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6005d76b9637f7bda269fd5c0756f5e604b3f5733604a399405e891d5bb2f7c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/4dayweek.mjs:94 \u00B7 providers/gupy.mjs:295 \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":"providers/4dayweek.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"70caafa6550a1ad1a8bf7710088af281e550debd0228d5bdebf5fdbc06186db7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): providers/_profile-keywords.mjs:49 \u00B7 web/src/lib/profile-keywords.mjs:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"providers/_profile-keywords.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b6a7bc0c470c9874253e90095bf61cde8600fbd768a1f35cf922369110051d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/_wp-job-feed.mjs:47 \u00B7 providers/larajobs.mjs:105 \u00B7 providers/teamtailor.mjs:158 \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":"providers/_wp-job-feed.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4512ec7fec56ffba1bd8912d402b21d2047f6bf97e96d343debbcc5d039cca73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/apple.mjs:83 \u00B7 providers/atlassian.mjs:24 \u00B7 providers/bwi.mjs:52 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/apple.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ce356ff38bc8ce354f67c776a68d6b6f4be074681ebe91bec363211e760413"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/consider.mjs:76 \u00B7 providers/eploy.mjs:56 \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":"providers/consider.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"877e6849c101d4fc612ce3dd88c635a0e0bf9ce3077d332105b1d2a5d0b80873"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): providers/eightfold.mjs:182 \u00B7 providers/eightfold.mjs:207 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"providers/eightfold.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f451d7790da8f74725d58c8841e824beffc5076712e5124f2b7713bfd879c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): providers/gupy.mjs:196 \u00B7 providers/workday.mjs:316 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gupy.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e6f4c52ec6ea4fcd440655ec2ba2f3a0dd24f07fca49e137b21c0bbd8d6b1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/icims.mjs:31 \u00B7 providers/oraclecloud.mjs:92 \u00B7 providers/smartrecruiters.mjs:81 \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":"providers/icims.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dc575fb933c548f36dfb1b96d052beb5d2e26a9a3ac8311c46254a58712888"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/jazzhr.mjs:212 \u00B7 providers/pageup.mjs:213 \u00B7 providers/rippling.mjs:170 \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":"providers/jazzhr.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e01fc44218ac17f9ee02127fd7c4d6994e0425886f55e8afd0d5c93ccf7ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/jobicy.mjs:17 \u00B7 providers/remotive.mjs:16 \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":"providers/jobicy.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"367308ab9f4dce07c5c788e3c18136870c84ab9770c2e40eda069562b5f4603e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/mokahr.mjs:243 \u00B7 providers/tencent.mjs:103 \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":"providers/mokahr.mjs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"257fd444165657f339bd6cf4ca63d7f348395dad155d017663df0241baec6688"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): providers/phenom.mjs:248 \u00B7 providers/successfactors.mjs:392 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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":"providers/phenom.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f6ef166bb8cecd9eb0416946de8b47b4abb9533706889b03c03531a4e2aa24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/wp-job-manager.mjs:53 \u00B7 providers/yourator.mjs:93 \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":"providers/wp-job-manager.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1813bc96d8fa5f126eb82c2d6d028bf6775d8e80d7f9dc664447bbebad88da64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): reserve-report-num.mjs:364 \u00B7 reserve-report-num.mjs:387 \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":"reserve-report-num.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcebb27cf91bb106f4ac1723d04c8f1c19af56b53fd191849c86291bc38c3a06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/export-ats-text.mjs:183 \u00B7 scripts/export-ats-text.mjs:192 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"239f4885606bbec62175a75bfad1955fceb06a5df46e2f3ed7d7044457656daf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): sync-pdf-flags.mjs:130 \u00B7 sync-pdf-flags.mjs:142 \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":"sync-pdf-flags.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1609eb94c754c5e152bcb272d9ea2ac27f175371645d95256a5ce8844a2dbe93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): sync-pdf-flags.mjs:224 \u00B7 sync-pdf-flags.mjs:269 \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":"sync-pdf-flags.mjs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd4cf0beb3f5ed6ffce2b15337e7887896729678fff8d87fa72496b6b884c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): test-all.mjs:7009 \u00B7 test-all.mjs:10351 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9afc5b6d1588da9d3c0e73c751ce179cc8ffc89aa79e22a8faa586d0b833a68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): test-all.mjs:9369 \u00B7 test-all.mjs:9489 \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":"test-all.mjs"},"region":{"startLine":9369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c98daebea980e1449d58dfb8e1bdc4d5db1900a5df8dc27284e01fd7690a700"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): test-all.mjs:10002 \u00B7 test-all.mjs:10015 \u00B7 test-all.mjs:10117 \u00B7 test-all.mjs:10183 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":10002}}}],"partialFingerprints":{"codehealthFindingId/v1":"359e787eb503b34bf52dea49d89495ca040bf4fa6c2e2459ffe7c3bf3305e6a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): test-all.mjs:10711 \u00B7 test-all.mjs:10765 \u00B7 test-all.mjs:17255 \u00B7 test-all.mjs:17270 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":10711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1b154975e778f3c2e8ec0caa606b5b3074ee82fad0711e3ba605f283b855be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): test-all.mjs:14389 \u00B7 test-all.mjs:14467 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":14389}}}],"partialFingerprints":{"codehealthFindingId/v1":"80996fbbc8ebb8b7e4be1eb382e84996bd33ecc629610a6f1973de8a9cd58e13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): test-all.mjs:15028 \u00B7 test-all.mjs:15038 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":15028}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d94038264019ef1974f05ff5d9f5a0186e2b0cf162e72e415c1b8cc73dcd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): upgrade-tests.mjs:265 \u00B7 upgrade-tests.mjs:808 \u2014 both copies are in the same file, so extract the block 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":"upgrade-tests.mjs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b29f66be4d3ac3b82e989d3e7cff3d823b1384a4e6d8b5f910c0806f5f681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): validate-portals.mjs:556 \u00B7 weekly-digest.mjs:668 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0cdf886b5943fcb7adb763d064f62bbe402d062a98eb6c75165bdbe2f1fe9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): web/src/app/api/company-history/route.ts:36 \u00B7 web/src/app/api/keyword-match/route.ts:35 \u00B7 web/src/app/api/quiet-companies/route.ts:27 \u00B7 web/src/app/api/upskill/route.ts:26 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/company-history/route.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b60d3c2a5c7628e99f32cf0d34924bc96827cfa948c89b0f890aeb98ae7bf77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): web/src/app/api/cv-studio/[n]/route.ts:26 \u00B7 web/src/app/api/cv-studio/[n]/route.ts:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 133 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":"web/src/app/api/cv-studio/[n]/route.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"779a700e3a09deeb6fceb0e627e15d5f156b8d0c0a074ea18713cfa4440aa0ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): web/src/app/api/followups/log/route.ts:46 \u00B7 web/src/app/api/profile/route.ts:66 \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":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a0bcfdcb8df9c274827d0f6cb12dd2cf14fb33ce0718605cb36d7f1efbf78e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/app/api/followups/override/route.ts:46 \u00B7 web/src/app/api/followups/override/route.ts:74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/override/route.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a36ee74752a380ba061d7ad22170e67d503e528b0b8c617fc4da624212297d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): web/src/app/config/loading.tsx:10 \u00B7 web/src/app/config/loading.tsx:24 \u00B7 web/src/app/loading.tsx:30 \u00B7 web/src/app/login/loading.tsx:11 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/config/loading.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7e31a05606e9f911f432271cc82461a3d7bc03346219d1a50ac3f3202949a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/components/analytics/search-insights.tsx:138 \u00B7 web/src/components/analytics/search-insights.tsx:182 \u2014 both copies are in the same file, so extract the block 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":"web/src/components/analytics/search-insights.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"29030e66f8aa9ce5673ae8760d4763ccc142b0dac1151bffbe92658930fa65d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): web/src/components/apply-view.tsx:293 \u00B7 web/src/components/explore/explore-provider.tsx:524 \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":"web/src/components/apply-view.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d17a47d1b128594265853ea33b91ab0c0342fa919f07e89d86902ab401a89d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): web/src/components/cv/cv-ingest.tsx:57 \u00B7 web/src/components/explore/explore-provider.tsx:545 \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":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b9b3e6814cafad4440bf7cd08a8ba0e7892d30d6283dbc4071dc181425b90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/components/delete-from-tracker.tsx:22 \u00B7 web/src/lib/pipeline-status.mjs:49 \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":"web/src/components/delete-from-tracker.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b209bb18d5439702ce52bd36b0c97518a50d9e83ffc2a13a737c8e4487df43f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): web/src/components/followups/followup-status-select.tsx:39 \u00B7 web/src/lib/pipeline-status.mjs:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/followup-status-select.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6d7efc318b4b91bc0f73d4c393ecce4a7d13716fb63c59cae43846712d5eb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/components/home/today-dashboard.tsx:331 \u00B7 web/src/components/inbox/inbox-triage.tsx:352 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"273b282a365c82656d7ec3c390f08baf2e8e827f342b456113b6b79ab4c08798"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): web/src/components/inbox/inbox-triage.tsx:124 \u00B7 web/src/components/portals-view.tsx:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2de760dfd3afa96e10b5165925e7c8a21842eb6d07d3c936e7a3878c9587119"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/lib/apply/agent-interpret.ts:30 \u00B7 web/src/lib/apply/extract.ts:118 \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":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b51282737a4c7c126f451f458b6573fb3d075e616489d7e994f0020480db9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/lib/apply/session.ts:193 \u00B7 web/src/lib/apply/session.ts:334 \u2014 both copies are in the same file, so extract the block 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":"web/src/lib/apply/session.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"feadc5cd9593b482f5e60c76993bc82ad202cc48a9a2ecd3570a8ae571e96130"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): add-entry.mjs:97 \u00B7 add-entry.mjs:181 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"add-entry.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdd1338af22fb560e3160bf97c61c627843a1ebabbe4e649be47586faa770fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): assessment-log.mjs:527 \u00B7 find.mjs:199 \u00B7 jd-similarity.mjs:153 \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":"assessment-log.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cace9b5382a43dad45e30cd44806389d62ccee3764fb0056253357f911cd1d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): batch-evaluate-gemini.mjs:134 \u00B7 ollama-eval.mjs:237 \u00B7 openai-eval.mjs:263 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch-evaluate-gemini.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6e8f43f6089c26ce8eb7b5aa1b3efdd35875558f85801632206b9e3954bfbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): build-cv-html.mjs:479 \u00B7 build-cv-html.mjs:588 \u00B7 build-cv-html.mjs:620 \u00B7 build-cv-html.mjs:654 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6bae70f30501f5f530586bc2e5ec7e9f67b82c6e8d6674bbd5bfb4177783b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): build-cv-html.mjs:821 \u00B7 build-cv-latex.mjs:237 \u00B7 build-cv-latex.mjs:523 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a158f7add8885b3a93a1fb21a96f2d4752f34e251acef6bb1fdbfae6e4a6f705"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): build-cv-html.mjs:1482 \u00B7 build-cv-latex.mjs:381 \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":"build-cv-html.mjs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbcf6acce0f66ed5d8608d6b743bb0630f124680e33efc7b1c8338d3b3d0d7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): calibrate.mjs:447 \u00B7 jd-skill-gap.mjs:1230 \u00B7 negotiation-roi.mjs:750 \u00B7 salary-gap.mjs:1761 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"calibrate.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27a4e3ea309c0e9365baac66d1bf4e77825820a189aea7e685147bacca1cb84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): check-liveness.mjs:156 \u00B7 hired-wall-build.mjs:204 \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":"check-liveness.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"382777015b5cd4530377d1fca21a0080681b085da69252d401033d83733c1a10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): contacts.mjs:114 \u00B7 linkedin-join.mjs:474 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contacts.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"976c0f2b34c0b0618a96b836da795c2d0b17438d39239759afe099e248fe900c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): cv-title-check.mjs:474 \u00B7 cv-title-check.mjs:489 \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":"cv-title-check.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d0ddb83d78c34bede5290753e67206883985a8ddefceba36bddef56afaa220"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): cv-title-check.mjs:213 \u00B7 dedup-tracker.mjs:492 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"cv-title-check.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b104b34607f18a9d0a6bd8e79c16b5eb15df32bef0cbb8540a89bb0477ef8ebe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): detect-reposts.mjs:543 \u00B7 process-quality.mjs:294 \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":"detect-reposts.mjs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e810532c6e3f7544e58947683b458da7b5aae5c202bcaebbcdd2e113db363539"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): discover-ats.mjs:1148 \u00B7 scan-ats-full.mjs:516 \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":"discover-ats.mjs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9c7356d10cebe23fa7d05d06092cc5b887a7f2f6fccec2710304120ed05230"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): discover-ats.mjs:1132 \u00B7 tracker.mjs:822 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"discover-ats.mjs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"67393c357600b18565795912582130ee1eec20a89ba3dd401cb953edfe416282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): followup-cadence.mjs:608 \u00B7 providers/senjob.mjs:104 \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":"followup-cadence.mjs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc3135126ae8cd3cd93cd409edd2176226efd3bad802e6bb8c573348f52a4ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): followup-seed.mjs:659 \u00B7 outcome.mjs:135 \u00B7 set-status.mjs:306 \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":"followup-seed.mjs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"0456efe050cc1a4e747430454809ed830ceb44fbd40a794c5151ffcb3f73f694"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): gemini-eval.mjs:84 \u00B7 ollama-eval.mjs:50 \u00B7 openai-eval.mjs:57 \u2014 the 3 copies are spread across 3 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":"gemini-eval.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e1c17ee4a27f0957ece924f788be2719bd6a6c4d89e918c13a11976ff92c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): hired-share.mjs:250 \u00B7 plugins.mjs:83 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-share.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cb8b51e030c8e4a084ed6695d4ba36da08367d923c031202839e882584e356"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): i18n-drift.mjs:32 \u00B7 lib/story-bank.mjs:74 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"i18n-drift.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b44c51b6817570d8fca3440f53bb76265080f213652aa2fd503f09d4c0c74a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): intake.mjs:474 \u00B7 openai-tailor.mjs:109 \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":"intake.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"712de55550fb955936ca6899afb05afa33c8bea648ebc4d15a9d99855b32f6e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): jd-similarity.mjs:44 \u00B7 web/src/lib/cv-studio/studio.mjs:47 \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":"jd-similarity.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4aeebd4e8fa486bf4676e5063b720611405153fa2c0627c38abec9363b2ce9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): jd-skill-gap.mjs:614 \u00B7 story-provenance-check.mjs:727 \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":"jd-skill-gap.mjs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dd6102ffd0466bf6e76abba6782be091bcf5135b345cc772f93768795779ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): linkedin-join.mjs:620 \u00B7 linkedin-join.mjs:696 \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":"linkedin-join.mjs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff5079543bb4524c8c7d490718d131bb4e30694c7206566540cd6b3be0d3d04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): liveness-core.mjs:565 \u00B7 liveness-core.mjs:604 \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":"liveness-core.mjs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb749b0b096b63540050204fb754f442d2009464a513b849ad7353286eb6d7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ollama-eval.mjs:305 \u00B7 openai-eval.mjs:350 \u00B7 openai-tailor.mjs:257 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ollama-eval.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbf56a7de978a813ca3464bb1f51366bb0178b4e3e5daf3423050ace7ab5169"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): patch-latex-content.mjs:68 \u00B7 patch-latex-content.mjs:82 \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":"patch-latex-content.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b7ada3705c1f1a8b1566f5ca10a2b8b01c3c34461a7bf67403fc30902d5dfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): process-quality.mjs:132 \u00B7 tracker-sync-check.mjs:282 \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":"process-quality.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb28c2a9aebab15ec3452b4328ca5fed0382c54499173db85255384db8761701"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/4dayweek.mjs:108 \u00B7 providers/thehub.mjs:97 \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":"providers/4dayweek.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"84508367804549d38eecc38c816c0ac89baf0cae7094d248519b543938188b84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/_http.mjs:575 \u00B7 providers/themuse.mjs:35 \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":"providers/_http.mjs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"35df3b6640e4240b2ad6b8a180814e57c43e84a574ed68f9157f35d3ced9f050"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:308 \u00B7 providers/atlassian.mjs:93 \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":"providers/adp-workforcenow.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3767a99e7221fc494fc131e550d99977ee65ec5f38965c072d29370cff166aa1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/agentic-jobs.mjs:102 \u00B7 providers/wttj.mjs:99 \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":"providers/agentic-jobs.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b8402001aa29f35479b56d891c45d5962eed531fd3bd64a6f5930f26a89d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/agentic-jobs.mjs:147 \u00B7 providers/csod.mjs:211 \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":"providers/agentic-jobs.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bb5240bd747e6376b3c26c53cfe96c18cd7e9677cbb32436d5f9cb64ab70a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7 locations): providers/avature.mjs:231 \u00B7 providers/inrecruiting.mjs:253 \u00B7 providers/occ.mjs:249 \u00B7 providers/radancy.mjs:379 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/avature.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c27c2e5cba6706bcd9983b742e71bf59ff97ee205a7a03f86721211c3f812c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/beesite.mjs:109 \u00B7 providers/successfactors.mjs:285 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/beesite.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a56c74d02270306db63907bfcb091e58792b9fc5f7f2590a22f3776197c7e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): providers/clearcompany.mjs:139 \u00B7 providers/platsbanken.mjs:205 \u00B7 providers/recruitee.mjs:447 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/clearcompany.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"059b6cfa57c9c1df13489a0f7b4ece155ca7267c5d3ab3842a56dd1487c27666"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/collage.mjs:30 \u00B7 providers/jobvite.mjs:151 \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":"providers/collage.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"eded89042e1d8f0fecc142b6b184fca50c817a168ab1921466413d7962d8eb82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/csod.mjs:215 \u00B7 providers/tkms.mjs:164 \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":"providers/csod.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"011a69822e34321770a9f99743f14a80166fa4efa38342e78decc74ed23a8935"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/echojobs.mjs:97 \u00B7 providers/getonbrd.mjs:145 \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":"providers/echojobs.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"97012abdf8ebfca8960ab5f5663119c1a8d84a2fd5cf1580349a5f1ff7bfac2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): providers/eploy.mjs:239 \u00B7 providers/smartrecruiters.mjs:152 \u00B7 providers/vdab.mjs:296 \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":"providers/eploy.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3b14584e8752d588ff5a045877481fbb4c4db2b13be241848272e05d6be180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/gem.mjs:235 \u00B7 providers/join.mjs:280 \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":"providers/gem.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b104985d5abf851ff107c8507dd21ea48d27caaf67c53392add0ea5202c723b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): providers/jazzhr.mjs:52 \u00B7 providers/pageup.mjs:59 \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":"providers/jazzhr.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02c4c430d33803c2bfb6840601f2190303eaee12c73e8f649245019427dbc42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/peoplesoft.mjs:370 \u00B7 providers/peoplesoft.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":"providers/peoplesoft.mjs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd01f35caee84b1dddc553053d54d94f4ca0f296e4d83051f977503d9c5d16e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/personio.mjs:155 \u00B7 providers/schoolspring.mjs:83 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3824173698009a8d33bf29ae278e7ebf055917e56d7c9d94b73540529bd73d0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/platsbanken.mjs:211 \u00B7 seeds/vc-portfolios.mjs:131 \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":"providers/platsbanken.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"258543bf5a011b97d604e3155fb3839f4f409c1c1962542bed9081a5cd42ef66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/successfactors.mjs:286 \u00B7 providers/tkms.mjs:117 \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":"providers/successfactors.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"271b7d78a5ed93cffda07e044c713fcbe086ce8290649d5e5dc9b994e96bb552"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/themuse.mjs:113 \u00B7 providers/wttj.mjs:126 \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":"providers/themuse.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"586bc8b4a3e8cf019e2b717c2f037b36452cca1c83aa567e34e4fac6e6820ef3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rejection-latency.mjs:230 \u00B7 rejection-latency.mjs:279 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rejection-latency.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"de30611cf9d800174264375b484be7bf9d472708c98c2875d5b5affadd19626f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): salary-gap.mjs:113 \u00B7 tracker-sync-check.mjs:74 \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":"salary-gap.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd3d3ab99e3afb49c73bd26f2a8702ff5787f8406f4b6484b7ac11a0ca3b4e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): salary-gap.mjs:1072 \u00B7 salary-gap.mjs:1099 \u2014 both copies are in the same file, so extract the block 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":"salary-gap.mjs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e16a20067b095d58e372ba46d8c5230e2b07d307a0ff019386fefbd338ed19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scan-ats-full.mjs:476 \u00B7 tracker.mjs:822 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 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":"scan-ats-full.mjs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861ec70cee2aca3efcc1db33079dfa22df43eb677760cc628cdf355b38e496b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scan-interamt.mjs:175 \u00B7 scan-interamt.mjs:205 \u2014 both copies are in the same file, so extract the block 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":"scan-interamt.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"564a911801401e263acbd43a22fb47017f6f68c895b740d5cbda75463736a3ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scan.mjs:1277 \u00B7 theme-style.mjs:80 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"scan.mjs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"199f03924f35cc47b2461226396e2d98dacb81222eadee7362793581f8b2af01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/export-ats-text.mjs:126 \u00B7 scripts/export-ats-text.mjs:142 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0ebfb172fa2db859d629f045004052122d5ec3ad5bad5d70d6b6b8e9ef8f58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): session-activity.mjs:230 \u00B7 session-activity.mjs:237 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"session-activity.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"645399ca1e535bd2d7df820a548e5fd069d18b9e77239d6b4e150e926c3789d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): sync-batch-input.mjs:239 \u00B7 sync-batch-input.mjs:261 \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":"sync-batch-input.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc34dc456d6d79e2c73ca449274efa6811f8aae98871ec1ea1b10a72a4cdef14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): test-all.mjs:10363 \u00B7 test-all.mjs:10375 \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":"test-all.mjs"},"region":{"startLine":10363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afec94a424bb4a2642f546cf7b529ab6449a6ff61496201b9792b7c67f75cc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): test-all.mjs:10828 \u00B7 test-all.mjs:10870 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":10828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dca5274afc658c6ab653d0e9cc798644d2077b8b749ae0c4e185c5240f2b3af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): test-all.mjs:12347 \u00B7 test-all.mjs:12528 \u00B7 test-all.mjs:12676 \u00B7 test-all.mjs:12941 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"test-all.mjs"},"region":{"startLine":12347}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f75332e975cf51214403de53ad6c41b27648a6a223c4b83c86d4ea3d751451"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): test-all.mjs:12413 \u00B7 test-all.mjs:12454 \u00B7 test-all.mjs:12473 \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":"test-all.mjs"},"region":{"startLine":12413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0d4dcd8c94685388fe2e46f3b0abbe5139cef983a40a02c15da88b9f9f84ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): test-all.mjs:12615 \u00B7 test-all.mjs:13052 \u00B7 test-all.mjs:13665 \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":"test-all.mjs"},"region":{"startLine":12615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9fcbd5c11c29109f4b7930064c2657ed2d897a427cadcd86a0446ba7b8a217"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): test-all.mjs:16078 \u00B7 test-all.mjs:16085 \u00B7 test-all.mjs:16094 \u00B7 test-all.mjs:16101 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":16078}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77151b139f9752a292734b292a5fcd6cd0d76002987237c1611a871cf2639a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): title-keywords.mjs:80 \u00B7 title-keywords.mjs:91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"title-keywords.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9f260d78e5d9daff06252093f5f9ce260e2874d467bf2beaeaf318c882dad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): upskill.mjs:844 \u00B7 validate-portals.mjs:556 \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":"upskill.mjs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf390ce9e3ad7b0d375d417e5d0e05c53b22cfbe80a6dfbdf7eee009a72b9edc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): validate-portals.mjs:338 \u00B7 validate-portals.mjs:387 \u2014 both copies are in the same file, so extract the block 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":"validate-portals.mjs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"db91d5545c3e229c078fbd49b2e5d6c71cf3e8dfc1b76affadeb33327990b08b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): validate-profile.mjs:214 \u00B7 weekly-digest.mjs:662 \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":"validate-profile.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf5f8088653c4f2f375acd7747ab34a67f701c5044233575b51bd6a71c3612b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/app/api/cv/ingest/route.ts:152 \u00B7 web/src/app/api/explore/ai/route.ts:190 \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":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed90ebc58d5eb845838dcc970b36ce6a2995e24aaed9b60f9c9b2cc074eb3518"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/app/api/explore/ai/route.ts:48 \u00B7 web/src/app/api/personalization/route.ts:47 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fa3725a9701a0119ec35b597d1b135de04482c436396bcb2ebb995cd105f95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/app/api/explore/ai/route.ts:46 \u00B7 web/src/app/api/status/route.ts:45 \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":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"31391e0aedf9fab71842d32ddc3eea711def3b8c19485a8a6c4f889012c380d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/app/api/followups/seed/route.ts:12 \u00B7 web/src/app/api/pdf-ready/route.ts:19 \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":"web/src/app/api/followups/seed/route.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe9a37258483a019c5638fa99b9b2b6898c1e9f1c149b10f6a536d37352474c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/app/api/inbox/skip/route.ts:27 \u00B7 web/src/app/api/runs/save/route.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/inbox/skip/route.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce273d59c9da345b35864b58ab7af17934ca4892353f7928721f3e5b66779176"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): web/src/components/analytics/funnel-rates.tsx:16 \u00B7 web/src/components/analytics/search-insights.tsx:16 \u00B7 web/src/components/followups/quiet-companies.tsx:21 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/analytics/funnel-rates.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b72b91e8e819a6f9ba90115e29b5729fae926d09a575d1e7c30aa3c7d4c44d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/components/followups/quiet-companies.tsx:138 \u00B7 web/src/components/home/follow-up-card.tsx:69 \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":"web/src/components/followups/quiet-companies.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c9f7f4cc585ff3135681715ece39d234a112fb2139c35a379298c9d11fa28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/lib/apply/cv.ts:28 \u00B7 web/src/lib/cv-studio/server.ts:52 \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":"web/src/lib/apply/cv.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25103f2d0e6a21e7286d5b29f840471b7d6345f828c0725c7ea084d7f43933c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/lib/apply/diagnose.ts:48 \u00B7 web/src/lib/apply/diagnose.ts:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fd8ae854208cd371451185d001ec33a54a2bd5026e43aaaac7462aaff5dd71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/lib/followups.ts:125 \u00B7 weekly-digest.mjs:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"web/src/lib/followups.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef5684ff45ba51d3caf69f80387fd5aeabe09d73e094f7a91a86bcf0e6d00f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): analyze-patterns.mjs:309 \u00B7 upskill.mjs:282 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa30da28a554bec7df9a27444d6baeccaa42f787bfd1efba2834698f46f7c4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): analyze-patterns.mjs:1072 \u00B7 analyze-patterns.mjs:1081 \u2014 both copies are in the same file, so extract the block 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":"analyze-patterns.mjs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc59c0852825defce758f3a7e7bfc61c6e937e79a5e1269f108acbb1ceb5f083"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): analyze-patterns.mjs:1095 \u00B7 analyze-patterns.mjs:1104 \u2014 both copies are in the same file, so extract the block 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":"analyze-patterns.mjs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"facaba23279698f027ecc571d8ff5a490e0c021eac7e83109e88a8aff307175b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): archive-posting.mjs:538 \u00B7 plugins.mjs:544 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"archive-posting.mjs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd8b12df2dbd78d5d27b65d1e1392f38e2114810e660ed53ca36412b8ad48d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): assessment-log.mjs:95 \u00B7 salary-gap.mjs:162 \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":"assessment-log.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c38fa85e88560548f91c4bc566b7b4e8506688d927089dfe3186b0494cf582"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): assessment-log.mjs:518 \u00B7 browser-extract.mjs:931 \u00B7 discover-ats.mjs:1119 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8427c20bd00356edd6843471ccd241c53a7eaf22f548882c5f5ca0a28e660e84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): browser-extract.mjs:495 \u00B7 providers/lever.mjs:88 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e1462828e673250eef227f5cd69a8f7942c5984052ad2195558520843abb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): close-stale.mjs:285 \u00B7 set-status.mjs:814 \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":"close-stale.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b4348a5e8361bff49bc792cb235e80393ac443ec46908275e9fc31b261bedc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): company-history.mjs:481 \u00B7 company-history.mjs:498 \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":"company-history.mjs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cc79d0786fd6ba0162ccfe65837bb9a6cbc32ed4fbfdf23baad998e26bb446"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): company-history.mjs:1671 \u00B7 company-history.mjs:1679 \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":"company-history.mjs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1f701cc485947307f842c26077250c3cb22a6a1ac4dbb8ebe7116c291f27c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): cv-title-check.mjs:646 \u00B7 cv-title-check.mjs:666 \u2014 both copies are in the same file, so extract the block 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":"cv-title-check.mjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"957b227365a4250c697fdd651ad57681dd27a33fb9ef4f57ac63d456e4937b1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): cv-title-check.mjs:772 \u00B7 cv-title-check.mjs:784 \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":"cv-title-check.mjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddef80ac9ce64616b97b4d42741e10613562769452c54321ed6673a4c923fbf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): funnel-velocity.mjs:207 \u00B7 web/src/lib/analytics-metrics.mjs:227 \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":"funnel-velocity.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a4ed41faaac8710be87852a5f02a1944cb58d33398f4add01a17c2e2def544"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): i18n-drift.mjs:113 \u00B7 i18n-drift.mjs:128 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"i18n-drift.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b957eabf5ff6d6e4bb9aa7229198ea953c18b739294be7932ec3a21fd5ed23f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cli-flags.mjs:33 \u00B7 update-system.mjs:3668 \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":"lib/cli-flags.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a55f2796b5d1e92225569c6f968923171d7bd44e639dc53e6536346f34bab65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): liveness-api.mjs:126 \u00B7 liveness-api.mjs:155 \u00B7 liveness-api.mjs:276 \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":"liveness-api.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b91cc7a1541576b693e7130854716fa2c55860d3fbcef9ff248f07eff8dbc2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mark-pdf-ready.mjs:129 \u00B7 set-status.mjs:435 \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":"mark-pdf-ready.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"449438bf4c50bb1bcaa49f964d9fc7d65481eac582f0131f5447bd223a941fcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): mark-pdf-ready.mjs:112 \u00B7 sync-pdf-flags.mjs:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mark-pdf-ready.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca368c54024d1606e50d9fd28db6b35409e4521b0d342d577e8535afc5106222"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): prepare-application.mjs:119 \u00B7 prepare-application.mjs:125 \u2014 both copies are in the same file, so extract the block 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":"prepare-application.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"815487ccab40cc5e830d6c14b34126ce90a3b12e9723bbffac82bb04d4bb056e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/ashby.mjs:354 \u00B7 providers/ashby.mjs:379 \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":"providers/ashby.mjs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba8069cf2415fcac26fa3e2b92c7f335247a3670d879e17b4e3563e1fea2f4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): providers/deutschebahn.mjs:260 \u00B7 providers/successfactors.mjs:394 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/deutschebahn.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0734bd58e65d37232190cd24dc3419bddbc7f08ed614aed86481c2b3138e8b22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/jobicy.mjs:53 \u00B7 providers/thehub.mjs:81 \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":"providers/jobicy.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c84502f566060456ace1756a4b1b605d15d315e82f10375100cf25776bdc0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/phenom.mjs:169 \u00B7 providers/ultipro.mjs:370 \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":"providers/phenom.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcf4d50d5ba4b27b05ad0bee9ab8ccf82c2342cd813ae88510eb8837e7fee71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): providers/phenom.mjs:248 \u00B7 providers/softgarden.mjs:137 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/phenom.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ea92755789fc2a472d7e2c88e284885bded2e8d1b0250a7b4dfda3dfced09b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/radancy.mjs:138 \u00B7 providers/softgarden.mjs:47 \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":"providers/radancy.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cdc0ff7c811373a937e49b4ad00d83aad43a4896608248c148d0ca8086d83d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): reconcile-pipeline.mjs:237 \u00B7 sync-batch-input.mjs:219 \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":"reconcile-pipeline.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e28ceade001c90724c6326d0cd5482f20a55553e6978710e8ebe783f86d236"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): salary-gap.mjs:911 \u00B7 salary-gap.mjs:922 \u2014 both copies are in the same file, so extract the block 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":"salary-gap.mjs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"8071af73b58cda0354daa6b6b6f18f78d52eac7304bcd1025308c405c5b71f38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scan-dayforce.mjs:679 \u00B7 scan-interamt.mjs:349 \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":"scan-dayforce.mjs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"845fb1a9acb724df847b19f724dd61b83523894712d2cb896f19058a573d2f88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scan-dayforce.mjs:687 \u00B7 scan-interamt.mjs:355 \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":"scan-dayforce.mjs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b854a75edccd00df3ec1eab882ea479d1bd29acdda9cc55cf3602caf76590cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scan.mjs:4105 \u00B7 web/src/lib/followups.ts:125 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"scan.mjs"},"region":{"startLine":4105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac88c56568e8490915f80b61fb529e8fde498d713b548a9ce6a31ba0f0837b5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scan.mjs:4105 \u00B7 weekly-digest.mjs:62 \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":"scan.mjs"},"region":{"startLine":4105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5b2e1042a98c2bb1f2b47f643b9be79865f4ddd82d9a7fcabe1fdfac2d1cfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:1658 \u00B7 test-all.mjs:1672 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf5693e762d335422706320a0e17c98617340f295a45f0eea553d499a3aba3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:3959 \u00B7 test-all.mjs:19169 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":3959}}}],"partialFingerprints":{"codehealthFindingId/v1":"8194e6a78e9ed9f58c3f578051c750454beab9db45da8d6446122271e4616a1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:4048 \u00B7 test-all.mjs:4517 \u2014 both copies are in the same file, so extract the block 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":"test-all.mjs"},"region":{"startLine":4048}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafb840dce9e43cecb3d541520d51b430f79e441409d10b26b23378f84450243"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): test-all.mjs:4115 \u00B7 test-all.mjs:4253 \u00B7 test-all.mjs:4304 \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":"test-all.mjs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24097da2cea7997f3f933da7a36e4c5ae24c45d532892ca9a1dd7a3aa8b92e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:4153 \u00B7 test-all.mjs:4267 \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":"test-all.mjs"},"region":{"startLine":4153}}}],"partialFingerprints":{"codehealthFindingId/v1":"804c294c6fd58ccd296c7af31f456d4939cbcd543a569a5e540132457a55d6fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): test-all.mjs:4518 \u00B7 test-all.mjs:19051 \u00B7 test-all.mjs:19171 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd80c2d8801d31760c2234f992cd68bfc80a563785aa42c78be0ad5fe8874688"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:14370 \u00B7 test-all.mjs:14437 \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":"test-all.mjs"},"region":{"startLine":14370}}}],"partialFingerprints":{"codehealthFindingId/v1":"579094cc8b44dd478ede740335869ea2026f5bf54a3ac0195edc9a6ddc543946"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): test-all.mjs:14536 \u00B7 test-all.mjs:14552 \u00B7 test-all.mjs:14567 \u00B7 test-all.mjs:14582 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":14536}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3a94d0b058612e5bb8be233aba07ba17f7dac2dcc667001a58f9e55c7f15c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): upgrade-tests.mjs:318 \u00B7 upgrade-tests.mjs:339 \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":"upgrade-tests.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8d93b86be05dcd0a53468bdd0c25b0119467c1f9a0c0dbb448a78343ac44df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): upgrade-tests.mjs:422 \u00B7 upgrade-tests.mjs:574 \u2014 both copies are in the same file, so extract the block 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":"upgrade-tests.mjs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbe93b315000bb4e5c6f4be7aed17cee25e752d13eab9cb5be3a03fea9b6297"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/app/api/apply/close/route.ts:4 \u00B7 web/src/app/api/followups/seed/route.ts:5 \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":"web/src/app/api/apply/close/route.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ecb8c5faf7b759e9cce8d653037d3ca566ff26aadc3c2dfd26598c29d6726a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): web/src/app/api/apply/drive/route.ts:7 \u00B7 web/src/app/api/apply/fill/route.ts:6 \u00B7 web/src/app/api/apply/prefill/route.ts:14 \u00B7 web/src/app/api/apply/session/route.ts:6 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"14243c7d1d2e7b01118cfee2ce9554c286f08e7f95795d423eb04cb102e3b839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): web/src/app/api/apply/prefill/route.ts:14 \u00B7 web/src/app/api/apply/session/route.ts:6 \u00B7 web/src/app/api/run/route.ts:30 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac3419f405a62c3be609907fe715d18931e835d15392fb0aeb11eb877e074db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/app/api/cv-studio/[n]/rewrite/route.ts:20 \u00B7 web/src/app/api/inbox/skip/route.ts:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv-studio/[n]/rewrite/route.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"04972ebf1ccf0e7966b0f11022029e79d667ff07f5da882a58ce6e45f96b69fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/app/api/followups/cadence/route.ts:172 \u00B7 web/src/app/api/portals/route.ts:47 \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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d1433c62f848e29a43ff5d7558707c73de97d420bda55da7f46ce4bc20bc07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/app/api/inbox/skip/route.ts:29 \u00B7 web/src/app/api/memory/route.ts:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/inbox/skip/route.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc07698fd3d7a4b12b0bf75ab7fb790d73b104915ee5b3707ca9ef6ee2183c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/app/api/personalization/route.ts:45 \u00B7 web/src/app/api/profile/route.ts:60 \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":"web/src/app/api/personalization/route.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f4e91cb730405a5a2525c8a56804143a7d430cf760982d3f73104670bfda84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/app/api/personalization/route.ts:47 \u00B7 web/src/app/api/tracker/delete/route.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/personalization/route.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"becd9aa5d944a2703e9f843fbb109532626c4a6117f2c8f34985da434ec5467c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): web/src/app/scheduled-scans/loading.tsx:15 \u00B7 web/src/app/scheduled-scans/loading.tsx:20 \u00B7 web/src/components/analytics/search-insights.tsx:32 \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":"web/src/app/scheduled-scans/loading.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aefffcaec26f4380a2f6e7fef90dcdc0f39e50b7cc811949416fb40b7d2a6ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/assistant-console.tsx:368 \u00B7 web/src/components/assistant-console.tsx:402 \u2014 both copies are in the same file, so extract the block 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2389b0cf237b466464994c487b9524cd40c8e11eb1ab0dd397333c1482f110"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/components/assistant-console.tsx:652 \u00B7 web/src/components/assistant-console.tsx:799 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cce5edd3e3049f4b47ae3b38108f7bccdc4b910c510ac7ecb2bd9d047cc83fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/followups/followups-view.tsx:176 \u00B7 web/src/components/home/follow-up-card.tsx:46 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c89a7e996d757cd78c067c2f8744826ad211896bad63b2639b5fa2b6345a9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/home/today-dashboard.tsx:42 \u00B7 web/src/components/home/today-dashboard.tsx:48 \u2014 both copies are in the same file, so extract the block 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":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dc9fabaaa9a30793e1f8c867aa50c014ed34fff174b034e6195e85ab500c47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/lib/apply/extract.ts:54 \u00B7 web/src/lib/apply/extract.ts:95 \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":"web/src/lib/apply/extract.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc5a15f26eacaaa3881a60839f4f2e987dc4a6a0519347f3ba457c3eeadb186"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/lib/scheduled-jobs.ts:184 \u00B7 web/src/lib/scheduled-jobs.ts:194 \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":"web/src/lib/scheduled-jobs.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9193ee014dff0642124069bd98e4bac1da9d613f336ca96106bc96c4f53e54f0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: doctor.mjs:20 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7903491126e7fac57a830bb0ec0a786159ac0bdc1fd163657e242ba0f1ad5db3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/ui-server.mjs:11 reaches into another package with a relative path (../web/src/lib/bind-host.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-server.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd927a94b0f90807e8891a3b1c1a4950096056625ac54968ea89a83dd44186b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: test-all.mjs:79 imports tests/helpers.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f62ec8701912edc0a0b488b3af9a61c1b89c9b0d2b40f3a2d078f8fe287003d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: test-all.mjs:81 imports tests/required-tools.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"62abd4a67c70420b1a5645034784202426236caae2fb54c0f7afa0f73690b10f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: test-all.mjs:85 imports tests/evaluation-mode-parity-helpers.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ce8453ca6596fc213b16fc40500c1906088057c9dc0fd39f6d1a541316f614"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: test-all.mjs:88 imports tests/data-root-guard.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eb65a5ef39bb3f2b5cf2673db4e0d528dcd35c968469c369d941ab6e50284d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: update-system.mjs:4031 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44b5ddf6c81a78bd573d9c69f62efccf6f3c0de0c38988f4dcdc2c2f408fc13"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: update-system.mjs:5150 reaches into another package with a relative path (./scaffolder/bin/skill-entrypoints.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":5150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb9fb4f7b04b254691e59d825179d304f5c5b253b5933550ab38fa9d266fd1b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: web/scripts/scheduled-jobs-runner.mjs:15 reaches into another package with a relative path (../../lib/is-main-module.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fc69d3282c89696b9f3cef96da8463b5d1c25b312d1c14cb4d8090a44e98ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: web/scripts/scheduled-jobs-runner.mjs:17 reaches into another package with a relative path (../../path-resolver.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8b1b101b4988592d790d42578b4a7795b42c895ac915e9935d0df91093918d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: web/src/lib/cv-studio/base-cv.mjs:11 reaches into another package with a relative path (../../../../lib/cv-markdown.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/base-cv.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11a243e4a4057ef3ddb3110678ffa81ac80f0db137054accf64a5906ad2ed9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 224, cognitive 319): main has cyclomatic complexity 224 and cognitive complexity 319; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c68f25a6deed63422b0b0575c2f16a53237ff659163778400168b850441f3db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeUnderLock (cyclomatic 135, cognitive 238): mergeUnderLock has cyclomatic complexity 135 and cognitive complexity 238; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e8e07d240955d5b1d70ae2bc3b9b77294f184ceaa14e5cfbc978055caa7c0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 120, cognitive 145): runSelfTest has cyclomatic complexity 120 and cognitive complexity 145; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed053634ffd1ef990ccd65644d984cb6756dead4d7a98c6f224f4f8bd19b585d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 109, cognitive 162): main has cyclomatic complexity 109 and cognitive complexity 162; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"867a4d96773b9b8ca02427f8dc90bf252edc615b8d1db18c3abb42ba2013fcf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 102, cognitive 164): apply has cyclomatic complexity 102 and cognitive complexity 164; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1af0d876b5e42deda17825c82d197e91e7d902fcd3729a595a71f22f932fcf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 80, cognitive 86): runSelfTest has cyclomatic complexity 80 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":"build-cv-html.mjs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c227c66f888ebee1739b3fdecd312c10dd10582225705852761b3d327d45b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfTest (cyclomatic 77, cognitive 59): selfTest has cyclomatic complexity 77 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":"salary-gap.mjs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2f7903c790f9ecb99351a6cac5171e65781c330e06ef2c892064591024c929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 68, cognitive 131): (anonymous) has cyclomatic complexity 68 and cognitive complexity 131; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4445}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a7f59f1e2a7582835c3734133cc0b0d9d0e0c32abecc14cba1abb956141407"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePortalsConfig (cyclomatic 66, cognitive 156): validatePortalsConfig has cyclomatic complexity 66 and cognitive complexity 156; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a8fc3fccac415a52a3a7de38983d03470ad88cd425cdecef0b939f97bf77db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncTrackerPdfFlags (cyclomatic 62, cognitive 148): syncTrackerPdfFlags has cyclomatic complexity 62 and cognitive complexity 148; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync-pdf-flags.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff3f1d7627c2dc57f0e90a5e2a06757acde00731198bd1ad485a2e00e4e23f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 55, cognitive 101): main has cyclomatic complexity 55 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-liveness.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb4e3cb48ebc506e6c8c4adb16ad6b97828b0ea305b963a0be92e08ecc53fb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEvidence (cyclomatic 54, cognitive 65): buildEvidence has cyclomatic complexity 54 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad829f564f3564207b13b2e3b78eb457c39f0daead8a15d1c7f05fd4f0cdb332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExplorerView (cyclomatic 54, cognitive 43): ExplorerView has cyclomatic complexity 54 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 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":"web/src/components/explore/explorer-view.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2605671fb5edb13ef473326def124d46d65940c4f7981117473e49e959456ed1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnose (cyclomatic 51, cognitive 77): diagnose has cyclomatic complexity 51 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e28a312473f40038cecf270a97bff91268a68150c401368e5d3f05b43505be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateManifest (cyclomatic 51, cognitive 56): validateManifest has cyclomatic complexity 51 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"852942255e23b1e76eac8d47e64b33b56353b4281822087cb00a47bb5a1fc550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReport (cyclomatic 50, cognitive 58): parseReport has cyclomatic complexity 50 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":"analyze-patterns.mjs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c172039c1a0a4bb45d7e6cf8c2d61b48225193878b182ab0577298270b2090"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalizeArchetype (cyclomatic 50, cognitive 27): canonicalizeArchetype has cyclomatic complexity 50 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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"38210752f3aebf2062f8692ed00a141851f879bb41cef32fae9b3c582a25179d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locallyModifiedSystemFiles (cyclomatic 47, cognitive 102): locallyModifiedSystemFiles has cyclomatic complexity 47 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f4ce8917f6e55475414fbfe3bfe5ce03adb88b798c447aae58cb73cfdbd8ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 46, cognitive 123): main has cyclomatic complexity 46 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/aggregate-tokens.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5927547c384d7b2a6059a4ff0a040faed2e6bc8d61dd3b5b5a9cce9918408f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fold (cyclomatic 46, cognitive 59): fold has cyclomatic complexity 46 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f07d44d0cc459f7826b7b745892a8f597fcdb31f7792f37f289f37f4b9bc8"}},{"ruleId":"R3","level":"warning","message":{"text":"update-system.mjs: 5633 lines of code: update-system.mjs has 5633 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":"update-system.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aefda77b14062dd48e806706ce6362e43dea5dd4a9c7b7e4174fbaa8bf6fe1"}},{"ruleId":"R3","level":"warning","message":{"text":"scan.mjs: 4942 lines of code: scan.mjs has 4942 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":"scan.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3bd6717f182efe542a0828261a82600ce6d2ad2b0b5cad65d2f4e245cb7038"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-cv-facts.mjs: 3029 lines of code: verify-cv-facts.mjs has 3029 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":"verify-cv-facts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc70b9fce08a123b56879f007f1413f2eda66c2a6d86e33c4e8331a724c8cfe"}},{"ruleId":"R3","level":"warning","message":{"text":"generate-pdf.mjs: 2347 lines of code: generate-pdf.mjs has 2347 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":"generate-pdf.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd2f9fcdaa5cf08074f00d65f11aef8c2b198193d9b67f94afaa52105c35f66"}},{"ruleId":"R3","level":"warning","message":{"text":"merge-tracker.mjs: 2312 lines of code: merge-tracker.mjs has 2312 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":"merge-tracker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8125fb847aff6676090c478fc3fe870751940e4f2ef9cae11f3418c8963b33"}},{"ruleId":"R3","level":"warning","message":{"text":"scan-ats-full.mjs: 1904 lines of code: scan-ats-full.mjs has 1904 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":"scan-ats-full.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c36f912224fe792bc23556d2973ed17a710fe4b4ebb6d1b0ec55b3c3100c30"}},{"ruleId":"R3","level":"warning","message":{"text":"analyze-patterns.mjs: 1843 lines of code: analyze-patterns.mjs has 1843 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":"analyze-patterns.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"343c0c797f3aefbddd7247b4628507bd5d07ff35e8ae672af0e1d2faab8cdd2b"}},{"ruleId":"R3","level":"warning","message":{"text":"salary-gap.mjs: 1643 lines of code: salary-gap.mjs has 1643 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":"salary-gap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"670d40b0ab92c0f77f133c3f2dd30333359eeb65dd1b8f7c14f33f0ce5054cc4"}},{"ruleId":"R3","level":"warning","message":{"text":"company-history.mjs: 1618 lines of code: company-history.mjs has 1618 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":"company-history.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2552057d63435f2b263790c15539fc3b0af153e6406337fe2bcf26050f26ae95"}},{"ruleId":"R3","level":"warning","message":{"text":"doctor.mjs: 1560 lines of code: doctor.mjs has 1560 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":"doctor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6ba7ca26121e95f852362ebecbf454dacced5a09a6e65b19a89a7ca5424c12"}},{"ruleId":"R3","level":"warning","message":{"text":"build-cv-html.mjs: 1471 lines of code: build-cv-html.mjs has 1471 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":"build-cv-html.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54662ef71ac7dab6ba6bc4c07f9989002c55cfbe1f2060fda27f846545dbd128"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker.mjs: 1312 lines of code: tracker.mjs has 1312 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":"tracker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34074758eaa8b9db964c0a9a0b7d407526d06b90376a8ecc050cc2536f1df17f"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-ats.mjs: 1265 lines of code: verify-ats.mjs has 1265 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":"verify-ats.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71404a2593f1e4b9e59e91160a54e4810183dfb76ba7fa4f306d8eebc6dba76c"}},{"ruleId":"R3","level":"warning","message":{"text":"discover-ats.mjs: 1209 lines of code: discover-ats.mjs has 1209 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":"discover-ats.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"814a7639f58ff53d958fd8a282eeb04900fe40c99ca382d7163d6a9450d079a7"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/workday.mjs: 1196 lines of code: providers/workday.mjs has 1196 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":"providers/workday.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a625c07a1b76984e590256e35cfc92fa247ee2b26d7d510399e4e013b6f2d73"}},{"ruleId":"R3","level":"warning","message":{"text":"jd-skill-gap.mjs: 1195 lines of code: jd-skill-gap.mjs has 1195 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":"jd-skill-gap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da39a7db2e3168020f25a711d4078352e13b3953c927869f68e273842b8ddb7"}},{"ruleId":"R3","level":"warning","message":{"text":"invite-match.mjs: 1188 lines of code: invite-match.mjs has 1188 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":"invite-match.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0596a55671d98ed0b991ce4477d1a9133efba8e1d4a519eae3eaee44d1d3b95"}},{"ruleId":"R3","level":"warning","message":{"text":"check-jd-archive.mjs: 1174 lines of code: check-jd-archive.mjs has 1174 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":"check-jd-archive.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5719994d16a5b37516fba49a3de911192593502c49929f04afad68cefd1567"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-portals.mjs: 1171 lines of code: verify-portals.mjs has 1171 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":"verify-portals.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14f9b449fc04f60c38469e2256845504382624b3dbe5407e038d76db3d8da13"}},{"ruleId":"R3","level":"warning","message":{"text":"liveness-api.mjs: 1095 lines of code: liveness-api.mjs has 1095 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":"liveness-api.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"507845e793b80c7ea9b04eced951ecdb11566270be5c818121c4dbdec7bdb4cf"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/assistant-console.tsx: 1091 lines of code: web/src/components/assistant-console.tsx has 1091 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":"web/src/components/assistant-console.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab458e94131993eb7990760ed031277b975d48eea6c7c763280bd657230618c1"}},{"ruleId":"R3","level":"warning","message":{"text":"browser-extract.mjs: 1076 lines of code: browser-extract.mjs has 1076 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":"browser-extract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"777ba9339665932d6175f7fb16995f1e0a7ed52433efee05c1cbec839b917d81"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker-utils.mjs: 1073 lines of code: tracker-utils.mjs has 1073 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":"tracker-utils.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1fc7ff31ff470e11b617d2cf6ec7f211c0e73ae98c5aa8c73700846efb95de"}},{"ruleId":"R3","level":"warning","message":{"text":"followup-cadence.mjs: 1048 lines of code: followup-cadence.mjs has 1048 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":"followup-cadence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee58e8953942845bcc8b8b4bbc13bef45f7584bf45365e1fcf1137b62963e319"}},{"ruleId":"R3","level":"warning","message":{"text":"set-status.mjs: 988 lines of code: set-status.mjs has 988 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":"set-status.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faa6f566f0345ec6e9f60041dade31b41eb804b9ef15b596c0a9ab1188ef811"}},{"ruleId":"R3","level":"warning","message":{"text":"github-evidence.mjs: 973 lines of code: github-evidence.mjs has 973 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":"github-evidence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6637a1603a8c20ed083420af42600a0d40846431e3fe2f13fe5dadde852c56cd"}},{"ruleId":"R3","level":"warning","message":{"text":"openrouter-runner.mjs: 957 lines of code: openrouter-runner.mjs has 957 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":"openrouter-runner.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0a510a50ab86d9e726434f737164ed6e7a1f299ba821a173072add6f2e4e0"}},{"ruleId":"R3","level":"warning","message":{"text":"story-provenance-check.mjs: 956 lines of code: story-provenance-check.mjs has 956 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":"story-provenance-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1e499697f5a6a32fdb9e63346ac0ab8a4d0add31e30dbaac916500cae8ffee"}},{"ruleId":"R3","level":"warning","message":{"text":"company-funded.mjs: 952 lines of code: company-funded.mjs has 952 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":"company-funded.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"301b82a9a0f521aa5298b05b6331dae5b0dd7dc40a9b695df525949ebb651bef"}},{"ruleId":"R3","level":"warning","message":{"text":"upskill.mjs: 939 lines of code: upskill.mjs has 939 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":"upskill.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d39373a84c1b63e1cd8f1c7e6cfa957b00814601366af639fdb93beac59789d"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/dir-lock.mjs: 931 lines of code: lib/dir-lock.mjs has 931 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":"lib/dir-lock.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe01a876e9cde9041f119474e06e82e9f3df6c46ecd42d22c0ea3d4ad1c94499"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/core/dir-lock.mjs: 931 lines of code: web/src/lib/core/dir-lock.mjs has 931 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":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf224fe91e0f632c5458ed86d25f04d94cfdc0d176ab6b62c82405b5d1ef925"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/peoplesoft.mjs: 876 lines of code: providers/peoplesoft.mjs has 876 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":"providers/peoplesoft.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9629dbc71c0085c022e5ccae48a74d3ed5b6663c6b30d8661f82620a71ce2a"}},{"ruleId":"R3","level":"warning","message":{"text":"linkedin-join.mjs: 859 lines of code: linkedin-join.mjs has 859 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":"linkedin-join.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c56d0ce3318afab4cc5e5f0bc5aac58f12e5053d74916a79c1401c07ee33c9"}},{"ruleId":"R3","level":"warning","message":{"text":"keyword-match.mjs: 855 lines of code: keyword-match.mjs has 855 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":"keyword-match.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0756455e383d70c76b5e1c0dd8f1ad5ec05e2364a3d2dd937611901054229bb"}},{"ruleId":"R3","level":"warning","message":{"text":"liveness-browser.mjs: 836 lines of code: liveness-browser.mjs has 836 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":"liveness-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f03d40dd4077a869afdfde4023f7744d4e43600f0730ae4d8374d3f32949ee"}},{"ruleId":"R3","level":"warning","message":{"text":"funnel-velocity.mjs: 835 lines of code: funnel-velocity.mjs has 835 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":"funnel-velocity.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffe6d4f71cee4a46a118cb3e408b6a614c7a7ed5344f87b576db9e8ffaeaf8f"}},{"ruleId":"R3","level":"warning","message":{"text":"upgrade-tests.mjs: 831 lines of code: upgrade-tests.mjs has 831 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":"upgrade-tests.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54288d4f2739d840f09877c09c2a2562917d2336ec53e4632e2cee5ab5dd4a7d"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker-parse.mjs: 803 lines of code: tracker-parse.mjs has 803 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":"tracker-parse.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7410e6b7c79de1dcd32bae37b7f19720c4e95d0694dabd35be661767ee9c8e2c"}},{"ruleId":"R3","level":"warning","message":{"text":"cv-templates.mjs: 789 lines of code: cv-templates.mjs has 789 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":"cv-templates.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cda867242ac4ab7f7348006ae111d317ce9d6027bb08c8b85660232c257abe"}},{"ruleId":"R3","level":"warning","message":{"text":"detect-reposts.mjs: 773 lines of code: detect-reposts.mjs has 773 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":"detect-reposts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb97a9e9b689a5331a3cf73cfa586304d9bb2deed61e2c75018382c6daa21b5d"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/_engine.mjs: 763 lines of code: plugins/_engine.mjs has 763 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":"plugins/_engine.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5101903b4b60cd99fa9cb6dbd1de5a5e491575f130730733d9348c60494b59"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/_http.mjs: 763 lines of code: providers/_http.mjs has 763 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":"providers/_http.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f59e2ef19223ecdb0043429df3bfba41a8ab195597792e08b93e14d8e20f939"}},{"ruleId":"R3","level":"warning","message":{"text":"stats.mjs: 760 lines of code: stats.mjs has 760 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":"stats.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebf2a785e8aa1bacb67b0f137160be8aa26028f5000b5c935bc2579e40daa79"}},{"ruleId":"R3","level":"warning","message":{"text":"updater-migration-tests.mjs: 754 lines of code: updater-migration-tests.mjs has 754 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":"updater-migration-tests.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2583953c68ca5c2ede4dda4093c3b58d62a1b9d665818e0854e06c2c3824cf5"}},{"ruleId":"R3","level":"warning","message":{"text":"ats-payload.mjs: 734 lines of code: ats-payload.mjs has 734 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":"ats-payload.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a634c2be492b2d3f0441f9ee5c559b43429a40fb78c17709093cf2c4dbc95264"}},{"ruleId":"R3","level":"warning","message":{"text":"followup-seed.mjs: 721 lines of code: followup-seed.mjs has 721 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":"followup-seed.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"405f0bc6c05f22b783257939e5dc0584febbe2da4b5258c0e914d11646684a99"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-pipeline.mjs: 717 lines of code: verify-pipeline.mjs has 717 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":"verify-pipeline.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4699ca3a8af4bd78515a0ba63ac604eab39ac587b96916c95733f631d29f269"}},{"ruleId":"R3","level":"warning","message":{"text":"cv-title-check.mjs: 713 lines of code: cv-title-check.mjs has 713 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-title-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"827425405fc85039c742e86d734ca006ff83fa8ee988e7cbd874a424dcdd8476"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker-sync-check.mjs: 705 lines of code: tracker-sync-check.mjs has 705 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":"tracker-sync-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1b6a4a8d2eb0e5cbd81fa6bb17bffd15ac4aceb32f1f9096a336d988d3a65f"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-cv-structure.mjs: 703 lines of code: verify-cv-structure.mjs has 703 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":"verify-cv-structure.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfbcdc2108d079b4537f4f2d0d66870cb8bf22a57ea299c046edd98957e868d"}},{"ruleId":"R3","level":"warning","message":{"text":"reply-matcher.mjs: 692 lines of code: reply-matcher.mjs has 692 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":"reply-matcher.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"792e321a0a7060a1b49c9d9d376c3eafbc21707428df4efd85b2e82e93c82a1e"}},{"ruleId":"R3","level":"warning","message":{"text":"rejection-latency.mjs: 684 lines of code: rejection-latency.mjs has 684 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":"rejection-latency.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49048e2fad99b2bef0e7a8daf22d069848562223035b58e53d79598f97346c46"}},{"ruleId":"R3","level":"warning","message":{"text":"scan-dayforce.mjs: 679 lines of code: scan-dayforce.mjs has 679 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":"scan-dayforce.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a786d5b26c1afd1bc066450894d2d3caee77851ebb7a29e1abd3aab4160a68e"}},{"ruleId":"R3","level":"warning","message":{"text":"dedup-tracker.mjs: 672 lines of code: dedup-tracker.mjs has 672 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":"dedup-tracker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bd25319c87cc5638c74a2d69b18728d912961397b17541987cdd3a18acaa86"}},{"ruleId":"R3","level":"warning","message":{"text":"weekly-digest.mjs: 661 lines of code: weekly-digest.mjs has 661 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":"weekly-digest.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4e3571e30b8edf3ea34d6173d147544e5a842f279adf855a8767d624b25f5a"}},{"ruleId":"R3","level":"warning","message":{"text":"negotiation-roi.mjs: 647 lines of code: negotiation-roi.mjs has 647 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":"negotiation-roi.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ac2673bbb01e1b164d512044f6e4727a019af0f4ae3b4825768030f56cfb4c"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/explore/explore-provider.tsx: 642 lines of code: web/src/components/explore/explore-provider.tsx has 642 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":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b151f326a2d7400d51677c616752b3572d9c39ee092cd986b041789b94862cc"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/app/api/run/route.ts: 641 lines of code: web/src/app/api/run/route.ts has 641 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":"web/src/app/api/run/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1bd78d6ce37e3b2e30adc526dedbff8405ec86682d9da74b5ab0335b4f47fd"}},{"ruleId":"R3","level":"warning","message":{"text":"outcome.mjs: 640 lines of code: outcome.mjs has 640 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":"outcome.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd7bf6d0f1004cc520c2b9ae5fede3d180176f95a4f0cc026ac38cda782b16b"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/career-ops.ts: 617 lines of code: web/src/lib/career-ops.ts has 617 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":"web/src/lib/career-ops.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8827fde28aa4bdaa88a74c80c75c13d0ca0b1c411962fad39952bfeb2b2bb8"}},{"ruleId":"R3","level":"warning","message":{"text":"rank-pipeline.mjs: 592 lines of code: rank-pipeline.mjs has 592 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":"rank-pipeline.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"706ab520b34853c47d5e63a388c78880ca93659c85fd74c2a952fcf14354484c"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/apply-view.tsx: 590 lines of code: web/src/components/apply-view.tsx has 590 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1949d8c3cf638baffd52586287825bb382436185f554bb47c89fc906ff03fd2f"}},{"ruleId":"R3","level":"warning","message":{"text":"gemini-eval.mjs: 584 lines of code: gemini-eval.mjs has 584 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":"gemini-eval.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f29f9dee03d010faef7075b7a771e33ebc428f7aa1cf7e0ed1c0f45c5a9c42"}},{"ruleId":"R3","level":"warning","message":{"text":"application-answers.mjs: 575 lines of code: application-answers.mjs has 575 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"application-answers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d318a55da1222dfde23613e448fb3b89c7bb853f7e987466482d44fc06f9e07e"}},{"ruleId":"R3","level":"warning","message":{"text":"liveness-core.mjs: 571 lines of code: liveness-core.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":"liveness-core.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"401ff4707f349dbb48af6a02254416361fc6546cd409758f8945f9c8607d638c"}},{"ruleId":"R3","level":"warning","message":{"text":"validate-portals.mjs: 564 lines of code: validate-portals.mjs has 564 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcafc9b4f64ef7fbd5e4e7d768560e2462e389d3d283e6ab1cbf04abc57f7d9c"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/apply/session.ts: 559 lines of code: web/src/lib/apply/session.ts has 559 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":"web/src/lib/apply/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f358ee84a59e5c1b6886d8c9f735b1967ab384417e9f5e9fe67a758ad0973001"}},{"ruleId":"R3","level":"warning","message":{"text":"check-table-freshness.mjs: 558 lines of code: check-table-freshness.mjs has 558 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":"check-table-freshness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c82955bb95e7b312dc7dbb27587b00312e721dc3386a600bc0913d8cbf1521"}},{"ruleId":"R3","level":"warning","message":{"text":"jd-years.mjs: 542 lines of code: jd-years.mjs has 542 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":"jd-years.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"258983ce6b4756d7b3e56cecfd39e245dc4ef3fb8a21301fcd3c75a36d0a850b"}},{"ruleId":"R3","level":"warning","message":{"text":"closing-soon.mjs: 540 lines of code: closing-soon.mjs has 540 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":"closing-soon.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"675054530cc1a8bfe096ebc8b4d0c792cb3eaebe7041603628b0b351c73c7c00"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/ashby.mjs: 528 lines of code: providers/ashby.mjs has 528 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":"providers/ashby.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ac3118c67cbaaadc6e38c17442b2a34994a354c267e750f1f53c8988640cc7"}},{"ruleId":"R3","level":"warning","message":{"text":"openai-eval.mjs: 521 lines of code: openai-eval.mjs has 521 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":"openai-eval.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace2d7875997d414f81dd0a319637875e681aa3801fb2beaf7b656b92f0cb8e6"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/followups/followups-view.tsx: 520 lines of code: web/src/components/followups/followups-view.tsx has 520 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":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cddadabf65dc7eaec544597b5a9cd300f775a5ac690f8ad6593f2db2b848f2"}},{"ruleId":"R3","level":"warning","message":{"text":"build-cv-latex.mjs: 518 lines of code: build-cv-latex.mjs has 518 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":"build-cv-latex.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0df37db34eb9a41cb6d1a4a70485dea8a6cbe9b0e091b7b94ecf7f2794604a"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins.mjs: 513 lines of code: plugins.mjs has 513 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f329583c47eb965aa71bae5c0901f22354ca0e54b4a24ba94af59a712c6a3cfd"}},{"ruleId":"R3","level":"warning","message":{"text":"assessment-log.mjs: 510 lines of code: assessment-log.mjs has 510 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":"assessment-log.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aec600f32e0c4e58f8aa1414cfc253f611f5342409c45c21f9fc8dbd7ea38e"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/h1b-sponsor/lib/api.mjs: 509 lines of code: plugins/h1b-sponsor/lib/api.mjs has 509 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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf3bcf474c17962ac96c714696f1022c58b5ea4f741445c6ac276e7a283a42a"}},{"ruleId":"R3","level":"warning","message":{"text":"intake.mjs: 506 lines of code: intake.mjs has 506 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":"intake.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85330b80a90189166e73e6e90c12246a4b0503175da4ecb9c0a4e9664b21cc8c"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/radancy.mjs: 503 lines of code: providers/radancy.mjs has 503 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":"providers/radancy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"017a54545232f5d71786bab06416bcef1568e9680ab79ac336392e9b47be8887"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/builtin.mjs: 498 lines of code: providers/builtin.mjs has 498 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":"providers/builtin.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4692857f524c42205edc1075e720f4a20509d3a367ac7db97ef1feaa47526d6c"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/eightfold.mjs: 495 lines of code: providers/eightfold.mjs has 495 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":"providers/eightfold.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8523e281ecd462657906d3d8e120b780186d9c57def75a747ca081ec7750bcbc"}},{"ruleId":"R3","level":"warning","message":{"text":"ics-interview.mjs: 493 lines of code: ics-interview.mjs has 493 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":"ics-interview.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64117e92c79e111dfacb10ff6fa720197eaf2305047bcfd807e66741458e41a2"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/personio.mjs: 492 lines of code: providers/personio.mjs has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bf9d23bcc2c7a20e872863184dcabc0783b03ad189d8949111572a4cc3940f"}},{"ruleId":"R3","level":"warning","message":{"text":"ollama-eval.mjs: 489 lines of code: ollama-eval.mjs has 489 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":"ollama-eval.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35db5c3a527bc5dd92f89fd2bfb1139a93abf5af55d40e1918bd09d2de0157d0"}},{"ruleId":"R3","level":"warning","message":{"text":"generate-cover-letter.mjs: 487 lines of code: generate-cover-letter.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":"generate-cover-letter.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daab54e0dce651d7d8b7608401bda450f4e9f527b7c48bb8ccbf5c76614264aa"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/pipeline-view.tsx: 482 lines of code: web/src/components/pipeline-view.tsx has 482 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":"web/src/components/pipeline-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab42b3817af31a129658dd7816ba7359ede9ba56a878d3ed8ae63a0060667a65"}},{"ruleId":"R3","level":"warning","message":{"text":"contacts.mjs: 480 lines of code: contacts.mjs has 480 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":"contacts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c863630a9730fbffd6646b5ca5422d4ce41b33931e1172ddf40fe534bad035"}},{"ruleId":"R3","level":"warning","message":{"text":"archive-posting.mjs: 478 lines of code: archive-posting.mjs has 478 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":"archive-posting.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1990928c534c6763fb02aafcf135947f08e644030b543de28ce1c7bf526c2ab"}},{"ruleId":"R3","level":"warning","message":{"text":"url-key.mjs: 477 lines of code: url-key.mjs has 477 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":"url-key.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"245518111fba79365d5205efc3bc7ed98d0c0951602616142ba39db662a10b91"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/recruitee.mjs: 476 lines of code: providers/recruitee.mjs has 476 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":"providers/recruitee.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9e0eb3c6af325f45251ccecb1a497b2f7133b2a28c27128d9bc24900516a88"}},{"ruleId":"R3","level":"warning","message":{"text":"audit-portals.mjs: 474 lines of code: audit-portals.mjs has 474 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":"audit-portals.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cce08feb4173c46b5174aea075c3462598a3606dc4e20fba3464b7bf5804f38"}},{"ruleId":"R3","level":"warning","message":{"text":"close-stale.mjs: 459 lines of code: close-stale.mjs has 459 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":"close-stale.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bd131614cda3314093729e262d85ff4e318978ddf2cba5b0ce03a52844c728"}},{"ruleId":"R3","level":"warning","message":{"text":"reserve-report-num.mjs: 457 lines of code: reserve-report-num.mjs has 457 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":"reserve-report-num.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4478073f9c5aa03d398087a935ec65fd625a280e719d28d573b14c67b5658570"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/successfactors.mjs: 455 lines of code: providers/successfactors.mjs has 455 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":"providers/successfactors.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10aeb935d6daf97989ce48adc81e3827a959548e786225cb1290326fcfaa88e0"}},{"ruleId":"R3","level":"warning","message":{"text":"reeval-candidates.mjs: 450 lines of code: reeval-candidates.mjs has 450 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":"reeval-candidates.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dd114059ac910b2f7e7fb52cbd68d9cbf6aca3e3656d2c999882e2330c110f"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/ultipro.mjs: 444 lines of code: providers/ultipro.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":"providers/ultipro.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1331b17fb51ca0b7bfbef2a5819d731b409f5aff6fa7a02a42f45269b75cfea"}},{"ruleId":"R3","level":"warning","message":{"text":"calibrate.mjs: 443 lines of code: calibrate.mjs has 443 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":"calibrate.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b778697c05528fa3d4f2bd0b3e3f234b0ab544eb5feb61a79e34fb3fc2c22831"}},{"ruleId":"R3","level":"warning","message":{"text":"batch-evaluate-gemini.mjs: 438 lines of code: batch-evaluate-gemini.mjs has 438 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":"batch-evaluate-gemini.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b819130f318e9fb947a90242ab13599fbfac89551320b81ae34262be615d5bfe"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/gupy.mjs: 435 lines of code: providers/gupy.mjs has 435 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":"providers/gupy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6fad5f9d000e3cf5d45ec0871cc594234d2368c8eda0ed2b72e75957c17b92"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/run-cli-support.mjs: 435 lines of code: web/src/lib/run-cli-support.mjs has 435 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":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32391efea43d2c1aaf6959e5629e29dccfe8fbf9a90688f4963182d2b083f262"}},{"ruleId":"R3","level":"warning","message":{"text":"learn.mjs: 434 lines of code: learn.mjs has 434 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":"learn.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"817c2a41312eb94dc9cc02d26d889733259b0f0426dfd08a345ab108e1208ca0"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/adp-workforcenow.mjs: 434 lines of code: providers/adp-workforcenow.mjs has 434 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":"providers/adp-workforcenow.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7b689adac33a1f165c9e2fa043ad86e51339394782f342c3f6745b878513aa"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/telegram-channel.mjs: 428 lines of code: providers/telegram-channel.mjs has 428 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":"providers/telegram-channel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"870f5223f323d4832dfdb2fa2cea508fe4b926e80ba61fcde709192137447bc9"}},{"ruleId":"R3","level":"warning","message":{"text":"skill-extract.mjs: 425 lines of code: skill-extract.mjs has 425 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":"skill-extract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9226145ff9f972607f15df84a75a643ede35d9f759f1202b328da73ef5527858"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/core/scan.ts: 416 lines of code: web/src/lib/core/scan.ts has 416 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":"web/src/lib/core/scan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20e6858ab6aee83df0efe0864a9e90f5eab529a9524362068ccc07fd0260421"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/jobvite.mjs: 413 lines of code: providers/jobvite.mjs has 413 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobvite.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1624b8506873347a56aa4db45227fdb058525d96db419cd67f4def2f4b6309ba"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/apply/apply-provider.tsx: 409 lines of code: web/src/components/apply/apply-provider.tsx has 409 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":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e321ce9c3511720511eb06e175b6651ed880f628dc18587f437eaa136c6130"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/techinasia.mjs: 408 lines of code: providers/techinasia.mjs has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/techinasia.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a44a9dafed2004f5c6b1184c66d35da949382de7514530054884811f8db1c3"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/cli-fencing.mjs: 407 lines of code: web/src/lib/cli-fencing.mjs has 407 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":"web/src/lib/cli-fencing.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d58e6a580b760392021bebcba0480612986f37cc2c65d8cb592b8b00bcf2f8"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/explore/explorer-view.tsx: 402 lines of code: web/src/components/explore/explorer-view.tsx has 402 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":"web/src/components/explore/explorer-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d9ea470ea5a64b59ef20c5f450241b3a0f5cdaa14047f1e47d3d24648ae250"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: web/tests/lib/brand-text-contrast.test.mjs:7 imports \u0027../../src/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/brand-text-contrast.test.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22d4e4d270c3d15c98363bdad0778a0b164981c243e410ca93ec4ac06e32541"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: web/tests/lib/core-script-routes.test.mjs:170 imports \u0027../../src/app/api\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/core-script-routes.test.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f2e37218186bfb0733150dea1bc46013de3d6ad8481adcc7a839c7b0c4d7e7"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: web/tests/lib/json-body.test.mjs:22 imports \u0027../../src/app/api\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/json-body.test.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57f893009cafa6fb1482b83f040380704c100e1507f1c3713c37f2e5c7fdd9a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: web/tests/lib/profile-input-validation.test.mjs:10 imports \u0027../../src/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/profile-input-validation.test.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5eefcfe0301dcb1e8b9b6fb586f14ae66ecfbfe0bdf361c8c46c5c27372e85"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: web/tests/lib/profile-write-shape.test.mjs:12 imports \u0027../../src/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/profile-write-shape.test.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17a9b0235c8c9e1e3bac09adca53814e625726b9b0071c5f75eacf890f86e55"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: web/tests/lib/web-child-windows-hide.test.mjs:224 imports \u0027../../src\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/web-child-windows-hide.test.mjs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e3c2d28c6556ccf02c00129de01918cd0f5d2367dfa6a78fd6baf88826c1a9"}},{"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":"build-cv-html.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc2febfbeea6bcd49acc866e8bdf53de8bc1b7b258896dc6d1f5609abed2bbf"}},{"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":"jd-skill-gap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8360c624cc1484be44570c1e3f5fd80f312c91b947b3908d72ea4f6883c3dabd"}},{"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":"company-funded.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5e98d272366c9ec1fa89e4c4942bbc9c50e0e02d78e17d1283fb6fb5390bc7"}},{"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":"upskill.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1315360f225cbf76887cd57e3b675015374e7f964003e45f8a8b0f01107fae9b"}},{"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":"providers/peoplesoft.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"114ebf76687eb838bb1d5a9191f3d73c72a6fb5f5564a3271cfbdff797a7abcd"}},{"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":"verify-cv-structure.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd7100a7846548f03152371c1bddc8129b9084179a03885d04d855979d3d52b"}},{"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":"weekly-digest.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec44b9e60ca289f89b8db16ca40034a8be5e2559f0fc4994b0fac044abb54c42"}},{"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":"gemini-eval.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"799dcdf48dc27f8957b3bb395962240436e934bad164a115415a4d5f7ea7df67"}},{"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":"web/src/components/apply-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a1675f41c3e95831bc8cf2d2fffad18cd6380dff2a9eb9914f39f7c268c23"}},{"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":"closing-soon.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d0b5dac349548b761338a59a121abc3ae07116c28f617f67a8d422aceb91d3"}},{"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":"build-cv-latex.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c472c15e1ee8fd8e41bbc173fe79d78a4f23f23a76cb046213d59f0f3169825c"}},{"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":"openai-eval.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb080e559a61bda6a2160b8831e327fb188ab0bd6d71d6b24f489ebe80d1df96"}},{"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":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d19a9c01644ddf9d7a1b17844e1cfb6bd4dfb3030cd1f99c86140d424175115"}},{"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":"assessment-log.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6d9055c0b03a12dc99badcda5c317d94133500d012a8c600ecf069c08f8bd"}},{"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":"ollama-eval.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac7177acc6070b6575368d2e0a15d6a710d46dc66b2784448bbeaf992d280c9"}},{"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":"intake.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"329184fbd3d2dc3b62ccdaf6fb37e815730fc7e761b582fed9acf2ce9e269a27"}},{"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":"providers/radancy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac28ca66fa840f5689dc801a7da1edfe275a746c20a6a75f5615989d9940bcb8"}},{"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":"providers/personio.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d16c32fb5399c9b5f095747201117021aca591e3e1380beea101c77b2834c2"}},{"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":"reeval-candidates.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf899412cee24ab9fe49b7cf38a1ad0448f0c2637d44e7a10599590c0657119"}},{"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":"providers/adp-workforcenow.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dacf22b40e29298f29149268b64cb20d77f9b8cb5d9ab3044e3608431485e7"}},{"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":"providers/gupy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00cbe444eaf56ccdbe8d84ecc050ae29650975627331a20ed0195434ab48cae"}},{"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":"providers/techinasia.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"466c1b312d524d7bab856cf9ac65b49b392a1aa750697e694d6c664c3dd63e55"}},{"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":"providers/telegram-channel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0bc73900f0c7be2af310ddc6b477f1edd1e592376f865b5181ecb72e5528e9"}},{"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":"providers/jobvite.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"847136e71faef74d30fcd43a68d11806d277a20b495424f0c094019fbb1cca3d"}},{"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":"onboard-write.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0464df59ed90c2705e52aa77a800f39a77de1dea215225243e0a65bda44caf47"}},{"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":"scan-interamt.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d0a93888cdd139f5d43840ac1994182499decff8d734a0c36958b795472c70"}},{"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":"providers/arbeitsagentur.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2971a4fa714d1416956c78fe81fbeda0f557a0b3316f613f02247be2ef95e2bf"}},{"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":"providers/jobstreet.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"580c9c90fa01c3aa2ecee408c72df0b23e632f1627cb7b59644763813572958d"}},{"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":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78c5f910bbff5e5e6bea6864e114f50a188d368ef759333aa8f58a7d223dd9a"}},{"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":"providers/platsbanken.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9087ccfe1c33d18483cef75c22bd5b1aff3de5ce789db0cbde7b20025120d3"}},{"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":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a61b619b4e9bad1a07928fd217f45095c5126edad950908e57630431554a53e"}},{"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":"reconcile-pipeline.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e764593bf742649582c2b0723dc9b6b52908f3d3373897cf5b1f149f40cc38a"}},{"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":"career-profile.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71cdda9362918e007b077c8b82bd286ce1f0d62085181943f833d24e3f938bd"}},{"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":"openai-tailor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b652c20bc18e61018812906364944cca7301d3d48473fbac0fc1eceedb19e5f5"}},{"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":"providers/gem.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11572aa9d402834d4e5e46200ca6f51577c17e4eeb402fd070991d1402f07fd5"}},{"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":"providers/inrecruiting.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7444898b0af4fcc6e2cf5d4cd55127c81618f8538352c3dd9a6ae8360678fb23"}},{"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":"plugins/h1b-sponsor/check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f0799794a585308f7ad55759a0af20303746c2d3e10724eda41617367f590b"}},{"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":"providers/generalist-world.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9f33b6aea23c5c64f12f814e7cf57f282007304a1c48fd75da193462e14bf2"}},{"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":"providers/remotli.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9535bf5db636ed2742d880167412a3a671591bbffa1eaaccf1d93ccff1ce11f9"}},{"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":"providers/careerviet.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5868898dc41178fa623f84ba3e9e0b6645678325b75121ee75a7d18bbba95b"}},{"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":"providers/getro.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b038e7b33de2b7b529e4b96822f518ae7616844a994700ec5ab341b099c0407"}},{"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":"web/src/components/cv-studio/section-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c47c4d3dc9b1a8b62e1b2da2b0e70ecbf239ad10a26e763746f6720e85d08"}},{"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":"providers/taleo.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f36fa167f24a424d82abed58b53eddc4a0f3316e42001a79252b2fa3a9716a"}},{"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":"providers/pageup.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae9ebbc2cdc5f9115506eb6a1975760961ad692affe8463e8a25763cbd56bef"}},{"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":"providers/jobbankca.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b8869d48f4dbb7f31d9010c35367b39edbd493acc523e3890ed051ed8cb09"}},{"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":"providers/deutschebahn.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c457e32151e85a7e5cd48f99ea5c74f33be80d7b73b1dfdefbf9beefebbc4887"}},{"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":"providers/notion.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6072df505db2aa510c1c42344e7649797c85fd12e22e9c393bf0545e1a0f42cd"}},{"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":"providers/itviec.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fc268675943a9127c8a4557c27fff47e34f8bbd36ffbab5583fd7df2570b1d"}},{"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":"providers/kalibrr.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e9a8f07bedc32059c65a6703d3d700bf8cf3ffc9d09f40c78237c985f4188d"}},{"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":"web/src/components/report-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2339c1af6a6e12274916e6583a22ed3d2378c94df84622089f78afc95c6def"}},{"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":"providers/consider.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae9c29af4c11494473032925591982ff8c7a70f0fcbb1edd972a4dd594d6801"}},{"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":"providers/local-parser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39583db8aa1970374f16c272ea0807a297dd2efb00869652103d087e94fe20b"}},{"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":"web/src/components/apply-checklist.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e9b4d10b1afacca93e764a3bc75ab855db0b119da898a28788145681b068a4"}},{"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":"providers/avature.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a2a84c20cd65394f7a45ac108a75b2265002026d97eb75bf789e27bac5da70"}},{"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":"validate-untrusted-content-coverage.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"561fd28464261d8c2b7a7050c3d3a2292863cd2fa530658a80c7087fbbfdcebb"}},{"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":"providers/occ.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60bb10f2880cde9304a013969bacba4ec4a2cbaf45664220a0a3215de67f83c"}},{"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":"providers/homerun.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86f3bee6b6d163916a39f5b84f34489698bdf5a2436e7b09ddc2dd04e292ef7"}},{"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":"providers/oraclecloud.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5370456ac95381b6c15d0fc40e6bae7f740d5e8f5089aa7ff1eba81e3a3f136"}},{"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":"providers/apple.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6146f09e64e7aec23d6bd3dcad89551ce2da868c8608e4e64e572cd0125126"}},{"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":"providers/startup-jobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ce7e3e4e5269ba42452827dd153707e0993e5a41e38f3f8cd8ff7239601648"}},{"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-golden.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6e5ab2488e9bed634e00727fa7994c532b38f2c615d18a79e3d8b308210c51"}},{"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":"discover-new-companies.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21370d2a14d60d6da149ad2805963a326d27f5931ba05bb1294e68e5e3f1931"}},{"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":"validate-system-paths-coverage.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cac6b6dde3056b19cfe7c18ca46a3916dac546fb6f644518b40de99e4dfb26"}},{"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":"providers/eploy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd3b7916ccbd8e7cdec520c8e63c87d82eefe71ad1ffc897ab45822238dc61"}},{"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":"providers/prevueaps.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08acee84f8df57b615df591ef1e04475e6ee8536a1c086d340c4d31efed6b13"}},{"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":"providers/glints.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a1836e878b8bb89ba567e99c54d1584bd33ef0c84beaf22b56a138c602a15f"}},{"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":"providers/wttj.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"196c33b07fdd802b6967fb5b8b670231414d1d741a2c3b083798999226323bed"}},{"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":"providers/clearcompany.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee0d7cccdea0f258d343c4c9da1b84ee16bf871e03d762e4db430abac7f3f3f"}},{"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":"providers/_types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f587d040abf37272f0913712512d1383e2b1be9e8226c1c96363700a56b6dc"}},{"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":"providers/jazzhr.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"689ea7a586585fcd37653e124903ea75f858a5cad68b8555192f74297336874a"}},{"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":"providers/torre.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8074288af5dd9fec5167e366f5133fe0d1816a571c474973dcb3e0fc1a95fe"}},{"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":"providers/pracecz.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96f964734324b9e57b1b198fb79147c17bdde8b37b7b32e7ae3245361bfc875"}},{"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":"providers/mycareersfuture.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b908c68d047debfc456b2a607f1de15b8be6f62f0ae1c64498b763494b6c70"}},{"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":"providers/manfred.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dbe5f01fb4a2f9028ec074903dbe5db17b1bc13d02da8565114fd8fafa88bf"}},{"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":"providers/dover.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cb7de587e50d34eb6bed0bd80df7c0d37958f5565c2ce49f76717e9da6f7b1"}},{"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":"providers/senjob.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b1843d0866b08af3308920b1fb3001eb8f3f604a07640ace6f8b8d5dc26fc6"}},{"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":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9353b8bb3b1ce124e38276a56750dfca094249a401ceef2b7223d5bf8713ada9"}},{"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":"providers/bwi.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bb3aa09af9f4e473abf101aab3e1c1c3980c3f6fbf996f02c99be55e897082"}},{"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":"web/src/components/scheduled-scans/job-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3432a59938a53745d8e9b170bcacc2ec7d150d82196971a1ecfb4986ad1ee80"}},{"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":"providers/yourator.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91706480bce1f057a7c3ca6a89253d98092fe8b841975c6b570f54965cb5cb5d"}},{"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":"providers/wp-job-manager.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b093df40e62ee14a52d600f48365e4da90543e05a7561648a8d9a2fc364de8a"}},{"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":"providers/schoolspring.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"240fecb6a34842fd540631ad13198ba66e802db7c79b490314363da99e0c4819"}},{"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":"providers/getonbrd.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb6cb6ffe5f40acfba3210496b9c43a10678a86c7e8f317fc829a6799a17d16"}},{"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":"providers/jobscz.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d482bad504a712d67b3fb972eb7baf823294b527446125b17cc089aa9d321d4f"}},{"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":"providers/alibaba.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31794b5ebd9295aa2a6ac85fc29c6001cd21dcd4baabc49920fde60f91d7985d"}},{"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":"providers/hiringroom.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78be3396197a8a7ff2e03caf31ed2a0e117b3d6a7ecada2fa6b6338ec34f052b"}},{"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":"web/src/components/cv-studio/cv-studio.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66ac1d984fdbeaf122957d2f5f7de38357222d2df2c49e5c95ef69bfa987a97"}},{"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":"discard-analytics.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a881ab8643368f956e301a2ea79c33d7a69cbc1a562236a8087342bb06948ae"}},{"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":"providers/dassault.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edde6d7c9d7192a3508946548ea9171b2c19aebb22b3c86f5321f7d58d91846"}},{"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":"providers/neogov.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c8a499060d2549cb663c2ffa52cf7868c34c2f1c73a5d6ce1880f5d83165ec"}},{"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":"providers/agentic-jobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"546983065b2c21cb9bbee73bb23517ccd21178c7a2eedb55c17761c18a54198b"}},{"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":"providers/thehub.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3befedd905b16ab30a9a9bccd0d5cd1d0c304f82157243d62b53edb4cf05bc29"}},{"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":"web/src/components/skill-gaps.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4669121345df309df8cec5bbc4702c1963dda700a4cbfc53da8a5547b70faf6"}},{"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":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0343cf55eeff981b1f9649bb2a573831dddcd4470f34b24e251a349ecf2770ec"}},{"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":"providers/teamtailor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c9b00143874e9b35e53fdafeb085358b8dc2f1b3b1c7186a462f2de231f992"}},{"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":"providers/themuse.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1567fc38c77235a27fc493a2502b04e327f0e4e2a7e88ba1f84a85aeeeabb60"}},{"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":"providers/pythonorg.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aa29edc503d13b6e37d4c010efe7550aff621c245e4722016b30c01a34558a"}},{"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":"web/src/components/followups/quiet-companies.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ed980da4e1f95201f5efc365ebaaac9aca709b1db9b1610347f8c05e853879"}},{"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":"providers/nofluffjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a7932afba99ce55c0fff16d7afdabd8cb86a1f994bc54855efd36df114c8ce"}},{"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":"web/src/components/followups/log-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a1abce9ce732397a30a43888899e6344ada0240ebe27e7e1ff7482ca90eb0"}},{"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":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7026cb882fbef7f2c239ce1ae3771dd4c3afbadb82adc621b23e5856b50af3e"}},{"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":"batch-tailor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97e2b55fbe697304e3357ff6b5a8a0fb8f599eef699517cf72d8e8f6020263d"}},{"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":"providers/4dayweek.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaddff27896c8c1c5c21e7758f58017659c2c5ca37b6e645c53a231503a8e4a"}},{"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":"providers/jibeapply.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8882aa24815d3be5580899742391be6f4b44a2673cd6a12d5e9fcccf5311d"}},{"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":"providers/applitrack.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e641b88dcdb4b1e12a12f9c885b603b3b6a99078785c2f93ed01cb4e98aed3"}},{"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":"providers/garena.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76da2625daa3931a167f11d814da24ad86a4116ad469e7eeacfe677dd052e1e"}},{"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":"providers/rheinmetall.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c34bbc78e563f5fb496f0af03369256957193db7a49a66711c10f6fd34890c9"}},{"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":"web/src/components/followups/next-date-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89064d4cf8226fedcfe0b0e1ab4f56efc0a062078d35ef8b3efb798a006096c5"}},{"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":"web/src/app/documents/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804abc2ffa72eae1b895bbe4a8a370385dc3e2e4662889db046819a4b470a949"}},{"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":"providers/redrover.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc0a2f08375ac4d2c0c8984dd0d7b0831202f263b0cbc64b1c2351ee163fa83"}},{"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":"providers/higheredjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2804fa550341c1bbd7d25f89a535fe361c4655ea5dd538ad393a42eccc53a901"}},{"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":"providers/google.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c7189b41de501a70363d1fa45091bf78b5db86cf8e1ad4d9d036d321dbd9a9"}},{"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":"providers/flowxtra.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96839504fd31bfd4f716b4ed08aea5cc32e2170eee8007d95ac4d13cfdb683fe"}},{"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":"providers/echojobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1877036106a7f20194d72a1b17a944ac2da739741088ba1422a225868117587"}},{"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":"providers/amazon.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b31c6c7a233d170ef3a3ff0b682aa81f60599d0f29b172050d6e513eb86a7f"}},{"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":"providers/nodesk.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65cfeed7b5839c963bbacbdb2ef6742566753cfc99e7072123fd0269ae4957c"}},{"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":"plugins/notion/_notion.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3854453d454e899c3e3f223e3d6e370da99b52b99019f5aa0538ff4e95c4e175"}},{"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":"providers/landingjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24ec9b609f04f1fb2d41b36acd506df92b1111d808bd0a24f2ce1c97b73ac8c"}},{"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":"web/src/components/cover-draft-button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da88a20093b39681f1126b3917a8ac1cf727203a9e65040278e3990130314164"}},{"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":"providers/justjoin.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc3493d2933e20157dcb7f845dfd328c68969b747c331eb89f36c44b04f27ff"}},{"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":"providers/arbeitnow.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f952721b70029d91ec83d094ea36c780849a06c4a10fa0373bf9a1f60738a9"}},{"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":"providers/larajobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be5006524db6d468ff03447824e643d8c30147d0b6814be5fbcaa392cacd294"}},{"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":"web/src/components/keyword-coverage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"937c3d602a597939111cf7e21c761bedc6b9a4414562dd68a835948f27e5ab8e"}},{"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":"web/src/components/report-markdown.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8374499e654a2bb5c6619846ad1c151e6c31a761f74cdff369ee86d2c01a0885"}},{"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":"providers/ibm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c250037112dd2e34825d3b8a017e2bb586c5beb2e5fdec8fbb4747c9a484897e"}},{"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":"providers/atlassian.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cf6890c093f4c5d476db99ad88b7c813a8a9a3b80c0103ff3b2e459eb00385"}},{"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":"skip-blockers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"011acb7bfcbf62e0f3b8f95064f9f08e04e89e516084f3d30e83fa8fd17d8efa"}},{"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":"web/src/components/home/follow-up-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb10f9558afd8d28ab6256012ada9d641a4c9a0bccd5fc8963e10dfb39d5498"}},{"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":"providers/cryptocurrencyjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ab456aa1f0e12be9646d9b2d649a45525a092d2b63ee6e8f1cdf51b50cb804"}},{"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":"plugins/notion/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db1933a72ba65e90b28d59bea85d43f64a6d9f77a106e214bd62baafa88cb17"}},{"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":"clean-markers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb73f3798b417be23150c2ed853e1c3824b2ab2c9a47fdf1f598a9e32d03630"}},{"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":"web/src/lib/scheduler-status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"901da7962315122b8da5010154255dd5081126ecb72731cd315c4382b1cab473"}},{"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":"web/src/components/company-evidence.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"646dea4497ed6c0d8de70edfd074923e1fc1455febc199c5963cac94424b076b"}},{"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":"web/src/components/cv-editor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa877a62b46bb50dd536edc9f26db0733ec8cc16866cc6f99bdc76692bd2c18"}},{"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":"providers/collage.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0f2d7ae0ff25751003f50dfd8650850a5e81670ffd059a9e79ef54845cd2d9"}},{"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":"plugins/_types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bebc556252528424400ad74ed75ac01c5bdec2d52e4fb8921d6dd653de96f2"}},{"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":"web/src/app/pipeline/compare/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"209458d8c05088bd027d2e103c85a3435a1c3eab64bc2dccc2ae110b2823a73d"}},{"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":"providers/hecklerkoch.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df6ef5ab8d8b5d0c608d4a965df51a071406df60175d1a71c4c649de1bab0cc"}},{"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":"web/src/components/delete-from-tracker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1178ab8266c37ea693639661f02bb6f94df50a8da945acb4c8d47985b717a6d6"}},{"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":"web/src/components/scheduled-scans/run-history-drawer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd93d118d4ceae2185b4314ef136c8907991840b8b25ef4fcd619fc3269e0c5"}},{"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":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d175e3fdb493046dc65f56b193ca5b416d2ed2ef5ec5c92744b65ec6f4b3ab6e"}},{"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":"web/src/components/generate-pdf-button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6970a2679200b767e93133291a2acb61752bd9371777e8f5bf156bfd17cf82"}},{"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":"web/src/app/jobs/[id]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa3dcaef590ed7faf5002af781c8beb1e13bdda72b431e0bc53691dfd7291e"}},{"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":"providers/jobspresso.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09360302e963e278df36141e1755b54370c87ae5550965731f868b7bcf81e6ab"}},{"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":"web/src/components/followups/followup-status-select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9f324dda15c84f56c29e53ee2557b2f6ca380d4fa1a57bc0556fda4b4cb708"}},{"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":"providers/jobicy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"297e33d5fd28cc914daeabe51a17394f3978575013c9dff75cefda41b4508271"}},{"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":"web/src/app/jobs/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"001b0b3b71f508d747407c11f09a6273f4dbed65e59b23b24278bdff57a9fce9"}},{"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":"providers/solidjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8614f4671d53373479b6bc85607713a540c0943871eace0196ba1b0820e50d29"}},{"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":"web/src/components/onboarding-banner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"965324f1f606a627cf62d328450c4abe8d8dc9f57bf883bb46c07d148d86c022"}},{"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":"web/src/app/api/whats-new/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"397729edad744e0b66e966c4cb010880814f51974d6e5bcd8eb2b4dc76df6ed2"}},{"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":"providers/_country.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d4317c9ba7715759f03f8a812967373a8ea5b3f000f388ef9448e3d6beb34d"}},{"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":"web/src/components/score-methodology.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddfb75f929368e4fa9b8866d5e9a3fb0f08f1aa9a1477702cc3cd667cc34aa9"}},{"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":"web/src/components/apply-button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb8a01d00b6b5bbfb28d739050207205a32c23921c034308fa71222a92a9bf"}},{"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":"providers/joinup.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d82b8428a7eb42149ff9d46b52d851d64aa3a4f644594b4598b9010b0d34094"}},{"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":"fetch-jd.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8df1f78a168a2a5f6a2ac7d903ab5817b86b13b54487b398a536b2903a65aa"}},{"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":"web/src/app/api/personalization/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"967bcfdb21ce43978b8067e2cf3f003e83a1585de72a39e8f1f0d286ebee454c"}},{"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":"web/src/components/mark-pdf-ready-button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70be10696d864848910cd89deca6abd4da0167eb29ff702de9e3d605477dd064"}},{"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":"providers/_wp-job-feed.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c116165fb644fa9f6592219b998e7606b2bf9a2c6c3aaf121c8fe28cd81ce5"}},{"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":"web/src/app/api/inbox/skip/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a931055fe2b2abc402c8c3308d36435b8bf1a2d1f1b35834e42f300fbcd6a2d7"}},{"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":"web/src/components/copyable-command.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"862eed72afc0cb41332304856e4789d1075c7565c84b55b1a9988637a2a17663"}},{"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":"web/src/components/quick-evaluate.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b017296313894121677742c4ea89c879a7a58e438c9da14bf65e0c27c07cf78"}},{"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":"web/src/lib/core/text-key.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00ed9a638ca785f011d7cefaa1888b818964c6109f63f8a3e96f2931a06bce4"}},{"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":"extract-latex-content.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77af819550f27c4c69e6c91587c57b77a542de4b2c3940bccbcf09b87c4cca6c"}},{"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":"web/src/app/api/cv-studio/[n]/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e41a7bad6ea33b1d81345c1ceb2824d4536c44749c429ea95d981c90754a5e"}},{"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":"web/src/app/api/report/shape/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb67409116f02dae356f872e38d91f90517b5af35c73ad011144dc7c8d623ed"}},{"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":"web/src/components/scheduled-scans/scheduled-overlay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad986d1e6ccf574f2b0977a87304bba0dd72ead7d66157ed8637f22ba34352b"}},{"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":"web/src/app/api/version/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f88e43157b34eb2d2b6bd0b6e27914d332d8797145e3505b29a4429bedfce3"}},{"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":"web/src/app/api/runs/save/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300dfdb93e9fd498f7270a0ceeb7dee60aecc7acb46c3b4dfa9beeafcd3bcdd4"}},{"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":"web/src/components/ui/stat-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76436860fe7af148c24777ff48367d62ded7c3bb999ab9de99f64101bf06021"}},{"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":"plugins/h1b-sponsor/lib/tier.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b10d11b71066e8f12aad6d712798cb74c9904349c0a93cf86c325d6ea16ae93"}},{"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":"web/src/app/explore/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"582f0f5cc2556d7c372142b7f45aa33f4e93a1a18153964c55142acd947fb5a3"}},{"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":"web/src/components/score-levers.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4c802b2f662dcc2b82ef28e7d3a06da1cc974ce73ce87b6cad2fcaa6e265a2"}},{"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":"web/src/lib/cv-studio/rewrite-run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"586450a8635c14979eaa88ea5e4ddfddfc878e135e6b67e93ae1b25e67295c5c"}},{"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":"web/src/app/api/cover-pdf/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b112e85505975518ea53b9737c41b3633164682822a2c7f818e96d11bc45cc"}},{"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":"web/src/app/api/scheduler/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c0e3a5da9a1cd8f07e6fc860a646624a71ac2b065d632b89f2b1c1af728032"}},{"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":"web/src/app/config/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e2f2587aa55052bd81af4501557677718b1c9a9643bc183cb1850996f3c257"}},{"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":"web/src/app/pipeline/[id]/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c361a310c69b592dfc768206add5f70603ac4431636df4db0e1a09a5d5a24a"}},{"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":"web/src/app/api/cv-studio/[n]/rewrite/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"525d75db999bdf7f17d5abb000f0454f23161055811e5242ab1fb28b51746b93"}},{"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":"web/src/components/cv-studio/cv-preview.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ab82f4c9b455ecf082a189c45edc7cdbe7eaa352b5752e5ef56f3cb50e8dae"}},{"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":"web/src/app/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6b2f0b26ce9afcc8d48a8303d004e9f2f2c733459dbc9ec0d14b6cfb70b061"}},{"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":"web/src/proxy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"869e788218f10b1efc46cc8282039ac9ad2b75aa600809485801bd76b632e52a"}},{"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":"providers/remoteok.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a2015611380c22cb038a9eacb9b52f043a9d5c3d033e01d5cff920fa04196b"}},{"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":"providers/remotive.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3507ccc947dc43ad287d97725c596724603caa99a05222d40c8ddcd97c0167ee"}},{"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":"web/src/app/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44eb5d6e4b4ce53a60485fb858b8444fada72f51315df7f4210a3a928c53b5d9"}},{"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":"web/src/components/prep-pack.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"865aae2883f47658b9368ae8ea59aa983356b6b5a51f8b18da9b81456aa53e1c"}},{"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":"providers/workingnomads.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"798540197ae171a54760b4535f7d6e1e89f3c429e76681ea92a60b4ce4339c11"}},{"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":"web/src/app/api/cv/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2df3026a36bf332f653be747205c483f9bbc3fb895222d8da78b5eae3211ba1"}},{"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":"web/src/app/pipeline/[id]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c0abc3141cd27293df3d01d417c80a804aa614617811ee6da48070f904f4f"}},{"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":"web/src/app/api/apply/fill/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa11fe96a4872323c69983e96758857b2f4d894fca90f7c1f37e4e0eed06c5a"}},{"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":"manifesto.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e9c0cb8631491411d4a2c23c90957a9002359be97112f1443de2f76175cb85"}},{"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":"web/src/app/api/scheduled-jobs/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bc9c0705adee5bb056f67411fcc90691c4b7bda7eb01f5932a7d42855e8868"}},{"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":"web/src/app/api/scheduled-jobs/[id]/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c076ebfbac987020f83fde218df506c387b1a85be7ddd1daa654bd423e71460"}},{"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":"web/src/app/cv/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c27a70b13083e4e78798287b7568fe6eb4292d241d20a189d4b33f301d83180"}},{"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":"web/src/app/login/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bc5e8f54a39cca9f6bd02708887f94eff7fa55e79f0bec349249b37768db42"}},{"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":"build-dashboard.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9315ab8a7627c80e228b68b43627798df883559152bb2eccc30fc1471e0be2"}},{"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":"web/src/components/cv-studio/coverage-meter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a6ea32ffac2526910fd7f29095004e50048d98ff39e06492725d505cba4ee2"}},{"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":"web/src/app/api/assistant/chats/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44ce861ffccfcffa6d780fed05897e783154e360aaa1c122fb919bbc69aae7e"}},{"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":"web/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b00d69940c1e4671cf9675d698b5bd5cb8a2478922e9109e07928f603fb7785"}},{"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":"web/src/app/api/memory/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3037fff22ed7f3cdda6b73f0ca81f2d8b0d6ca8bfcb88b62ff66db87ec2128a6"}},{"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":"web/src/app/jobs/[id]/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23369ddee250dcc2ad4c5372e1f9e8338496dcd36e3cf7726113a525fb854a5"}},{"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":"web/src/app/api/pdf-ready/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"594abae98487498d762974cee148d73deb3d4d8927f467842c7101d73c644a47"}},{"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":"web/src/app/apply/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3619a4299bbdfb5afdcff98f93a0d2aafeccdc8b8c0e6d9545d9c004246e156"}},{"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":"web/src/app/jobs/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37334135c226dcf47cbaa9f2b8015a07aaeebff89e648b8aff3cfb6c2dc01b1d"}},{"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":"web/src/app/scheduled-scans/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3322c4248691b1b94b5ce2338f07ad0096ef2a259f07c61bc36a5e9c20c34d7"}},{"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":"web/src/app/api/usage/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b8d1f4f94f429cba3730b07a6921d4a22a4b8ed73023f9ce74f15b7c42cefe"}},{"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":"web/src/app/followups/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecea8afce3390ccede97a7acaeed848781ccf81c63f42bf92aa101d5b4a53eb"}},{"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":"web/src/app/pipeline/[id]/apply/error.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cac6f5f7dd4f517d9d338d1a74f45ee381e5407c0d09e756af7e423c865cc9"}},{"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":"plugins/_template/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0d340c619d81fccd84878f6ad8b7ec8fa006c7fa1820b68eef51c8ac072171"}},{"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":"web/src/app/apply/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bc70fd353ff1ae0609a9d702a4c9a0acd3cfa96e2f7ed0af0197aeb08e1b51"}},{"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":"web/src/app/pipeline/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e51610a86d885d2dc1be4af64bdd26f6ec4d2b32be3c8a3b36cf501294f477"}},{"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":"web/src/app/pipeline/[id]/cv-studio/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91adc55fb7a447d302a6716ed9ce87f257c972b370862402f4095258a5f04e38"}},{"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":"web/src/app/portals/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"805ad089f936281edc0747a5986ec6ee61bd0cf3219f70ec0f469462fd11884d"}},{"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":"web/src/app/pipeline/[id]/apply/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaef31225dbd09502e9e1f4da27a00d4431c385ee1b533c9ef3992e3f59e149"}},{"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":"web/src/app/api/pipeline/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec478095b259d835b23bb7869d1ba32e182345c3a1f76a2705fd52b56ad44bb"}},{"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":"plugins/h1b-sponsor/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e204583a1df7922cd81a8861d4137db47f61d6854804317179a1a2818d8338"}},{"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":"web/src/app/pipeline/compare/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeb2f368cd4633356b05874292274076867f6be6f0cd6e8d6b6eb5c1cdae26a"}},{"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":"web/src/app/api/apply/close/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4654aac71c41eaa8c8ef43529e27befac3b5c12c734893f3510f8916da2b8677"}},{"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":"web/src/components/apply/apply-backdrop-mount.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe960315df178034fe513e80f64e966cd1fe91437d5df593302e60fd3896e84c"}},{"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":"web/src/app/api/clis/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5d322eaf788b58f7d7eba759fb2d96bf22417bd217b84e206e819061ff6c5e"}},{"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":"web/src/app/api/documents/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f9588a8b54a7360e5adaa6b3e2cbae513838eaee7b9e273a3cb3d7aed1b004"}},{"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":"web/src/app/pipeline/[id]/cv-studio/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed69c66940db7eb083b388f198c62600eaa271c9d02d3bb12d480d1b72ef404f"}},{"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":"web/src/app/cv/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4e347b85130972951b8b0b8c26dd1f3983fe6c29b957c1d681f807f0d0a7f"}},{"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":"web/src/app/scheduled-scans/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de26c685f4fdc020c7f212dc7000ee969d72a3a47cb6b8d6032a31f97c0090cb"}},{"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":"web/src/app/config/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"490f5e817f10fb8c28bfc99627f8f6e75c3e6b58484330834ee4fb974319ee04"}},{"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":"web/src/app/analytics/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a149b5f8518fef499b453899a0dc7ac6fd289e7e3575f641cc9905dc0086a998"}},{"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":"web/src/app/documents/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecd30352394b0f20aef9b605c309bddd808621f2edbc88725a0366f9214ead0"}},{"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":"web/src/app/followups/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a951737e30652b41ea04ec8653901e5772dc5b34e96b0628d76fc89edfe95c9"}},{"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":"web/src/app/pipeline/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb4ec94635e6b47cf9d050dd2aa3c348be8bd9f2a1eaf1a42fa508ff40c4834"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but web/tests/lib/brand-text-contrast.test.mjs and 5 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/brand-text-contrast.test.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"91df15657d89bd2487dc079bee35280d464d61418eb2409d24257e96c46ff819"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~945 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/peoplesoft.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04425bd7ec1c79c6d18388767aa31f6755229da4ca605dbb386f111abf0a0a17"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~528 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/radancy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15b45a9abeed7cf1eb07695b9247e1f4052bda744649bff779981c73f061a77"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~527 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/personio.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2854b0d7c3c6607b3de7af5ef8d2fcedce282997fcd35ca0c57143351625624f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~471 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/adp-workforcenow.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bd41f3bf39e4a84b22a17a381cb3569563bb4a2f70e68eac47d7e9b85ff001"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~469 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/gupy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1752c23e75ff90d3173b6f668c0cc1d932308f75145dc12dd295b434f411ea82"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~446 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/techinasia.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc766ef41c56e17113e470b8fbe472ce7e106a6d3afef1d328d00537451a080"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~444 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/telegram-channel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74906ca9f5518ce5cba970d5c0bff3f1471e59d2df440a99682fcbee842d837"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~443 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jobvite.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5195abdafcfcde5c694d9e7e7fe1201b53481a431f6429604a47cd8a61af71ac"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~385 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/arbeitsagentur.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd8eb03ab80aaa650d2ff417daffc94134fc6bceb3707b0348359ab54dd5349"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~378 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jobstreet.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9fe8750b2b2cf22d12cf91a463d1f8dc201c9340b01843cf5fbef2a1e8d8ee"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~369 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/platsbanken.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e3a221ab90d9bd00a5260b5db98219ff7a6befec23415aaa74f710552cf062"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~343 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/gem.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a779be5eeb766df5719d50c4599d5e21165b431352dcdcfc4561e62ea0cc78af"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~341 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/inrecruiting.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b96bb04f96788becc82be06e8b7954c3e18fe6e570c385399acd6c7a24247d8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~335 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/generalist-world.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29713b1c6aeb3b8959d36f68dc028b1ac2795cb9f04ad3716be81c3b96283e7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~326 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/remotli.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf824a96d5e6a3c35479eb5f33d4c673dd5c833d39de46d8df3d6ad0b0efa75"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~323 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/careerviet.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48384ddeb7fdbf017adc0412637082d605e83cc8e3747f94d492d0effe225764"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~315 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/getro.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a3f9fc1157423f79ffa5c958f971f81a2ce59b2fbc5f8fb82b5ec0822fc5d8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~307 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/mokahr.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dea99894350945422f549643bb2fd809f07bc4e3b4999a8bba3e343fa807a22"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~304 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/taleo.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0cea431ef0b660821915988314d28369e3861be4fc07a5261db1bcfd047253"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~299 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/pageup.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1088da15be60a778f4e86f045971e2bf10411a83a2585f6b3d965558f252278"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~297 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jobbankca.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48cac93b0038a510abb8f0e4a6adf90a702998c8152abdd4dae0353441d8f06"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~295 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/deutschebahn.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa95bf878f595d45de6bdd36b3fdb1b02544be57062e295b54186e6818293be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~295 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/notion.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a0c60eed32ce18d63e70510740d8f18286078ab73e13bee5c1873612fd3748"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~290 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/kalibrr.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4534e338c4a0cbbbda99cf299ab6b128cc8b43a69c668fbdf7a972ff6d172212"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~288 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/consider.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"114e90f8a40b8c951616b32408becc011be6761ad3ced84a0f94fef30aea1da1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~281 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/avature.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10abf2bf3fa720bfe7314f4ec6b6432e421ea41a9b5e8520d1e95515835ad31"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~280 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/occ.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9ec49fa9f1e546fb76b76c70c6c1d308aba1b34ca0bdc63685761584262320"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~279 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/homerun.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca5de5df01ead27e3ec82b8b1a9440b29872591f766ec67b287f3e5a96acbb3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~276 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/phenom.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d6f50cba23d6ab06b82100dea52f10daa1ab09872a3a04396afe52b7f7c40b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~273 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/csod.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90baf99a9b5b2724ddc6ba8735bc4f6f11d8b63d6c19fa3fe78e8a6f6ba3eaf0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~273 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/oraclecloud.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c731f91d5b4ca49749fc5cd6631cd8d96d74ad76df73aa7750f7e14c35c34e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~268 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/apple.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb2cd5390b3fd21913306526b013d6d151bf9ccc39d886060c1cb719470d480"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~268 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/startup-jobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f011762cf5614fc1ab2a40fab743d41c0483ac18982e3776327c483e07e2ea3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~260 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/eploy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9de2cf9cb1194e4de2241eadaa5810bff98d375cca7882f3b85e285d984b54b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~253 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/prevueaps.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f66a7ffac3d80dc24b4410ca4ef56e8de05a6c25e902ffcfdd51f0b7124272d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~250 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/glints.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea0cf5c19ab7a5afa0f107accc429b39d163ef7e21397319cb2d6e859b4941"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~249 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/wttj.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c981e22e3490788925508dfdb8866d0fe96ef04e5acbbe1cace336d26d4b99"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~242 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/clearcompany.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a23c60dd3fe74108ceb2f3ac6d3c3c4fa38adfa3008e91f9bc1fc9b84a6e35"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~238 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jazzhr.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"688e28e966ec688ad2eb60fe8fe8f9dd9324cbd871e4002c6ff10eca76e444e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~234 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/torre.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e36f7e3a0bb6fb906e8a3faf1ed5f07e258bee059dc49418a4b8fe92e8a9fd8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~230 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/pracecz.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbbab6e17086b01fa6071d9e5a2cdc50b3a57571675d41a8015975cc90d5e49"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~223 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/mycareersfuture.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef628f058ce667137d9f104a0f4492b244ef7bc23ff92fdb87bf0822f06683b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~222 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/manfred.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b310783f75c849ceb36fd6d58ab821b4b67548825a507cfaad9d4a6c5809eeed"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~221 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/dover.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17a0fb370b7babac2d6c3654e3f3f72b9447855e7cb08ee57026fbd325e18c8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~216 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/senjob.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aacc0468d36c84e2c0669eca33f152fa4b1b8d119017f100e32ccd8f8a572c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~214 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68da0c8a04f628c186eff8e2ff1930b87d1e113996207b1ad9e4de883135e9f7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~213 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/bwi.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36f34afeb3892f3a6e4c2ac7c086604cfc763e7685087aa72d2b554bc568d05"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~211 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/yourator.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92386779621d72ddc04e8efc194bd0b052b77fa8c5a677fdaa6a509ac6f7db12"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~205 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/wp-job-manager.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc757a1a3ecee6eb343efc1bb9dbc418388ee0854a0e62c74c2a0799f81f25e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~202 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/schoolspring.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"943e3e9a4e108b82b0541aa21691adf873dd6835ca7e462a4bc8c57ec12c1290"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~197 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/getonbrd.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23492465a3ab2d6758e5b629eebb5f01d085730c9c84d0957ca664faa7070048"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~197 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jobscz.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ac41077f88b5f7f16d6bc510603b6e04251aa5b18f4cef3864214242192800"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~193 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/alibaba.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"327a3bf160ba2f50315b07b7c2b11de6a2beefc6d62ccbb10cb3dd94afe3ecae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~193 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/hiringroom.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"174341a481951952bfbace864f88ed6a6d543f1a7804e52d1320be51a51ae8f5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~191 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/tkms.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e37406356a637eac26b39e82b82a7bd95a5d1c86d38a784abdc7238da8415f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~188 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/dassault.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8409d2b17cde220b4975c77c900a41f81a2c7e0da66e870f8f8caba63b77f7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~188 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/neogov.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc5c911133444da6fe5a8c9daf9049471b271070254f27141ec5cbe499def71"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~187 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/beesite.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0057642a029bca3fe7f7f4bcc0cd0ad202f639bb27ce1f1f4c1632e864379f26"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~185 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/agentic-jobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"313b18301a0d1e3a30ea05973075fdc78f15c3c22fc5da39220e40ca524c10b3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~183 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/thehub.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b37e5c17a0cf6cf0397f3b4c15604be50b5019eb7208a9d77a3ecb21da9ddb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~179 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/teamtailor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d293bb6417e7b43898c5ca202480c2de4dcb0b7ce96476a9de9120b2a41f615"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~178 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/themuse.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e891ec571a54c69473372d1f29c9450c47937f4515de312c2d2c0619a24441e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~175 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/pythonorg.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c939cccb42c18d5511cff0e88e5aad61e06fa37d10b7de12dbd5b67527bf77"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~167 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/nofluffjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4c4f71877a830a84a343199f9482cf2b644cf107322a14dedd555b160eee54"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~158 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/4dayweek.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb62f448c54fa2bc813254aebfb5c822cc03a171c00b02f12c0197675f44a31b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~156 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jibeapply.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"486aaf45c1ee09f380b77e177ed92e33855b6d0d823a3f1892a9a0734d556ecf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~154 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/applitrack.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d6a6dde17bcb5868a7796420c01c55897fdcb335f6db5491a2b233e55cc714"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~151 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/garena.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05257c4b8adcae91b1cb0fb7ed4a69488d2427250541dd5b06a0d4a9076a617c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~151 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/rheinmetall.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a1c3905ca0d4d7eef1e409523bad3db2faede0f0a9f404258008547284d469"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~147 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/redrover.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3994adc8b7d433b9936940aa0092c36e429af43c98666188a4d728cbf8eec9ba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~146 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/higheredjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30fa1b32a4b478345740a4affb39cc5b0982e8e478fbffe266ab7834f861157"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~145 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/google.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73867c9cccba9291b6b66bcf988be4577a69100a102a9356932f94d5992c1c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~142 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/flowxtra.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa55caffe38adb02a45cc5c414119be2665e4585c81765ba09074d461540810"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~140 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/echojobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ea0cc023877714ec88aa4bdae81afed8d131f60e006a3d0c1b5948068ec8cd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~137 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/amazon.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df8f254d7c2b4085aefa92b04da1083629795cf858d04786d8c9ab3c019308d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~136 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/nodesk.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee8e4271382eb9624b930200b53b8c3c93dacc16a3fa63049782c2ae5eeb8f8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~135 LoC): no import path from any entry point (390 application, 167 tooling, 1244 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (plugins/notion/index.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/notion/_notion.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"621f83bc60889916731e197c0d776bb1680b5f53110cbb88f248fa7c5bd0aa29"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~132 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/landingjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79b9e796b8bcd8d9e8159b3d939787104a9988c7996ae0ba236472d0b08cb38"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~127 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/arbeitnow.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36606d0f3f0b2a562f63f17d355fd23fc4473456becd2f813212ef76a4b8a87d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~127 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/larajobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b98c5631e60a22d2e1056e4ee754794fa56726d0b5e2525d46e3616844c389"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~120 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/atlassian.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c86fbfc45505e4500bf7c4e671a0793d17d73839e6196353d3d44b256630068"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~116 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/cryptocurrencyjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9169a0cfbc5dbfdd7040ada27ffe3fcc32ce9be265480faaec52475892639530"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~113 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"plugins/notion/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a311c7d18ba15f8b7f9912de69df090400556b5f1bfd78921fffa9f8a87120a0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~105 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/collage.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab71bb9aecddacaa3436a4abb380f6822714af0a2fb8a571f05247fa80d992"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~103 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"plugins/_types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a55e4ff3e017759c1fd8f188bf4276844d871f5b073c71de726ee09480f09"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~100 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/hecklerkoch.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30fb4734b9faddc0c5c66d996587ddc86915ef1b8739eed3c6ef1eebf65abca"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~86 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jobspresso.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"522b28e1c4a8e0783ce32688b91484cf82fe40392d8ad6f5ffeae34fb32cb02d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~84 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/jobicy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"754ad27dd6abd1d2c7dc84c27b1ee8ef40a15c5b3d13d2fbfc4f9310ca7a4632"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~82 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/solidjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e11a0cf9ca94359d076a224fe8767284730f35a696bbdac920f008f769b14f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (390 application, 167 tooling, 1244 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (providers/agentic-jobs.mjs, providers/gem.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_country.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeab7c234a2c6c03625ab0c13429bd95a92b30093b988dd755f040edf11b2d2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~72 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/joinup.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3f10f248a12e132a6f39a1d99fe5969592786efe49089c940978125e835412"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (390 application, 167 tooling, 1244 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (providers/jobspresso.mjs, providers/wp-job-manager.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_wp-job-feed.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"757ce01cf119239ed8d490c44f66e379adf15daa415023926c57353f881fa152"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~65 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"web/src/components/copyable-command.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70d8997992ad9a38a639be01d4eb15048116450990f3fa26f1e40ead1351cf4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~54 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"web/src/components/ui/stat-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebc3ab6a43b1c2da489df38f18e2d9659496cef0b3538c7c3dab741dea247b7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/remoteok.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d9c45e0b5142c936f82522fc5dd451f506b7d5fd0018f586b65d90fa24ae68"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/remotive.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a94825a51b1f7a1676f1de5459549ee04460d31b40a4f6dabb9e21bb3665b3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (390 application, 167 tooling, 1244 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":"providers/workingnomads.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4023fdd42c75b963e5e92af0c2fb48df748b7b51e350d9968868edbddecd4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OPTIONAL_SECTIONS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-sections-core.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f3915fbba7d96029de6725e3907cc5dd65b1a7782d55d67ca52eb6a8e203c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027similarity\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fingerprint-core.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ebe2a4bbf3f0bdfd367064f7d74dc7a4076ecd02e4563a85823de01faad8dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NAVIGATE_RETRY_TIMEOUT_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"c456693044f520a5882e3c6cf304119adcb86ad8bb1a889c4369fcb4b2643ac2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_RECHECK_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_cached-lookup.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c9007a5c9cc029e7ed73ff6fe895abd54e04c8f99b59411778d6bfd7b68b8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_resetConnectionScopeForTests\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_connection-scope.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef2f9626f7cae51237f656bb00a114b62ce4ca74fc15966983acc948b926dbe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_ids.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8ccb09cb7932e045dce128eedc7513394f366ead77903858894196245d0c03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/softgarden.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1429a664d5fa0948bca828e0fb005dfbd1b04a05efc872b63af11f46610b11e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8077282e98849d464d2e3116b287b6f85339b8252cc44ead03e83db73a4070"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/vdab.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efffbee7b24f3d34d62eac72dc7cf6a329470425ec4e6bcd1281bacebce8db7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/weworkremotely.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73bbe1ca6478d3c68c8be654710f12949bcb151a260f6e1eed02a89dccf5dd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseZohoJobsPage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/zoho-recruit.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfba9f67d62a70bf51bd81af3a4ef269d6fb84467c5a14c567e2bf4ed575ecf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/zoho-recruit.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2f648f0e4882977fb6b2c21b13eba05b6d03056c36627f725880463d5d25c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027YC_MAX_PAGES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2617977701bc5922b0e769175a18862dd6ddec1a83dc16d3134a5ba3cfbdda7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseSeedEntries\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3339670bf5f2102ecb7e4dd729fb3577324a8bd1c27730c0dd83f832f1947862"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SKIP_WINDOW\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skip-blockers.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"971f6f5ee3ff0a9cb337dc8bc005b0a55724bd4ba2ba8fbba6a4201c1fab49f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"5015f39f3cf7c37f17a6441b8fc6b0cccb01fe73ae21773812c42482d387a338"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027actionExists\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/actions/registry.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13d3e1c0184175b43a12ad323794bcaf06b4d9c885d97aca17b6eceeaea6620"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ButtonVariants\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/ui/button.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3365f5bafc65c74daeda09cabbffa72f9884e26043c19d65845dd335822f3a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027newDrivePage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71aeb43794a3d9df8f14e31b9fe7afb355abe0402b2c7613cc805e589437e6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SCANNER_MISSING_MESSAGE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/explore-error.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a095f514eba24d16c0bfc817e8dc9032815e9b3f7c5bd6861872cf228d01b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027companySlug\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"054bbf6eb0ffef423abb409384892e82436ce0dac210dd42c60722de985747cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fileExists\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3266fea9118e74d994f32d822dc6dbc2150aef8f58ceaacd59a0d89c9c453b3e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027YC_API_URL\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6412122617fae617ee6f75f1c4d67ea280ae8349ddfcd1516c7b0fa3bae5906"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sandbox\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/session-activity.test.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"073454c7f4fa964b02dcdc0f94b7a4630dd32adea34eaec4ef6db145aa1263ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027repoPath\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"987f497f594009b229e2921fd4f6578dc285df55676956943d1625e98e48f5a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ISO_DATE_RE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-prompts.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdf90891d29993dc8e76bde2b607aab7b5f219d5156fc0acb3ffb148a50b68f"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): followup-cadence.mjs \u2192 funnel-velocity.mjs \u2192 followup-cadence.mjs (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebb66232791ee2ec32a9dce475e35680001333c9c41828963af3c7a65394e1f"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): web/src/lib/career-ops.ts \u2192 web/src/lib/core/pdf-index.ts \u2192 web/src/lib/career-ops.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c04bbf9d174b76de4616bca3382768b3e290a815144e896ed4cb2c8326f18c0"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contacts.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5df2b119e5007d9ffc6218fca2018227166ed219b7472d4d2637ced838fca1"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fingerprint-core.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b4aefa08342fa9d6d8a7f20aebda349504d38a3432297b95c73ed061601c9e"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/index.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0371d1b1e67a56a9cb6c930e2e885e8fc34c9c70b70beea8bd479676146f5afd"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/index.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9b24dfc95e8ab7ec85a08af90ee7a60a8b18c899a3716d8217c2a5861c3e5d"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3038841a902f8401fe2888642506adcf0e6181919106efcf13a2fc35fd3a52a"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"session-activity.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d65e285c38cd03970785b84e6f9aeb23294e5c53451f7dae21135b2edd2405d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!v \u0026\u0026 typeof v === \u0022object\u0022 \u0026\u0026 !Array.isArray(v)\u0060 appears character-identically in 2 files \u2014 web/src/app/api/followups/cadence/route.ts, web/src/app/api/profile/route.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da5ec19ab8b74f4f3c8a0c0c18569fe185a6c60c21a9168afd457ebc903a6ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(categories) || categories.length === 0\u0060 appears character-identically in 2 files \u2014 build-cv-html.mjs, build-cv-latex.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":"build-cv-html.mjs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0ab4e80f8a4bc348140029c09952e8df12f74a87a1703f345bd9cbf90de59c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(entries) || entries.length === 0\u0060 appears character-identically in 2 files \u2014 build-cv-html.mjs, build-cv-latex.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":"build-cv-html.mjs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74c72f8ad91fcccc8003df3445fa545b3f106921763b364d8772992f24f43b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isNaN(d.getTime()) \u0026\u0026 d.toISOString().slice(0, 10) === s\u0060 appears character-identically in 3 files \u2014 scan.mjs, web/src/lib/followups.ts, weekly-digest.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":"scan.mjs"},"region":{"startLine":4108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b689c925d97d77847ae61d8a0546f51a340c80862d9931024ac7b3be0b369025"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!String(job.location || \u0027\u0027).trim() || /^n\\/?a$/i.test(String(job.location).trim())\u0060 appears character-identically in 2 files \u2014 providers/icims.mjs, providers/jazzhr.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":"providers/icims.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"749b6b40e38d748b7a4044e7a9dca7c06cb36216456fb7095d55505753682908"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!e.shiftKey \u0026\u0026 document.activeElement === last\u0060 appears character-identically in 2 files \u2014 web/src/components/explore/first-score-view.tsx, web/src/components/mobile-nav.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/first-score-view.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a833549c7f044755f9e39e65d27372adcd428a55d06f9eea935c6b9db6ad2e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry || typeof entry !== \u0027object\u0027 || Array.isArray(entry)\u0060 appears character-identically in 3 files \u2014 learn.mjs, lib/cv-payload-schema.mjs, scan.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":"learn.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa260fc5d727f103d0b63546e55fdf970ed8099b027c2af881314a81dcffaa37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!existsSync(abs) || readFileSync(abs, \u0027utf8\u0027) !== svg\u0060 appears character-identically in 2 files \u2014 .github/scripts/architecture-diagrams.mjs, .github/scripts/how-it-works.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":".github/scripts/architecture-diagrams.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5159dc6cfbc27c349fef57bfdfbff93eac7ef48aab56f682226fc6771feb8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!existsSync(reportPath) || !statSync(reportPath).isFile()\u0060 appears character-identically in 2 files \u2014 keyword-match.mjs, tracker-utils.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":"keyword-match.mjs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"08550999a117cd107ee0756ac9b6016fe83f821a685dc7a7560a45fa0386fa8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isLoopback \u0026\u0026 parsed.protocol !== \u0027https:\u0027\u0060 appears character-identically in 2 files \u2014 openai-eval.mjs, openai-tailor.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":"openai-eval.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9add83a2fa876bf41acc517dc6df6b3d6071f1d7522fe707e719521b71069542"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!line.startsWith(\u0027|\u0027) || isHeaderRow(line) || isSeparatorRow(line)\u0060 appears character-identically in 2 files \u2014 history-ats-seeds.mjs, plugins.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":"history-ats-seeds.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"049e0ca6e915abacb1c8b453ec2b51b6ed14bb0b25abd210c66cfcf7ee4fe706"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!owner \u0026\u0026 existsSync(join(lockDir, \u0027owner.json\u0027))\u0060 appears character-identically in 2 files \u2014 lib/dir-lock.mjs, web/src/lib/core/dir-lock.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":"lib/dir-lock.mjs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94ff987e770c0c68693418b8cd9221e24e81bbfe17b683262c1305312e255b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0027object\u0027 || Array.isArray(parsed)\u0060 appears character-identically in 4 files \u2014 analyze-patterns.mjs, hired-share.mjs, intake.mjs, upskill.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":"analyze-patterns.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a067cd62bd6654a6b3c592c01b42b7470b6fe392f3c97045f8f31167de27378c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!payload || typeof payload !== \u0027object\u0027 || Array.isArray(payload)\u0060 appears character-identically in 2 files \u2014 ats-payload.mjs, lib/cv-payload-schema.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":"ats-payload.mjs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a860c2204d9e73a9a173cd895b0d14adb8cac303fa8c44100a79404522d08e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!profilePath || !existsSync(profilePath)\u0060 appears character-identically in 5 files \u2014 company-history.mjs, followup-cadence.mjs, lib/page-format.mjs, rejection-latency.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":"company-history.mjs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cce0de7d544ed570c385a0fa53f81c4a34840acbb45e9ab1f4cd45c34d26a11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!readBack.inspected \u0026\u0026 retry \u003C READBACK_RETRIES\u0060 appears character-identically in 2 files \u2014 lib/dir-lock.mjs, web/src/lib/core/dir-lock.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":"lib/dir-lock.mjs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"553e0fa86ca51cf2d54c1687184d8ef40d93f5f0d34ecb1f2e39a5954e756c3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!res.body || typeof res.body.getReader !== \u0027function\u0027\u0060 appears character-identically in 2 files \u2014 plugins/h1b-sponsor/install-h1b-index.mjs, plugins/h1b-sponsor/lib/api.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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb228c3f7ca6b2b5ce760293c275db69722e0d04d92f60bb2fb982e0609fcb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!sections || typeof sections !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 browser-extract.mjs, providers/smartrecruiters.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":"browser-extract.mjs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"463961d347b0fb195a93a0b3f0e68f115d36cbbca322c9b68625f3281b26a000"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0022object\u0022 || Array.isArray(value)\u0060 appears character-identically in 3 files \u2014 web/src/lib/portals-config.mjs, web/src/lib/profile-patch.mjs, web/src/lib/scheduled-job-input.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":"web/src/lib/portals-config.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0151362e1a9b166d763a383d9730d7df6c8062b201297f52f41654738b0a48e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(el as HTMLElement).offsetParent === null \u0026\u0026 itype !== \u0022radio\u0022 \u0026\u0026 itype !== \u0022checkbox\u0022\u0060 appears character-identically in 2 files \u2014 web/src/lib/apply/agent-interpret.ts, web/src/lib/apply/extract.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4068f755a2daea2d8cb26431f4e244f215c5515f235ff88f08d1b4374291255"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/^cover([-_]|$)/.test(name) || /[-_]cover$/.test(name)\u0060 appears character-identically in 2 files \u2014 generate-pdf.mjs, web/src/lib/documents.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c4cd9173c7f01ee135b5482916113b7a6aeb6d48cfd2141a8a3344a89e37b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(entry.keywords) \u0026\u0026 entry.keywords.length\u0060 appears character-identically in 5 files \u2014 providers/alibaba.mjs, providers/feishu-jobs.mjs, providers/meituan.mjs, providers/mokahr.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":"providers/alibaba.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"212a661f8d94cb6ac6eef1efb1b3620971fc25057ea95cb9136400094fc8fb52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(j.locations) \u0026\u0026 j.locations[0] \u0026\u0026 typeof j.locations[0] === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 providers/4dayweek.mjs, providers/landingjobs.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":"providers/4dayweek.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b983bbf448cc899f244d634e158b9635b5f8fb45b33fa8409cad1b07d2ad01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060JSON.parse(localStorage.getItem(\u0022career-ops:config\u0022) || \u0022{}\u0022).cliId || null\u0060 appears character-identically in 3 files \u2014 web/src/components/cv/cv-ingest.tsx, web/src/components/explore/explore-provider.tsx, web/src/components/explore/explorer-view.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44e985b9e3bb8604b6260a1181fbde4f1c7a6a44cf0201a3f7234d130b0a771"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(process.env.CAREER_OPS_TRACKER_LOCK_RETRY_MS) || 75\u0060 appears character-identically in 3 files \u2014 merge-tracker.mjs, reserve-report-num.mjs, tracker-utils.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":"merge-tracker.mjs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0623cd1b0150f25e285b05794406636fa40c06e10e888d15f24f6d32aefdab23"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseEployDetail\u0060 is exported, takes a document from its caller (line 181) and hands it to \u0060flattenJsonLd\u0060, which calls itself at line 170 (\u0060flattenJsonLd\u0060) with a piece of \u0060value\u0060 (and at line 172) \u2014 and nowhere in \u0060flattenJsonLd\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060flattenJsonLd\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8105e3460c8976e8b8d78fb505ddf0739c5630402aedb0b5f818c9b202701ae6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060buildOfficeMap\u0060 is exported, takes a document from its caller (line 132) and hands it to \u0060walk\u0060, which calls itself at line 150 (\u0060walk\u0060) with a piece of \u0060offices\u0060 \u2014 and nowhere in \u0060walk\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f41ad905383756ef2353df170a715ff80f4a51421dfd91e367ce7e7d9574704"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060getMessageBody\u0060 is exported and takes \u0060payload: object\u0060 from its caller, and it calls itself at line 248 (\u0060getMessageBody\u0060) with a piece of \u0060payload\u0060 \u2014 and nowhere in \u0060getMessageBody\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060getMessageBody\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/gmail/_helpers.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fb3b552f238ddbdff38fd278a4401184bc8d9729e03b027bc683c49b663b6f"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 19/25 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: avatarDataUri: \u0060avatarDataUri\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":"hired-wall-build.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4e16f839049a1ab984c1592cd9dd10f6e645a6c2cd5dc1eb0d72b4b792a2fe"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadFreeModels: \u0060loadFreeModels\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":"openrouter-runner.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8435f9f4a717a8fc1deced9407f2a75505ead58265b2c94e60ee52d3770511"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchJobPage: \u0060fetchJobPage\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":"openrouter-runner.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f621ebc0265da288eb6e47300a36e9475e907dbbb1877999dd6645c476ec70ab"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: cmdScan: \u0060cmdScan\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":"openrouter-runner.mjs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"104071a41126da6a11c8aeffa20470b21c4b38f97c656b5c24fdd803f93c591f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchJson: \u0060fetchJson\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":"scan-hn.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1d6327cea2409f083469ea10da1ca052a18963a4eaee37dcfc984ea362356f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: collect: \u0060collect\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":"web/src/lib/report/report.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fae936dc9a3a10b36c2270b66be628a5790f589b0a9e0f2e23981750c549935"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060url\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"68541b30680ac5e4fa3c80769b7a530676b59de30aa25a0d9fb5f303b78b718d"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sanitizeImageSrc(photo)\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b85eb010a75707bec3bcfc72b93d78aa9ce46d9c86fb72443476c1f354fcee4"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060escapeHtml(fn.url)\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9272f0953d4d67c71531f2ce19099558bbcc522b1ce6d53f14fa6ab3c6e41f"}},{"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":"archive-posting.mjs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba30585d8003df55054fc0a12b85eaf181643bd30afc5b61dbcdddfffbe35a19"}},{"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":"archive-posting.mjs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cda320a5e8b55775bc24ddcf33e47a0e0de757c2ff286c5b03ae131c97f1f87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"845a91fc1aa4d7ad0322c2407b54eb61edb5b9c0a1b5cb717d23bde59e7a05a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch-evaluate-gemini.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc0b9448fa8adc90fad289258ddfc985c0a184415f4eabb409d74d287c7024c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch-evaluate-gemini.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0069fe42dc2a47e5c9b8207e8ebee327423bb7f61c99359184168d88279a19ff"}},{"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":"batch-evaluate-gemini.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fb0001093b1fa99dbeccd2d89b232a0ce6e543298833e5c0e44acbb34bbd6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"branded-successfactors.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3571bd11c84c47412d38e4a7ec5a85959a0233567b19df1a617f1cca90f66d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5999d5c18935dd5d4e5bdef6f8e0f81c479e87a9ad40b983234777841fc2c73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a20866c86345d1d75b736b17cfe5a6e064bb476b339ee92c6905e0729ac02b"}},{"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":"browser-extract.mjs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8017014ed432fd5ff87e10aa0fd47b6fc6c3ed4f87b96844a3afb84a9e8ca1db"}},{"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":"build-cv-html.mjs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc7aa354455cb9157003c5dd5fa62f4ab9effcf178e47da140714ce86821402"}},{"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":"build-cv-latex.mjs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"977da75502f7f4baf5a9fd21da20bc6ac4a3328628aa7d43fb1eab81aeef18e1"}},{"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":"build-cv-latex.mjs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a18e67211484453b0ceb2348b1ac4d266778b2b1a63a04f477694361283167"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"career-profile.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0609aecfc3b6e161ad639e5e17fa9900266191a4e2e760db92e56f9841669bee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca819fd388d2760c9edbe3f46488a53d3205f748a0b4aaf27f8c5719947729c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63747e4e657c7a8d63029c6b20465763f29e6eb109ac7b07233dc67caf4bb8e"}},{"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":"check-liveness.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"342f41879113991e8cda1b02019d547a12e99b96752be3812a4567cb9f2b4051"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cff81ccf5274a4a959eba8cecb5d1ad0e8328f2beb3c784d28ec0ff4d6c121"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d8cb62d6c8ea4ec0ec6e5f01cba1b7313eeabb01be3130386d72654c8c0f81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44e84cb863b6ad99bfdcc282ee936be8848d1fe05f771618e6c11291fdbe051"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b66da8988dad65a1cf86277184b9a60ad2da7b29014135bf0ab1803ebe2a26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"924ce82feebd348c26fb40c92bf88e3b82be5f0558cd7b388004c0fc80783e5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"99245f861b400baad2108313f8f359c910fc220623c6f8ac44305788970576e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"93457c0e95612e39179a0ad1cee044c925ef6697d929ca1ccf6a1d96ac4f86b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e590939e098c639c6e0ee6288ed88db46f3626efc5007a0844a9efc45350c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dedup-tracker.mjs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e48c6dfb4a84efa5b1af12324264d8439e688c7ddcd88eb184c8a8bdd35f87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discard-analytics.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacf0d8d075b53f5fca2026301859f893884036a5f38beddbfa0d88a38abac9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-new-companies.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"592ca5997dfc173599ba91e87ab1aa86273d21c6ac6753a847c541d088d775c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"04802fd649981d289400a6caffe0f244427cadc00d5a298c9e89aa165904c141"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9648956084571d4e511f611c08e5226ebacf93ea361b4290d52695b406ccb1c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e5172bd7ad358de66f108ede0048af551b7f801acb7fcac42bd71f7f873d77"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"910feccd4c73e0537ef56d8f05af6f511aa0b74484834c3728494f17db2970f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d75d57094fdd6ee38e6521fb29eb3f5c13ce37363435fa478f0293548b316b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"de67f280106acd81d40568cc2de2a9aa4b5ac5cd0d3c070d1d0960cd0f8749a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fix-report-links.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f48793f25699783297f3e0fab4e809669891872f43e0d120acae0ca20a1e313"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gemini-eval.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"702236ca0a0b50fa3d065ef2edbd0a8b228c1b585eade9ca8f869fa570a13033"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gemini-eval.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0b081f312bd72fc8f31fd14bb725c6ccc7268ec812eed31b5fb32d5fda588b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gemini-eval.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6d23ea2b49b07f42a449588804f48b8b06d35ff13a44618d6fc8d29cbceed6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0629d4e1337bccdd03bf287ca6303c80255dc94af55b0a450cffe3534801b75"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb51f517e5b8f4c037e845f456b4fa7802fb7f965a03b891a0ef17b065c050ff"}},{"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":"generate-latex.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"881216024d52a43e58e5ceb18203344cc1f1fa580edb3ecba8761f0bca79da70"}},{"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":"generate-latex.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ef176e5f1a4cedef799b9a0e99d979d6645b269ad3c6bf626f7c29b3bfc067"}},{"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":"generate-latex.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e7813d1365e83be52b3944847396fb52af3a7ad7d2dde9893774a849a9d216"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04df9adde260ec6d275c36937a70d6d796bf78987b94866e48a6992b639bc4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"707e40543a5cce71cc53343e50b85c86bd5bd8de6f8abf3e2eb38bf339d9af55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"32645ecebd5c22cbdf02c6741aab495adacb7a7c94ec3818e2faba9c8d25fee9"}},{"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":"install-latex-engine.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca045bc40693cb24d2fd9d96d7ae174a4821c7ff7bc877926c3b48919a6a893"}},{"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":"install-latex-engine.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a40dd1edff9723e98a24bfc2a51d91722dbd09773710a2c9da4ba36caef72a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"23366a3aa0e52f2dfc158831a46095e4a522727f76f86b968ac01928a0a18108"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a22aa36c39a28c53b662c8e204730944c1e4bcd9e2acea970283fd5c8089da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"519acc7989bddbcf708c5b2131f11cc1777a1877179a513e6062aaed317225d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d441f82ae99404daec8bdc317151a95fb89bb5c964ce4e8cd68f9b0368fb3b3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ee1d159fed935ca1a41e5f3589adb09f3a0876ad2c6748eeba701ee033ddd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99fe7227ff47f584782f92a8bb91160a2481f7c24deb80878581843204b2e47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-capture.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d9edec948b67684a97c3f91b0fe5ba070fe911a861a54b7f5daacd56423dc7"}},{"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":"liveness-browser.mjs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a8fdceb9923fd71a9c62a6dc272d7a09e204f381959c67edd1674a85f9ae73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a6416502f97cfab6b4981cdc17c0872b5daf86c6c2f9b198cdabea1d22472"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb899af105cc1b1e63d6dc111f2f5821447813d9bae08164f0c7b0cd29e3e00a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f03008cad9a9bf6d7a3c8a880fa4ec6f6ecc3c5ed08c41eb4fc371e7c2c3669"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aad0e93edb54a18d924666bf6882957dcb04bbb8a08124bafc11814c0710e3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb6410ab5cc39f038f1bba3fd966d9c03c878168a653fdbf38cdeab5396c9c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"manifesto.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef623616d5521703d75190e9bfd3e18b56bf5e69ab3bd3a5d6363d41a298169b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"normalize-statuses.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0f4fb6a9bbb8e0ffd322a537ffe267ad6e56d721c3797fb14eb8087ab98ff3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ollama-eval.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbd0ab5d83024361a470533c09f206a2117d5916f02a7f57712b47953f440c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ollama-eval.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"54647a0ab459ba4ca94dbd9130306199de1342709994e9cd5459b25b251a1bf1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ollama-eval.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbc95291c1a9df63e6675f3fafa74ce02a2dbeb14e75c3d2d83c09855958c5f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"onboard-write.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8c9979b935ab127b3ce01561cafccd4a847963e178c7236cac0a053513d168"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openai-eval.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7489fb8f8bf482bc8f5cbff38069ddb62960362797a89b08a110e6cb1d5b26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openai-eval.mjs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b98984d090861a41450dd109bee53255540555ae2320a091ec78969c36261b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openai-eval.mjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac4ebd3b5384bb581b690d98e06c31d702bf5ac8b5c91f7890ab08d499996b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openai-tailor.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"829d5106dc854bc8af3893164a7d0b83ccc29ffc3a7037bb0616a483daabdaf6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3487338450ebeaa6970355977826149e722a433560d48e8c9c706c64ce5ac8de"}},{"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":"openrouter-runner.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"24af5d0ff950c7ac2cb0d6a6d062c55409962271267f05d6067689b58cdb214e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8046fe81138ed632ac05f074d6c4b8f5faa510989b2ec0510f850eecf93748"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"outcome.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a40399897d0c347879a071c17b6b590679ce233623fd02b1f226ddd3e4045c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"outcome.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a2eea70e1fb072dcd7b3bb91ebf30e06ded306e48c119bcf1d7851e7847103"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path-resolver.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5bab5618bab641f64c9a10733bf0aebec2b684a684327f66e863ddf0633ec7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path-resolver.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce38d9da540836578a45c24e552c67610d140596973062d7f012b76bb5f3fb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path-resolver.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"65520c71a24466a2e6c351e41c7bbe3e143d2c7c20c78415ba08f6177d1ad823"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin-install.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67c8927ec4e4190b8203437cf699ef746d16052bc417cb60819780914debbfd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin-install.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a32e3b7eedaa1a35bc66d5570035de6c23a9b0c3b9ae7ba947bd9ba290864e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reconcile-pipeline.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d392b66d552be26832e6dd3bcc3ba7b567a59d60530a17c1e9be221c11b0098"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reeval-candidates.mjs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7534166f92d653585edcf0edcbac4b0aaa4bde38e8ef8cb7503e6f954616ae2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-watch.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"648d2a26469e24563f015a2b72a3c359a598581af730ba5c0b3b8815f2c0e7f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-watch.mjs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"721be2d4c688538870791edc0786578a4123aa8ecee0bcda725e81d757e74c21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"81551f53e89bc4e82a30791676117acdf5efe4df549ddb99b16fd5323980c98d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e468a06768a3fdc1e7bba364bf87eb5c26a91fc72f978d21515381fa018692"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282474c7db224808c6e9db170ed2fd644dfad4798964f326a349e622e009f46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af3468b5fca2288d381226613d1a94fd6693d3c30e7129da3135b2f8d42627"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4708e580dcf496eeebef98873198af7f36b2e41ce009948cf87da50b6f0cad"}},{"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":"scan-ats-full.mjs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"246d590bbd18872b99dab1acbf7de5080bbfd898be7511c05cf5784aae821f1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf27e10999a3560a88dd38b4bb2ede1cba3764b9a4d50653753e16fb127ad240"}},{"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":"scan-dayforce.mjs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cba72313ad521f4e1be46c531157a304bcd8ea0adf73982000d05076af9ee0c"}},{"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":"scan-dayforce.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a5855a1d24b7007156c7182a125ba129f7df584596c9bfaf6ac4c71cb0b5c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-hn.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba5bb85fadb4c437d9b424a37ea334d2045f0b2fc55395a151745755cd5a7de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5a3c2d0a2c00b0fb4c38a19793c9e51aa6d7e1b42e1700b8e4d00fb5b2d26c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1db4c16f221ddd9c3ed8393984ef507a9518cb6b460ad44b2d6a006933ccc6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cf97f1752d6d25f7d522b1d5ffe4f0134c3280396f5ed5385a0bb60db90819"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee275b3b9ff9613508214e7d9f02ceb449530dcc0245f3dd63be9192510b7ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb775e8af8744d7c8fe0963126cfa59cde2be7b5f1807acfb69b5b948ad4969"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"271fd3126c679c8619819ca27b10b3536a57a8007e9fd86b570962b80ce6fcdc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":5252}}}],"partialFingerprints":{"codehealthFindingId/v1":"61046622511ef178268ce112f60e0c9b82e2f2c14b5bb628a972918b0920b163"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"set-status.mjs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fdea58abef116b5613b2e9d0d1ec375caab3271258795d03f071d7859acd22"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-parse.mjs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c57a30da61eaa2f5e289549f1e745d60e97b808d8962f782ac7930f8c3e24e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e525c4e9a7f1113c52d23f7a2c7cbe3ea36b1aa1885b3db555e409ad6e7df580"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7bd0fe8ad6b03ab6ea90017c435e77c3cb79bc6b63ef82126dc3eb1363b7ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ce9807cc1433fb5253f59b428bc36ce957e39db9e6efb75e6007a6d77e55d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"590c5c93b3b30e4d4aba424075e8920bfcd8a943c587044d15a0830d43b3cd57"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd88d18e42e84b732bc1d4400fc630d5a71b40e0e81764efc47af51f178288a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"811d9bdaa486b5b781e04b59605874a73e5499f902384c62dd28c22b51fafde1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a0d57fcb7eda76c8d06994eca5453ab67ebbf26384ca8dacc554153c7eec58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"903624cf7db8da5a7d6693fa45016bbc82563275b54930bea1e856880abf9fb4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3609465e45c976ac995274c221d248081339fc14971464eca863b7acea4881"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ff218589c598fd838f011228bf28d1c55569b6eca012797d2ea8ea040549e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b513419143521344efd28ceabb48f6132ede1187d9e020a4fff570cf971e26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"476b532b1a3ef22e5585f5f3a86b0a15757002ef172c149faf458bf90f4ced42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea9ed27ae7f7c052dac8aeaa023b472b4f55c69d34313cbcc24c39e245ae5e0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2928}}}],"partialFingerprints":{"codehealthFindingId/v1":"449537ab6254647fd5cb172f16cd7970d09d4b4bec3f67111373efac17103dae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f95082f87a7a3be17e7a05f5c7125c8c3dfd3a693f8a9bb961c8db719c8e4e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7da9ad741a163dd6b67f1c6ae68ef495a17e1ce5a03d4840ceb4fd64cc6f9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3791}}}],"partialFingerprints":{"codehealthFindingId/v1":"22865eec05b088d3b52fb6c9b954bb41e65bd7a25ba86a6fb31d155b355c5151"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3835}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef08fbdbbe55ab77d50e0a90a9763a114ec7df2873567e356d90c8b18828108"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3895}}}],"partialFingerprints":{"codehealthFindingId/v1":"515ff87d7025525ee843a8e513d3d53180b370f5690c3a20a095540194f4c37b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2f7bc5613aa2ee3f499c96fcc6e42aa4f521fa147f73ba18a043fcd2001599"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3974}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac42f5ed3283e4009a3c6bb36a3a54f24d305ccd530dc7d8874f65d6060d2d66"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":3986}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c4f1160e7b4a309058749a1d5a082a7f32d748515f322f39449ea112c99bfa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca9003a6e6cb7625dcfa41a173d0832f27e5ee7532af5b0c11608b7a4ef78b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6155d477341e1f419555c768600dffa1e27df664ff71c4a3a8fc36cc89d3b29f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda47319cd2b71df550f43778dd12a731dcbc7fc82df66790be6d2c1dd6152ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4406}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfeb76c4ad91ef4a4772d960cfc1f5587b9330e90246ac14d4cc8272321ffe1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4416}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8ae3481230fe341227a011cb1f9ea667234921fcf99746cb1be4582a973387"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da38a284c3ed5fff4e87db62e9f9c6dc45c4d4c041a721d31bd78ece191ffc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4598}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dbb5539b74bc23877cdfda66442626b1d87b4e3514d548924ca9c2b94acfaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4930}}}],"partialFingerprints":{"codehealthFindingId/v1":"533a5aaddbe2f200f55a994cac3f16e57cc60062ec3381eaa2f0269d88563c6d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4938}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1aa42f2f5cb08d2d6e80e53ff64824830a98c21abb715e71e8220df17856b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4980}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63f7d6c2ebf1e30ead2d16f494f0957da9dd313d52d025825f0fe4ff09563af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fd7bfab844a8eb37cffed75ec7e9a4a5f72aa7bd3bf4cf91639d43b0f3003a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acb85636fbf07c1e55222624613ca926e9b0f386c1575e282645909c1d98091"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb87b03e11f65f97519cf191980ef565c0d9b139cef3fdd9cc807baff1ea97e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-untrusted-content-coverage.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed218c225c9a022c6e024126f9e1826a4a36f58f63b1d02c36fdfecfe38d6e9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-pipeline.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cf4b935b59acb07bc077e3efbb2ad1f95b4ed6e47b716f4aa5ae95630462b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-pipeline.mjs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"054c89b93dc354dd59f877fcca01d5c99fe4247ef18d3eaab4531c91862bd3db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccbb52de81a56aa1fa8eda6672e8d8a2599da3fed2c839a2590691d6e04ec74"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"831f0b8274ccf0c12dbf8a8eba1a0a505c57dd8890e834cb6c9b932a8ac39a58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5e35e9bc0e5856bc72b4b6c0415860a859e26c7c1c7fb380a77e1642fa65a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b53890689e0b850a9bedb15bdecda40c4fc0b489911239469c8d265cb20cdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/clis.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5abfbfed2ffe2e5f57f1c69d222664695f14ba321a287e8db0598d2cae91a89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/documents.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e669916bade18b6e1be89acd7d400edb03a14cecfe3cf1b3fe7d4d4a877859e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/documents.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eda89d62a5d80e5b7553a039eb0e1f62abe4e0f959b2cab69e158b4623f0d55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/saved-cli.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b0c9658bcd35d6bc317c41d71674dbc7bcd720ecfc3e6fcdc9f4e3a7249930"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/saved-cli.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a114fac0e5f25cc0d968d49f15e483447ebdeadc0aea95585755091df438a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/scheduler-status.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b20aeb79e6a859981b0aff45b3f3b30ff4c619c97f06c24f6423a2c0b61fd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"712d10895ec9f463317a9643864dae26324d2b7167bc9e2e3241f25b0c8adfa9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaea9bee3e483899bc0c9b3a59476c6bd17d7ec1dece00953e9ea639039506a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"88436565555f02229836cca7124638e61d37a82a6331d7f0e56f98d5d5e98ee4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc5a9cafb8d282bc725dabd30dd0fe2c026dc61a0f934381fa8467ace5a2360"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f046811bfb45f437b54cfa85a2705fe04db137b898c966aedbb79ea4196787fc"}},{"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":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"93825ea3a3e9010b4669b68ee9a8cd8296b9b23e8a4c89d9a26a7feb40ea1f0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cli-fencing-probe.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7bf0ca49b2bd97c0d42ad4cc06ae08ccc499418b0a7b585d14e1551f23a852"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cli-fencing-probe.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b916cdd8fec9b67fa8f903012e6fa3969676082d279c1330f280e8172c9d730"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cli-fencing-probe.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5eb26f0fb7eb9061e9bde46b4eda183d6695fe99f9571ead48fe10c284a90b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/extract-json-object.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c545ad4b40faf62078ad1616f3d610727b9859f61d1b1d9fa16adf2f2b1b5481"}},{"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":"web/src/lib/inbox-skip-client.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab09638e826b2a3834f84a426a5b679e86f25c2a24c659aa3cb9095d0cb58a6"}},{"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":"web/src/lib/job-stream.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ca6b486ae6abfc14368725969cb1c602c3f7f3b32700984cd5bc1f83621432"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pdf-render.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"944befafaaab63b3469569a76190a8f12d389ed6fc80a079bff1a1f1261d46c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/scheduled-jobs-store.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad101e8e0bed883880473f660c62aa30cc0a7e0df8139c12c137beb19dd0fa4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/status-cli.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6641f1e3212363eb34399989cb3ad7e928e662bc819bbf938281c93c33e1b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/logbuf.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e3a10f0e34851a500968bd7414ca89e51e7a3efb325680d57141a7e2e4a35d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/logbuf.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"589959ee1ab6dfc35791295d06b00afda4bb530d0289c8d096536d9fcd003caf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"de24705b538ba024ff3d699c709cde03af4d693d95afb0508ec1942c4c74abe8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3288470d5194023e884d2b0477b3d36946db7f15408da51c76ba5287ce81ebef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"14881655d93f82f3d65c513fa85b4f7d5f0f0391f91df43af69ecceeb4937b71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe32fcbe5d3adfc9772da38ea482897821be93fe3830a151b9948718eef89c93"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv/quality.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0996d359ddd900c7bccda28fc04d58ec3df6c72fd0227d0afed1b8539c39d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv/quality.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08e6074fe92a9748c5d747955a4dd5cbeb2e9bb911a60db52391e8ba2480822"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/discover.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7f135e328265b7f96749186b81e6b1f4f42ee1e0f09db9286f25eafbcfc4ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/portals.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb6e7872c83c79e19070323fa64d94e70d341e8cfe2d6ea99ba2de805eb4b04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/safe-write.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"09891e781ff6902cac5d60b124d7f77e6f56175cc91f0cd3db3547eae8503266"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"01111b9b033c07807f2b601976ea8fc1f87a43f83c3b7cf41681f04dabd20c43"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79ff2a01b3cd31fdcc9bee7e99df452f8681704b00b9365089b55e116b2f189"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/states.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a340d152abb0e24e4b52e8a6b80f93f38d52119cad9c0545563e2ef9fa1e26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc849ff5e37f141c9dba11607023c24526d866d2177fea467c047eb4ef2a3cbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"da81a0bb8d629575a76c4e2e3237cfa871239a8bb32be2058755d2e9485bde08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84a652f2310ca957828096a368ea5b5d807fe54cfd839276f5b2a6858492ccd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/pipeline-writer-result.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"205ce0e5882f2b3bbba0acd80ef3817b627e0a608b93ca4e19f1f30723491105"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan-json.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"20119c0060f77bfba6d78f1e83258885b2477ed81f024e0dd378dd0fa50e6017"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/url-key.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"679bb977ddee8c2070476d4ad2018100c7bcbee1faf3d0a4d01c3dad13bd50ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7d9ddb16f06d1b43addc9a30f8e18303ac0574084950a7de26d4518f7b6883"}},{"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":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ff319acc878b2801fdbc8bb34c886784184e988261de601a9608922ae25d1e"}},{"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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8659332d4856d76476f14bbdc6f2779b7676a021e7aa8865f55df0af729d6191"}},{"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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d6b1a7d5da3aa8769261c79490c25e48fb0ca9f111d5a339f2ba04d29351c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"855110b7d52190b7f9c65396c30363728ba6bd4d6774053b96268b2f52e69cfc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd835a6c22bdf734b63467f3f266e7eafef807a78b800e5c8ef7f06b573ae1e"}},{"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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7367e2d3d2b3fd366b575bbc870a9336c44032ffc195f3c0cfb0530386e9e5c"}},{"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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fea57e1c18f06a96f3038cdb77d577d78264f442b736e6894dcd6acb11d705d"}},{"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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2f1ac1cb5c34731dcac1b4b391c021fe3b1df2c6d3d843c1647384a78d6a47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b22a9eb1204e6bdadc00f40d5876b47fc5e4a563f193453b35a3e899f9d539c"}},{"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":"web/src/lib/apply/drive.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f878df903d219f004efe6894be86a47bd79768451ae232ddeffc7276baf719"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f40f0696b96fff4bf59ab27c77edb2bfbe018a638d733032567ca514d702c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"889303156cd6a2987a910f8e3916662b719d8a084be29c16cb14ddde4791a8dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/planner.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b0af744394fe88603a299c8cae79ec4caf62b9da73e8d0ea0194dd6bb89f17"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cc096415823225c0e7ec635f006d0827aebea127bb9b4a19c52d9dccfc257f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c2bb8ace88d70b8a922341721af86e5cea803ac13b463bffc55b9d9536919f"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fed2019d1d4a9cfabbce9878259482f3b6127379237aaf7712da8de28f07394"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1349fc7465e7a3655372ef70e241514804adc8d0236cd96d66d358d9d877d3"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a549b1547ccb58403016e5b8aadaf251dc47425268cf8422f3651f4941e346a0"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"62838578448bdadfa2c9e4dbbbefb09ee88abfa24936874dfa78797b2e8dd989"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa3b33c5459a585e13864539722e77da7c2d1ef7162ef1364999c97e63bc631"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8bda0bf7f450f38b52664049bf36c1edcaeb4eeead8d8dede3d745f86caad5"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0739a122a71af16d141f621b35ba08b05529820eba3e26fcce64b4b4309adc7e"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db88295e0dbe48293d16ea2a62831d92786e3c270c3e85f5acbbceece742406"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e537780ff323b57038198dbd6967aac69f96c82ccd2fb659bdb9d4d71f54ba8"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9a8ee58d713248883f225dac612e24108a953c1e6a1f30f6449a65e905fba4"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"769031b5ef6f11f562e85e3505f5ad6035c5361be1657425d9bdb2cafce73d20"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e3a3a9468bc8e4bcb242fd3c37a0477fb606901a244baca42cd956beebb57a"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e08fe4c7482f8385c11a924ba924710d2aec9f91cd1a72584bc6062a3b011e"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1cf605b38f57c1231e59fa6a029557fbf40a4a1fc59c6aad7e408b967fb1c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5a0fa8a30b09336bcdf0a0b13b5d6d12ed13d859d36a65c5aa31f3d32bed60"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01de3e836f51b9566ae8005df0861c7401fcbbe5807f08f6a7409047bde125"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ae9b01e273ac93cd4d0b848c0f02c5de7aafbeee49a0a941e559c4e8001902"}},{"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":"web/src/lib/apply/session.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"72db1d7b080a0d42ebdf8220635de8dd533f4e6c8196947459d857f5987389f0"}},{"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":"web/src/lib/apply/drive-action.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41980e320e2ccc6a83fcdb257d39cc035897fff0502b3cd9608a22dda0825d0"}},{"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":"web/src/lib/apply/drive-action.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c7081b12a0a9ad33bab2b8eb406cf327be096f0340d01a260e479d88a7d578"}},{"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":"web/src/lib/apply/drive-action.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aedb7cf14c9baad249c58a5945efe84364ec113bb3063dc91d7fe83e4f3274"}},{"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":"web/src/lib/apply/drive-action.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"471b7c389f3cfa155be4b83f6ddaa98d4d6d66538ce07896535a4cc8d5f5f2cf"}},{"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":"web/src/lib/apply/fill-stream.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6392c972e4d0f827d05e391340f25fa732761ec1c80d6878eb7f69c86faa7f"}},{"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":"web/src/lib/apply/fill-stream.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cda8583b541eeb77a1fdc836888b6e4a16b0b7330a99501022848a2936a6670"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/url-guard.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c34da10448d3a854b55c4b611afaa8675f0a38f28e9e806a040d6cfaa353b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98bc46c281c3bc31fe4e96a7fa0f6fee43c7bb16e15731af4427687ea5fe8ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e5c875a661fecd4def5aa294fce928a84d38773f41e0fd6773fd86ed0f04e2"}},{"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":"web/src/components/assistant-console.tsx"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef79670f09ac99b71d6c8cd47b391f40afe65a031947fb5238de06e6b7b403a"}},{"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":"web/src/components/assistant-console.tsx"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d57fdd516dbb3f3d67755e47a731cba01b7dbdd833ab87c1126d88350eb4f7"}},{"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":"web/src/components/assistant-console.tsx"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"158981e328ef104879b29a64f39c7d39e31b05e29bbaf660a8907801f917677d"}},{"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":"web/src/components/assistant-console.tsx"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"705a40b854fb4a5e5a3529ac184920f8c3ae277a330f770ceee2768bca9ab913"}},{"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":"web/src/components/assistant-console.tsx"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6385dc208ee45fee651dedd9ed6afb7d62cdab039e758b8d096c621eb6f5094"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5853b7f724ee8ab7aed6872f12c92f430e2ec665348970d73c8b1f0ab9d045"}},{"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":"web/src/components/assistant-console.tsx"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5f58c3a78966266b525c409c4fa9f2857da7422d576bc3f62dc382ab7a60e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"287564272ed973de230255e62b4ededd0ad01cd3e1de92b6c0df1fe4e457203f"}},{"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":"web/src/components/assistant-console.tsx"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9dffdff7b4364822603affc798ec71eba97287b4af389cb87120711443eb95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c59703556358bd09d2a82db9eb7ed9a717e3db150a0e679d08fd3a7ec8381b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/copyable-command.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf4befc58a8f0d09ed6b811a7ef952ea9c24c81938c289cfe86167cb6fe3a3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/evaluation-options.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"529a8b39f58ec51e7f7152c294fa3ead918a0d03e21c55e684786127781a1944"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/evaluation-options.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc01635a823d50cabaae609e8877834fd893923a76b8ddbe83e9ec1c0c9553d"}},{"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":"web/src/components/onboarding-banner.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"78735ab7bc0a90917b9720d7305cb1e3abb88c808a29531e530127dd12ec7612"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/route-progress.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2da92b5c9f6d2820adedf7b75ff25fdbca668aadb3f3e20436832cd629039c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/theme-provider.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"945302051c55b70e732f76ebceb10f59c247c8a21c924561443e44b8abd3d767"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/usage-meter.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd4cfb1a4503cc01f32b3e453b72cef1e34e23e509f2938c4c84d303ed09af9"}},{"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":"web/src/components/usage-meter.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"59046f5b28a62050806a64a6fca96e1a14f389d205373db5f164a0121432533e"}},{"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":"web/src/components/pipeline/pipeline-provider.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8bb35c0e60ab8cb94d9fa75a731e82ae2b2b29a95f1f7492b346fe72f5953e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0ea948adc50bd3e512ca3308e27b6cdeb963eb6ae076ff4e4513a20dc62216"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"75549b67381946c5ffe29f37e48e42f0e67b92f08edc02148a65b6f8fa184252"}},{"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":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2602310d0fb7d0eed837d0afb11d502b08ad224715fce5e4e72b567244fc6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"401b20c7d537e4565b871b3da566fce5bfb229f1a3010d5a8880e72fa77db8b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e0930b6f7c8d98bc0b8ebbc262e85b24ddec3a3907efd172086c6dcdd96d58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"320eab8cbb19be609eaea7671db52359f7a748088dd7b2e8cf6ff6f251dff2e3"}},{"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":"web/src/components/home/onboarding-progress.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c255304aca79e43f9435b3075593c7b6d83f04ecc96f76caaeef99fc4352a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7886ce234133e94ff242009151ef091405809cccc25f1d7ecc15a80ea9fd8770"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfc3d34484d3411549895224eb3d06617c27712f6ea71ea91228a9a56f05649"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18470bd8151b5de35e6c2abcb983cdba59b716c65724aebd38bbb7e327440c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"529f0739f35eca914da45abddb8e934c2cd91bd0a03f4939cdaadcba9694e3a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"8531db911c6033a3fe8391dc3ac911041ebc37d8569d3334cb071709c1f5cb51"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/first-score-view.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"375c6cf0de220ac5cd83dd45e609cf342ae0d6e8140f0edaeef0c2f6850267ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/first-score-view.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"868938ff91e8cbea6db85205c1220978540fe6fffa2618ccf0d3f59e1d940c36"}},{"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":"web/src/components/cv-studio/cv-studio.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"972f5754706e829d2ecb319daeaa581875e2d4cde25f1c4c294a3f2aad44fce6"}},{"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":"web/src/components/beta/beta-banner.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c743d9b0c9d426e681a6466a4af19e056e0ecc27c48f0b5e3f045f02bcf8e95"}},{"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":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b06dbc7203b50141b791b56e036aa36ca73bdfb3fa14274069957f705504d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"61724bf919146fcf1171a55f7252bd2e8d83b8dc702b63e031d8efd46ed50029"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0d9aeb90b0374d56ca28794f995793607dd17aa84f88f74e2c6e152848a36e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/explore/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91f4303af536941dc4456a93db470f01da789933a709ecc9defbd0f05f703dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/explore/page.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f52c0976b3585c729fdb134ffb0e3147c3db866d651e3c69245e0054e2104e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/version/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffa72ad43c859f5730390bd5d479139ff663d9d153d16b6715eb96d7a1623b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/tracker/delete/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea9fafac0d002eed133bfb50bdb1c17bb8444b91b60a798b4e249f34479fc72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/scheduled-jobs/[id]/run/route.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9e6f8fd13a117209a27f495b0a1c3354c49ba7e3c279df9898a616d3c5446f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/scheduled-jobs/[id]/run/route.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"989ebbc7fee0dd7d494b940f44333138798a3ebf67798778c24a3cf1445e5c76"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"158a6f57646c46d56db0f33228232eaac3cc4766ba7788d671aa47841141daa5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a547f192cc590c95bea30a1565082644e7643d86d291d92dce180491f3138a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"e145d8b430040c7c20b1414e09326577d2da3b1bbb74a3be69cbc8a7abc1562e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/logo/route.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"037ca8f5f8860cb63919ded7a11a2e016bc74ac83f9b4ee3fbcf5a33e2253e14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"288c3d649c9a6371dd8d7572ddf70dc69af36d9477f01a35d56dcd6f2a1f87bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/route.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f438b87531c71ada51e02332351698da6f693d809828f96169656025bd0401a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e068e71e53afa3ab5bc2ea6fc57b893b51499b6691e52677bea2ace39518e4ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"801cb6488e81c5926c06fd5429cbc9b9e6409f1f9a3500ed7cce971e3b4288b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69a59b8537d909b6d21e310842f842593056f6311657e2b6bb6aadc9e15f9f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12ad3ea9dffca75b405d903ae0ab97d40d1a0af4275db60a6ade40df962138f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fd9eaf621ffbbb12ffb10d1bf10e724b5e0db7f66b7bfc9b4c4500a284b3ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b56e524d573630ee84fa63c4e59af2232feb7af57a6b5400c9bcbb68932aa39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"161c0f2fc1f0176db835c86cf3bcaea752e5b465dd699ff6bf091bc5b4305be0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2765309c538e80837ebbe1977218a0e5a1ca0c5b021cc52f6cb12c805ac0a88c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"055ee6b3b0c9fa17c449c925e9387966f60145977d6240639204877616ea3a68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78e8b72efb43a9e0872387123bb624440e679a9a28bf370825afe39afe06b1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/assistant/route.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59937cac521d71db52b587cb02434abc391b44cde34452daa56e8b271f77342"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/assistant/route.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21979eaba144268e4734d1717ba8ea46c2a71214b08edaa94e867dab395f519"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/assistant/route.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aadc55467e74cdbecb2388bc77b2343eeb67d7aef51f2eb16f50a7c1d84b56e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/assistant/route.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4740cf9e8a62bcab6fcd1bef5fc0b06415cd39498292f17ed1665ee0aa5fa0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b6fac025148f2ec30e394e40f3f212c5424868000eb32cf442723ca20e3aab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0152479055a6f6a40e6176ee78cdcbfb0248c1793dda9326817a3a87e0cf488"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9013b52e76558d9821f5d55a1733dd31dc5f11f2575eec1a73c79bd86af8b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97cb48e739c6e5b9a800f8ad7506a2452b483ebd3ca88a2f7d4a4a29a7408e1"}},{"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":"web/src/app/api/apply/fill/route.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab0773f2bba6dc7bfe8ed1b60a4ee1b1edc4163ebbbcca98466ea8d7402987b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e4ab78e0c51a924de00756dd9f39eea9ff9414ea392eaf23d6e575a13920b6"}},{"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":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf041afee3dbb6e146de05e92c1a8c8bda5ef3921ac11d8caa8b18b4a9b7dbf9"}},{"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":"web/src/app/api/apply/close/route.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ac3620059a4b01dfb24c4d1409c3cad7ccf203ba368d2440077e88eedbaf93"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5700bc17e072cda7868bca1fe0159d006698c87c0cb7d304908145b4dc09522"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe8057d073768580e9ee82de67a299b7ef8a24bd607b09d03f1bedddfab2be5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/claude-plugin-session-start.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85be6a83b31eb2206226727ada2733c28e7a58c73330ece06b80d73d53d8c07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a307d4d6d7f59c1b9cf705a4c6ae403a06c8ef96dbe8bbd365113e631decc36"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-server.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5048d1f928acd3affd4487f225722143e762a5764ae8bf012f7bc541124877"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ui-server.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9b4d392bd1cdbe11a8f881aaf1df1e540525a6c9ca840f050004ed8973f13a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/4dayweek.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb101d964a39da3fa088acc28e6392d533d404c93eafe8b4aafeffb4043f83"}},{"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":"providers/_connection-scope.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e874916a0cd95fdcb8bb9493641dba14cda7701bbe41dd90188255c914e5d7c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"02be8f57e59183ac6292db8faf17c4210765bbdc23d299f10ca9b801d4278a9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3ddadb54fffae6d5b1fe95d46f7e477205ba601d07c74f1c042d5a372339a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b849cc51a9a08cbbef90ba13182d808e518854d8bf6b7914ec6462255e827ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eece6674fc039f5131e8d462896d2d61ac264b246da102db2a10b552278e3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2038a726ec80bca3037c83f9b6cf847f940e3c8aee633a0d91d5e345a05df3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"966c5b6509f29adf4c7d9087575f722d64953d0f53d09c5293944faf202e0ffa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d80667c24217b82f715fd298bfab51bc9224d782c43ea777afd8bf2131f88c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"13474bd3bdb771ac62d8b1fb1362df52f07bdc9ebfc14ebf39e20c18af441242"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7424a520edcc2143800843617eb4f74116636d20cfb29efa845368011e515e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/apple.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e94ce0ca8b57cb7f5d9a8a7e046d8d98f000c4175eec2e0d43afd9af660b48"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/arbeitnow.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2742c25b9c43befc6ae9515659222f71664367a2beebc8bc05ae9e1a245ffdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/atlassian.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6c86f22a4377e5e60116ec10e140e750e64083fdf825298f7884b235dd476b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/atlassian.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d44d14636bab6723dca7b13fecf23d56aa5b0b828d1f100f2156745538e8cd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/avature.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b6532036f805a791ace256e6977569bee605d2501c1c8f95eb2b8fb8a2f758"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/breezy.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"141201901f1496d6818030b0e61c94c2ab676680d9b732e2b0eceb61a42ea588"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7622e616bef808c9dafc51e351b9924943bbf842f90158b4ec0d1b2824c2c070"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8054d1127d016454a88d3857fc3955d6d4ae9cf96862c95b2a337dc5ef0d66e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/bwi.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"158dba5a155312c265f57bf332cbc09c12bb32af4ed3300d62a876006848af7d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/bwi.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e4407f272ed440e007c033879e7aa1edeb8266325e51bbd24a794d31645785"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/bwi.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe04f6c20a8657742ae3c85c5c6a4b7d8771d2d430b75cbc28f63cb090a2365"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/careerviet.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a254c5ab4d40826dc90c1fe8dc8f12fb2b8eb2b42e46dbde0a98e447f2de5f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/comeet.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc7ce2cbd975e90f641f19a70a287a7cd2ad8a4732154e7983fc6ad47da4f43"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/computrabajo.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28ecbb56be1cbed8de2ff007b203e46967790fdd294d853f62e5b3e5b10207e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/cryptocurrencyjobs.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb647e18bf8eeb25cc9804d078d403bbca4b5a678c996d2390e8df7256e203a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/dassault.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"645fdc685e91ac3032c3f20c642abd20b039a78d1f9fe3f7c55be603af68340a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/dassault.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf084bb4c757e22d12cb94e08cb1525aef33b18385b3b09c02a735d161bc6b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/deutschebahn.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e07903fd191ff558424c003b5fbf3795416b60953129e3cf07d09ff1cfce66"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/echojobs.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe13f792ace9cb44479dae3bd4cb215d154e3676b5910f30936922ff2156ead"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eightfold.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f56dee83686ea3c756c01c72de90e1c0cd3ba62ea33ee69800cc759149bb44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eightfold.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c11d7d6a93410bbc4f112070802fc71369cad5d90adbe00eee81b4a4b740bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde3bb757159ce373a2d9155a8b8dd1f453410811ad245a25f226fcc94b6f97b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1663e0c04785a0bb5a796c00fa13746f615d38f411c08de324748881abae7e45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"922f7976d4d07f3f05caa167b831c4a5dff7ff37dd969632094b5e780b308f1f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/flowxtra.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe42fba88f67671f0f52c45ce99ea6c5759a86f32e793373a15a01127f2b1c38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/garena.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"205a02b9ec946c62388b325af01d89f0a372268389475cd8b39f20619e2ee82b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gem.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee2e0303596b5f19b31ea89acc3b4d7a4b2aa3ab8a4e7b4f922539d4bf8d308"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/generalist-world.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9967e6a54d828d57c90306d055c2f50cc506336e1b649aa7e13202bf92379674"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/getonbrd.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8add935213e9b84e4c5df91552109ebd1eb527041bd025da63a9929049e011df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fd254226ff680c5a3a80e5bf9a26c48926623f5b7a90d96dd826aac92e657f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5630688027738e9ed69f43b4f38c04ea8be6d248db9264605b6eca2d1505d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gupy.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e32a0feb53ff1f6dc38fc705e10c4d95d4fba10803041cb811d3018022f8521"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c68c611aa9b4db0611b326379ecdc53828f4839673cb3741ed678b17e1db15e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b04250f9436e5e66963682d5f449ef269e81583eb6e85702b09e1152901f560"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d07fa7f2851e9ea8973f7fd5ffbe2e86a8d86747c7058e13e60eb1092547ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d06cc304426c564738c4fae9148bc8e38e8e3fa9319c9b64c13ba60645b4f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b4817a9f59cba847bc5b4945bcf50db52b035be8f05384f8a8664003ca3e8a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ec930afa3443b0aeadd1b5098b51d6f76ec9c3eacd245a765422f74288a2c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/inrecruiting.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a836e3afd1041c0e720e4b4cbd8640163ee7e55f8642a13154ce6496e8972c9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jazzhr.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"017ab36cfb180908352ee565d938a90e3805a3ed42ea69974a00cf7b0cb2953a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jazzhr.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f7bb5ab27b750677591a2210a4bd3cffeb265607715ddfe2cbd2f6938b54c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jazzhr.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1710ae75eec05d436ab25ef40d062aec7f9ef42cb633a3360ef046586276d917"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jibeapply.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7715eb033e304f5d97007b785fe9c3030ea1aaa561b5c830ee4264c08e60f50d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jibeapply.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d9489b8b8f6eb1929c95b2b614758c75efdc7aeb23a1031915e00529c2ec4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobicy.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"820c5f3e11d7eec834555a06d05ffa704ffb7caa1bb4095d3aa0cebc503dfbeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobstreet.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40d978f59b8cb568fc893f7a7129b2cbe09df16bb5668171ef914a77eed1cca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobvite.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a124063a5e4a0368bc13600dec57ccfa271c0a501b45f3b2a64668e9a7602d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/landingjobs.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff3c5bd6c151bae84fd07810cbaef94ab44135639badffcd3d55637206a4772"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/magneto.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccb58546ae0108557f78a797ddfcd9059a21cc83a8cbd374073841dfbf5c9d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/neogov.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60801b03f2867afde84e584fbde934df43356324791a6d1d79551af506b40dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/oraclecloud.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e015274be5e29191b685f402c5a7ffda96f730d39805b40c4e499c722fd23bd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pageup.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"917330e0822f61dab42488658c2c0eed08f841c2c15b39c97fd92194453192c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pageup.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56403e486c05c4744964834f4d6a27d7ed9cf4355bb281a7f711f8e42fd6c14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b21ce247d3efea41d1e0ba15f18bb9a91a5e2116a21b9b15bcf55c23755107d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbb66c71cb7cceff4d576a8afe456fd3ad3a0a6af79f55bdedccf7d958f7557"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb2eab1b992940697b075e7305173e8db9348744d54d9542a5cfa7b8bee17be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b66096706b7341ebf061a3c8889e6989327202aee9f43428b9f6ce3d08e52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbcc320e83c83f1570c503a35dae4dc45a2badaec8f6e48270d34b4a9bfc73b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0124cba4904571813e84fc05174088e37e626ec3ef6f0174c621b5ff0e688bfc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pinpoint.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d417c4f0573dff1d756f27f5de57fdb5afc3afbd4d4307afdf792b688231a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/prevueaps.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"534d2195d15e22e06b7aef7a10201a818de5f3b29530d35b56ee9dc0b77f2c9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2a65e2b9559e19cbf7ce4ba330d63865782783082c808655da8857f6b56c1f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccc3cb50b9b39cf6d48a60831413207e2a007280a53b8a3576432878b2fff84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/recruitee.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c633878a2c722c9378e859113f8b66dc19c2b8b2e30a3dc512193bc20d68d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/remotli.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65ed5f610d2d485a52b31b585871f620a46d0470ac8a6a633ff9b48ecb58ca2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rippling.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcdcb77c5939d611ce7f8ee62225bed3de55841f543050e82c4ca897e514353"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/smartrecruiters.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"debc3b2fa6700324110ebe399910a0a16a3bffb9d41d93d1ea31dd874855a114"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/smartrecruiters.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"876d9e25d31028fc0f9eedbec34a6c184baf1e3139bb36c31f844de20685e3cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/softgarden.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"93546c417e639b6df9ebc09373f8253249afd4c37e329debb4c92ceba573a2b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/solidjobs.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1704007e47b8c8e7bdfa66709a5b7d9b7f93244a677ca6af88102cab5940dfe0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f77dedb02902e9d0bb05b71d279e2a754d38c25a57d013416f5a8885ef6dafd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ff29d856d2313fc01d4c38017d17c00243ce4f7c3c7f7ec3b5584dbe6cc28c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0b113d54ab55af2f302fcb4448f8ca11bfa08a3be52c0c45e2a8af32eb35cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8684b6a6a87557e7b09351b3e4cb3507d9bd6e77eccf4ec4a9b5c2efe8af0581"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"096e39bf52f6b88fdccf8eb72e21b73d81da65ce349540d2b24dd45cd6581fe4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/techinasia.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb89c9c9e518d7f2e3d4191e4ce961f7f024b2d3a057c64ffe10ca3e2be2ca29"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c09f0a1bf51adccbb24842c5f6516be778c9e5b1c39bb8650b790b95829e2a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceae3834a260016f60b6cc6c44695c4aedd56e601c2c863d7d8106bdfed61186"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/vdab.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ad4e7877413064951e2beab260030415d4a6cf57b8927df5d6f9ebe032b605"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/yourator.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"026a1ee65866c3157e59c3a318a54e292a37cac9e1fe6ac85f145edfd89b532a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/yourator.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a70ed5f56bbfd7c1b51523fd58f5ee8495fdbad00984a6c0050f744ddf9d3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/zoho-recruit.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa85168178ca7bf5b8a128147039cc3b2eee6f377819ccfb9b1a7c23de83ed59"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd147a8d0b1f573738088d389b43a09976fa9519efc65fed9ad9fa53923e988"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2c8aa1cafe3e457127450eccd0693e679a9c3111107731ba4e886394f6ed2d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"d247ff55cc57146c380bcc7f1cf22ae1d9e1249feb5dd29ff2073a14a387cd45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_registry.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e7d420c88f2f92b959926d60f4a67ed6608b8c0055ce34d304d5687e5f5c4a"}},{"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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac95ec25eaa4aceae3c10d8537a97efdbe4710aa7d6dc722d1d88a1e9e72c43"}},{"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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ea67bc6212448a974de1f60210f413806e26e3dcf756675eddd8fbcee6383a"}},{"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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"08932b710c4ab8e7c7860c27fdecb1477dca031648450082d741c6999aeca3a0"}},{"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":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e47fba0aafd40d521bf10d864d2fa74dfce05be1aab961379a535f4a97d0b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eb968077440f14a7eff8f400a12234dd135f41a5c71020d93a611642d0c93c"}},{"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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d185a25f2af37e16e114365092e863d8ce89bad5c457728984c50728bd9294"}},{"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":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0603128d9f212d23880b3dba9c7ae04ce780058da3f8b98417c2d12eddee4fc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb34de490d35c5d497b06d1d30c71d55771eca0a4e8b59bbbfa9432b43594b49"}},{"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":"plugins/h1b-sponsor/lib/cache.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"325149ad81847fa8d17930be56aaad854c8a9dd749bedb7fa74aa93fb7d5a034"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/index.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6accecf057ff596aa631f0e47b4500736cc072ca78a9214bfbadd1753f8731"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/index.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05519b21f793f61b654b93d07267b6a361c32da4bd999eeb4b5b5cbcd11cbc7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/gmail/_helpers.mjs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84407264a885687371effb6fb5123dd78f325606ba0066099db551303f9a9fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/_apify.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeb493af1a59ffabb92c3d92ccb1274642a2a150604297e445d2113ff98317f"}},{"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":"plugins/apify/_apify.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b1c8e69bb1aa3851dd474da7a05d179cbe7a054c42e634411fe3fb2fe7c4a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d139591e504e5949c740923ba7c459b121999d237074f821cc66b80ac683202"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"047aa0cebe690a562211d69c60a30f4968455eb2ce3a6e9925cbbdc4b37e28a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"70411f9c17cc5628af7610315411a318f618a0b84ce980acfe225036a5c53e54"}},{"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":"lib/pdf-server.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcca671b477702e940b8b1a6c46c4099a6bd4c9e2335ac860d822655be35e52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pdf-server.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99d6fef6622dc292331f4d19837832c984f6cd7595790f10ad4b745a3c6a296"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pdf-server.mjs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fc406724e5251c25a34746624d364caf540e9ce84c81b1f9f7a760c73c0e17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pdf-server.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1362c9d8664db09096e4a13e86d23c14cf1fa09ca99462052442d3a1159bb1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pdf-server.mjs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e266c1f5031280e8962c633d6cd08aa538a59652294ab3fcc48a138ca1fd20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/scratch-dirs.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e3daf2d2698419d262c29d00c71c7741497242a90511b3c4f6de5a4e189ec7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/syntax-check-child.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ebab49eeb2c8696788fc1123552181072d2a1ad18f1aecad0971864f247096"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/walk-tree.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac43c84bdf4a6902ed7f715ef3e63565b2d103604ca2c6bdebee8f880c3abdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/walk-tree.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"739e085d91bf7b704a5fead9e2c09cf7f14166c95139f4563b3b3f7cba08ef35"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/walk-tree.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"87448a9a969b3f88f6d736159d747ae95b967580924d6ad8c7047af1d46dade8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if wdErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/main.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc14add80fcdb4fc0259517fe4373672d80367f805204d1d15487e112fc121b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Stat(filepath.Join(workspaceRoot, filepath.FromSlash(entry.HTMLPath))); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a55bf33c686176b94320c0a95aff0113e7dc420cc119ab272fb3294f10c43d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7710e34a698c6fb7e052629c1078cd9e3fb5686e348aa792c83ff72bb8c494"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/viewer.go"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45c0153dad3adb698b51587cc6e02a7476a339adfc45c4925252ca4e540b5e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/i18n/catalog.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c737f101d4ad2a77622139fe06b0586e455ed27e8aacc9a06433d67eadc6db92"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f01ca5a9ef74d3c6f919d36f0ecd378d77293c1148dbbdfd5419bc8ecd6f21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea9ace1c16b65f9f46b852f4ef0b05939edba5c795129fd0085cabdb3569502"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7d79fcdf5ad68dd9978d0f1d5c594107b4b03344ae367588ba654dd05a46f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e4ec15147fcf48e5bf95145ae6977edc67f1735b43bb156506b5b0a2d84cff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4451161d4163990149fed3c206feedfce524ba3383d08da3360cc866e26b2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c528acbdd992868b4efe030b4e45e84646d8af5ecee37976199bc6059ef67758"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146e398b032d12e8d120397681958b33c810737d348bdddd163c1c05d981d7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"511041cc63930d9f924372328f149b5ae2787a7598358f9eee10870511525fe3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2687f896c345b1fe77c527eef8fad2da01ec397cdcf715aead797d9eb06e122a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d21ec269c5dc5d7b113de776b56ecf5bc908430daaa8d52957af28f685d017a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/derive.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c04a7a9d95e80cf5ffc2baf213b8272e4f8d424621e2f2b3e0d2dff33b42ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/funnel_history.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11b0531f5fcefbc9cee3d867ba6f77085c00544591346a64ca62e94cd2c6c65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"28963c5fc5bfd7d1392ee970abd35ec3d2980760a69d987896a547eb0ea39a20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c39b86348ccec31babc99b366f1978c00eb5bda32bd16f14c7a34a10f3d69b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad55394bd61056962cc2a149a090084fcc80b5a3e98b53a2d8c14ceb9fc40d10"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8658a643ae51570dbbf4f96460460db6f012d4e834eb03eea2320f9ef1f2887e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bcb74f7be806fb1f5e4f0b62d793e6c629451eb2d44fd5edce1ea3c88255d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/tracker_lock.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8036baf4a1232ab400595f623816e6b72ec804cd0857c5aa6549d118d47c2f73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/tracker_lock.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"869e6aa1a3de95b57e273e36d8077ee2f8d275d49da0de26e3c570c7f5a870c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/jd-rescue.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca149b59a4ba898ff83e92437b6bdeb38f19b30f1373b0b4687980029b8b599"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/jd-rescue.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"538cbcfa428a18808cdf172993034348c6482e30f2410bdc11995a5e96ad30f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/jd-rescue.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"08af85a2419aee3c729d212c8c9b424a1e2339f59b7798a8ee1e1e0af4915f3f"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) reduce the strict null checking score: ~0.5 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 14 assertion(s) across the 28439 source line(s) of the 232 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: web/src/app/actions/registry.ts (3), web/src/components/inbox/triage-row.tsx (3), web/src/app/api/explore/ai/route.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"edb251d0f8dd1deb75ff6fa12d145c3d5c948a70b0aaf8da052107c857335979"}},{"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":"providers/builtin.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c101c894a03a51eb33d7841cf86a3cf7869a8292d1186da7cda2f3cfc21f2f"}},{"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":"providers/bwi.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c23c0de611a50a154646154645381b5cdc1218a8300d43fdd8a0d5afb8ec13b"}},{"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":"providers/csod.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"82146368bc514e68e6b0bf1b59aabd0c1fbc9cfce3fdf3cc2a4474a634a872cb"}},{"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":"providers/pracecz.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"03254dbe31c7b0f9e9daf3932090c61dd566cf28d3c61d53ad972a78149e74c3"}},{"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":"providers/pracecz.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45706d213ecd6b801fe32565c672e8a92ec45d1c6886e756439aca84f78f572"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060getRepoRoot\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022.\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0608d29abbeae746cfce0e3f0e7598b28c028784a2ac22972574035e2b1ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sortPDFsNewestFirst\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d41d5f921fd13e73dc6fd9395e9243652e154034269b26fe3208e715182da3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060ResolveHTML\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022, \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e541e37593ddb19597dbc78c01614b063d2702b1a10839198ad1d20a5ea1d5fa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060calculateWeeksToHire\u0060 turns a non-nil \u0060err\u0060 into \u0060return 1\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aace0c1bf8378a5845800ab9eee67c0dc06d914cedfeb0307403a36ef73d11"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060findUnarchivedApplications\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":"check-jd-archive.mjs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0affd08bf85244176b4b84d375e5e7599ebe4a952ed537c4fb2820fd7e7022c9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060normalizeUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"59239881033fe1787742cebb40f3d9b5a709b10a8fdb246e2c41f01f8c5cd637"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060postingScript\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2abdbc6962dea7d7c2fbf38e04b6a1c381570898bf08b4b5fe1428d5de2f647"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/weworkremotely.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca80b0a12f28e687de6f898ad240990ace86bda59d56ef461a2a472da06a6108"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveProfileKeywords\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":"providers/_profile-keywords.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5218583f67f90f62753f79875314341563f363bd0436ac28ba5cfd3bdcce33fc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readIfPresent\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"history-ats-seeds.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6791a5ec78d2be3be8b0b6e9f160612167c8e6034483e21aa4b680d11e08611c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readStyleTokens\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":"theme-style.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8459198c849c91ecf88d6eb5e1480a80ceb55f6794676870d6dda71178a906d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readCvSectionOrder\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":"theme-style.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e81c48562eb1f290107c7bba43b5b89ab5632da55b81fc0bd70e3ff23249656"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseMeta\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":"lib/template-manifest.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48b855ed3ea8dd4a4ddea6275c2ea16e8bba165ed81d77b203e852a1903cc14"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060profilePhotoValue\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd24ada56bb998ebb85d3a19f8e16d95518fcf471aef51e2bf72525b62b0ffc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060mtime\u0060 (in \u0060outcomeDirsFor\u0060) swallows every exception into \u0060return -1\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":"lib/outcome-dir.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5249fc38cfa1cf6351b0e79b7504e32858561e759da4ff5770b3139024159fa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSlice\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":"provider-id-cache.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"78618343d9340b521fd96c06cd09d81225155ba6ff0ca9f7a9645a050f577eb5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060locationHintFromUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae59b44abdb1f7ac5e3604149960444a08dabb0d2bc28fdea1893fc801de1cb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadCandidateCountry\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9a7cffeeca1a53d7b65b225ff92fdf865336da63b0984f67317fdafa3aedb2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadReApplyWindows\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":"scan.mjs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b9797a880dc8c339a8e7d587294da81767d841ccf5fbce60df058fb024bbe8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060languageFormsFromUrl\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":"scan.mjs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a6fa6cd5f9b0b21145116ea01f2fb4949cd738d764e29618077887085d14ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadProfileCadence\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":"followup-cadence.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae023cfd488a816d6194f484f0ed2efc1c472803e8570d0e55dbbbb39fa202"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060emptyYamlPrereqs\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":"doctor.mjs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"997f8297cd1cb386029368969575a2981681776bf20bab51197e10fdfadc739b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadPersistedBlacklist\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":"openrouter-runner.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"042c8b828f18aaa88f659fff2d9c0983c7ff81efdeaaaa9a9c3d671870f0c62f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060countryName\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_country.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b1e9fd573ef672216bf28f2e9bab5d6f855daa1cb0e4115790a6aed21c6173"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060slugToTitle\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/bwi.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6352eb6ae3b4037e00826a2c1e7a2d1255b1cdca91ae6cbf20d84e57d9c3ffd5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060absoluteHttpsUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/collage.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a413d94b1e1b66ef9a250a47a79d18e2b8864a510ee70db29096282873e271c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060deriveBaseUrl\u0060 swallows every exception into \u0060return \u0027https://glints.com\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/glints.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c2a4eb38c35bd53c08463f65d8e4ee4761d6d12372bd40c40c433be1a81ca0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060looksLikeJobUrl\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":"providers/hackernews.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b0b53ecb728ea104ac4e8db6917b11a2ac445bccf8b2d48d0830186142c7b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/higheredjobs.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"609d39c3a55d66654c493f7171b9aa89f9b06a4496d40187207e0bda8cd32ea4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanHimalayasUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/himalayas.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc426d6515380a80d2be5424ce517bb5cea2251e3d6ac42c3092acf2a9f6a634"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060httpsUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/homerun.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ee630e0754aed5faab1aef617ef13191f6e67e8323c1b43d7158654844d18"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobbankca.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b775e74b72bab6d1009f621a3381f9758623cf3d10d0e5eb76e204f42b1395c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0022\u0022\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":"providers/jobspresso.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a77317b9ec2937786b9beb1ad7a7ad28e4c9599153290cd71dd4fa9c2c2a0bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060deriveOrigin\u0060 swallows every exception into \u0060return \u0022https://id.jobstreet.com\u0022\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":"providers/jobstreet.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5232a1969510eae5737e15819bccce7a8995e43b694296fe74da89a1574356"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060buildJobUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/kalibrr.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d66ec902e7f3bce77951451357f70007b94094bfdc845e12809e4f9eb090d9b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060companyFromUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/landingjobs.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4cc9fc83ff3572a97d91e7db282e9dadfa35b8169bd96f598678d914e505d3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/larajobs.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"25189bd8a78ae525a7e2c99011bc93b6970ec15a2edc1b053cf54c5aa9cdda3d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060normalizeJobUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/local-parser.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0676ae9d012c60e7bd01ef5bded93bd3c7e071bb23b314fce3d8809cae6b0ec0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/mycareersfuture.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e1f0e8569b6ab9963cc43341148e8ef762066b790903f8367d52058a3f386d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/nodesk.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc844ba7029f971407d4dfcb15716b4e5d282d4215e77e17837125255590092"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pythonorg.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"694a9e1c7b2ca7455a696cea8dd54a89e2d4d06b880b0536fd7058dd649f1474"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/startup-jobs.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dbb54955f23dc9f52a1409a9dcadfe74f7cc439be252b96e8369d07dbf0199"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cityFromSlug\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5534ce194a7e95b7c47ee5b03c105409a3dc81fb13e2b5797451ce1f03c706cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cleanUrl\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/teamtailor.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d987a044eb27834ad4a9c7a3ccad1bd6378080c5e1be6b79bd75fdccc7d0d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060externalLinkOf\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/techinasia.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dd9587c97c514bf6c87637da5325a7ed7d09cbf94903617238e90c3e4e9a4f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060linkResolver\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/wp-job-manager.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca81225d59bb9cb17ef6374abc50d81fff08a6c1ba811df741f357ccd112c11"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseBatchResponse\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":"rank-pipeline.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"189c26ef571b6f67ba5ac7d72d3bf2c96d15636f4d969176eb10ab2251c60c6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadProfile\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":"rejection-latency.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a144cfb74082245d9f15fa6dac70732b425f6a468e9788063e3e9978e9e9a254"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseExtras\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":"tracker.mjs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa4cfe0218082ec2e793ab789cb459ebe6281834bb2f0e84162922702510e67"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060consumeReexecMarker\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":"update-system.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6660ad933792f73b9879257b176463c775ca44bff6026475723a02a4d8fa690e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060localShortSha\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"c516484eab170a84dc3860bd38ebdf87561412b3527d3d11a3bab9e97a042f8d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060reexecProfileEnv\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":"update-system.mjs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1608c16611461acafc9e836aa3716499e37807897f69c130d269e97fa18104"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060pathFullyPreserved\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25991cb189c109a0ab89ce4d67027c0fd24d53bebdee3f883b6159b1e6135b5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060headHasFilesBesides\u0060 swallows every exception into \u0060return true\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":"update-system.mjs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc81abfac7d805b35e77a53d889e7245ca5bb73b9ef6324ef35c5cd8e1ecb02"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060managedByPlugin\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":"update-system.mjs"},"region":{"startLine":5885}}}],"partialFingerprints":{"codehealthFindingId/v1":"69172ae83e54d268e8277336f46aeb13885a64874b3737579925bc6729465eec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060extractRolesFound\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bbd475ff453d299ab53625565be58898fcc9890f12b74cf8244981aa7b94bc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060lineCount\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/report/shape/route.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce403aeed48c9b0cb46c8cc701d817c61b05b16d88496b8f390cbd37c0878f69"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060dirCount\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/report/shape/route.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7298bcffd1cc2b48118f73db3896ffa69a259f22fd2e3207c90bbbd06a4043c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060shortSha\u0060 swallows every exception into \u0060return \u0022\u0022\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":"web/src/app/api/version/route.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edfc6f9ac22757b6ebeb29ff3234e1a5f338d66ba18f064c171ad7696023160"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060webVersion\u0060 swallows every exception into \u0060return \u0022\u0022\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":"web/src/app/api/version/route.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa773d12583e316942657175325c612ff70e1cc8911726d306e0d1474f14058c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060classifyEmpty\u0060 swallows every exception into \u0060return \u0022\u0022\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":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"20586ff32d0d716050ba7f3fd060d53da3e5a37b1c1d751cd2987e532e910f45"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060doctorState\u0060 swallows every exception into \u0060return true\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":"web/src/lib/career-ops.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e37a26a6b7840736fd5eba2f248d5a58752c2bcb65656af0605995f7bba8d0f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060doctorState.has\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":"web/src/lib/career-ops.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"433572862055419605c00a7fb0b66ae28f4d3faab804d6608997bf4e94c9a4be"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadProfileTargets\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":"web/src/lib/core/scan.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bec61472beaff9ddb9de3928b07223f477f33dd6b7fc1480a10951d5f8e34eb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060normalizeUrl\u0060 swallows every exception into \u0060return \u0022\u0022\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":"web/src/lib/core/url-key.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"445f9c28f0e92109dc8b22d413450986ca1ce3db85a5c68eeeb109b087222eb5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decodeId\u0060 swallows every exception into \u0060return \u0022\u0022\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":"web/src/lib/documents.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8689387dd802f85e0822999d5216f7efc17c5df47c193dc2fb3e9a2851060db5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060postingLabel\u0060 swallows every exception into \u0060return \u0022posting\u0022\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":"web/src/lib/posting-url.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7ec696c259846002329e6a46538634e4f787899fcd1c036fb422859ba37133"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060hostOf\u0060 (in \u0060watchedCompanies\u0060) swallows every exception into \u0060return \u0022\u0022\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":"web/src/lib/portals-config.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"27811ab13a3ca6fe3f19c69dd96520d0d7c3ab75b05ed025bdd9cbf52ac0c800"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.HasPrefix(s, \u0022duplicado\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.HasPrefix(s, \u0022duplicado\u0022)\u0060 also satisfies \u0060strings.HasPrefix(s, \u0022dup\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb1cc7f62e5f3ec8c73ce7e89bd926a54fca04c644680f3f9349d548d786810"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(r, \u0022administrator\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.Contains(r, \u0022administrator\u0022)\u0060 also satisfies \u0060strings.Contains(r, \u0022admin\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/stats.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb192073097f3c4fd39d026550b1fbfe2dfc769baa38fac98f66d6d33ec8326b"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.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-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"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-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":173,"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."]}]}